Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025600668.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPt-PT-040B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025600668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 29 13:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 29 13:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 29 13:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 762K May 10 09:34 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-040B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653029154731

Running Version 202205111006
[2022-05-20 06:45:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 06:45:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 06:45:56] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2022-05-20 06:45:56] [INFO ] Transformed 3123 places.
[2022-05-20 06:45:56] [INFO ] Transformed 2843 transitions.
[2022-05-20 06:45:56] [INFO ] Found NUPN structural information;
[2022-05-20 06:45:56] [INFO ] Parsed PT model containing 3123 places and 2843 transitions in 409 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPt-PT-040B-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 3123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Discarding 433 places :
Symmetric choice reduction at 0 with 433 rule applications. Total rules 433 place count 2690 transition count 2410
Iterating global reduction 0 with 433 rules applied. Total rules applied 866 place count 2690 transition count 2410
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 867 place count 2689 transition count 2409
Iterating global reduction 0 with 1 rules applied. Total rules applied 868 place count 2689 transition count 2409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 869 place count 2688 transition count 2408
Iterating global reduction 0 with 1 rules applied. Total rules applied 870 place count 2688 transition count 2408
Applied a total of 870 rules in 1507 ms. Remains 2688 /3123 variables (removed 435) and now considering 2408/2843 (removed 435) transitions.
// Phase 1: matrix 2408 rows 2688 cols
[2022-05-20 06:45:58] [INFO ] Computed 441 place invariants in 33 ms
[2022-05-20 06:45:59] [INFO ] Implicit Places using invariants in 1122 ms returned []
// Phase 1: matrix 2408 rows 2688 cols
[2022-05-20 06:45:59] [INFO ] Computed 441 place invariants in 10 ms
[2022-05-20 06:46:01] [INFO ] Implicit Places using invariants and state equation in 2322 ms returned []
Implicit Place search using SMT with State Equation took 3478 ms to find 0 implicit places.
// Phase 1: matrix 2408 rows 2688 cols
[2022-05-20 06:46:01] [INFO ] Computed 441 place invariants in 10 ms
[2022-05-20 06:46:02] [INFO ] Dead Transitions using invariants and state equation in 1371 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2688/3123 places, 2408/2843 transitions.
Finished structural reductions, in 1 iterations. Remains : 2688/3123 places, 2408/2843 transitions.
Support contains 39 out of 2688 places after structural reductions.
[2022-05-20 06:46:03] [INFO ] Flatten gal took : 181 ms
[2022-05-20 06:46:03] [INFO ] Flatten gal took : 106 ms
[2022-05-20 06:46:03] [INFO ] Input system was already deterministic with 2408 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 539 ms. (steps per millisecond=18 ) properties (out of 31) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2408 rows 2688 cols
[2022-05-20 06:46:04] [INFO ] Computed 441 place invariants in 15 ms
[2022-05-20 06:46:05] [INFO ] [Real]Absence check using 441 positive place invariants in 145 ms returned sat
[2022-05-20 06:46:05] [INFO ] After 948ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:11
[2022-05-20 06:46:06] [INFO ] [Nat]Absence check using 441 positive place invariants in 156 ms returned sat
[2022-05-20 06:46:08] [INFO ] After 2010ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2022-05-20 06:46:09] [INFO ] Deduced a trap composed of 20 places in 608 ms of which 9 ms to minimize.
[2022-05-20 06:46:10] [INFO ] Deduced a trap composed of 29 places in 631 ms of which 3 ms to minimize.
[2022-05-20 06:46:10] [INFO ] Deduced a trap composed of 20 places in 561 ms of which 4 ms to minimize.
[2022-05-20 06:46:11] [INFO ] Deduced a trap composed of 25 places in 560 ms of which 4 ms to minimize.
[2022-05-20 06:46:11] [INFO ] Deduced a trap composed of 24 places in 512 ms of which 5 ms to minimize.
[2022-05-20 06:46:12] [INFO ] Deduced a trap composed of 32 places in 548 ms of which 1 ms to minimize.
[2022-05-20 06:46:13] [INFO ] Deduced a trap composed of 29 places in 515 ms of which 3 ms to minimize.
[2022-05-20 06:46:13] [INFO ] Deduced a trap composed of 24 places in 503 ms of which 1 ms to minimize.
[2022-05-20 06:46:14] [INFO ] Deduced a trap composed of 23 places in 481 ms of which 2 ms to minimize.
[2022-05-20 06:46:14] [INFO ] Deduced a trap composed of 30 places in 486 ms of which 1 ms to minimize.
[2022-05-20 06:46:15] [INFO ] Deduced a trap composed of 20 places in 476 ms of which 2 ms to minimize.
[2022-05-20 06:46:16] [INFO ] Deduced a trap composed of 23 places in 497 ms of which 1 ms to minimize.
[2022-05-20 06:46:16] [INFO ] Deduced a trap composed of 16 places in 487 ms of which 2 ms to minimize.
[2022-05-20 06:46:17] [INFO ] Deduced a trap composed of 34 places in 476 ms of which 1 ms to minimize.
[2022-05-20 06:46:17] [INFO ] Deduced a trap composed of 19 places in 473 ms of which 1 ms to minimize.
[2022-05-20 06:46:18] [INFO ] Deduced a trap composed of 17 places in 475 ms of which 1 ms to minimize.
[2022-05-20 06:46:18] [INFO ] Deduced a trap composed of 18 places in 474 ms of which 2 ms to minimize.
[2022-05-20 06:46:19] [INFO ] Deduced a trap composed of 16 places in 444 ms of which 1 ms to minimize.
[2022-05-20 06:46:19] [INFO ] Deduced a trap composed of 32 places in 429 ms of which 2 ms to minimize.
[2022-05-20 06:46:20] [INFO ] Deduced a trap composed of 27 places in 432 ms of which 1 ms to minimize.
[2022-05-20 06:46:20] [INFO ] Deduced a trap composed of 27 places in 432 ms of which 1 ms to minimize.
[2022-05-20 06:46:21] [INFO ] Deduced a trap composed of 27 places in 388 ms of which 2 ms to minimize.
[2022-05-20 06:46:21] [INFO ] Deduced a trap composed of 28 places in 412 ms of which 1 ms to minimize.
[2022-05-20 06:46:22] [INFO ] Deduced a trap composed of 33 places in 396 ms of which 1 ms to minimize.
[2022-05-20 06:46:22] [INFO ] Deduced a trap composed of 22 places in 398 ms of which 1 ms to minimize.
[2022-05-20 06:46:23] [INFO ] Deduced a trap composed of 39 places in 405 ms of which 1 ms to minimize.
[2022-05-20 06:46:23] [INFO ] Deduced a trap composed of 39 places in 380 ms of which 1 ms to minimize.
[2022-05-20 06:46:24] [INFO ] Deduced a trap composed of 48 places in 378 ms of which 1 ms to minimize.
[2022-05-20 06:46:24] [INFO ] Deduced a trap composed of 41 places in 374 ms of which 1 ms to minimize.
[2022-05-20 06:46:25] [INFO ] Deduced a trap composed of 45 places in 362 ms of which 1 ms to minimize.
[2022-05-20 06:46:25] [INFO ] Deduced a trap composed of 43 places in 342 ms of which 1 ms to minimize.
[2022-05-20 06:46:26] [INFO ] Deduced a trap composed of 42 places in 341 ms of which 1 ms to minimize.
[2022-05-20 06:46:26] [INFO ] Deduced a trap composed of 41 places in 360 ms of which 1 ms to minimize.
[2022-05-20 06:46:26] [INFO ] Deduced a trap composed of 47 places in 341 ms of which 5 ms to minimize.
[2022-05-20 06:46:27] [INFO ] Deduced a trap composed of 49 places in 336 ms of which 1 ms to minimize.
[2022-05-20 06:46:27] [INFO ] Deduced a trap composed of 42 places in 337 ms of which 1 ms to minimize.
[2022-05-20 06:46:28] [INFO ] Deduced a trap composed of 36 places in 343 ms of which 0 ms to minimize.
[2022-05-20 06:46:28] [INFO ] Deduced a trap composed of 32 places in 328 ms of which 1 ms to minimize.
[2022-05-20 06:46:29] [INFO ] Deduced a trap composed of 44 places in 327 ms of which 1 ms to minimize.
[2022-05-20 06:46:29] [INFO ] Deduced a trap composed of 32 places in 326 ms of which 1 ms to minimize.
[2022-05-20 06:46:29] [INFO ] Deduced a trap composed of 30 places in 315 ms of which 1 ms to minimize.
[2022-05-20 06:46:30] [INFO ] Deduced a trap composed of 36 places in 312 ms of which 1 ms to minimize.
[2022-05-20 06:46:30] [INFO ] Deduced a trap composed of 41 places in 295 ms of which 1 ms to minimize.
[2022-05-20 06:46:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 06:46:30] [INFO ] After 25268ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:11
Fused 12 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 951 ms.
Support contains 14 out of 2688 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2688/2688 places, 2408/2408 transitions.
Drop transitions removed 553 transitions
Trivial Post-agglo rules discarded 553 transitions
Performed 553 trivial Post agglomeration. Transition count delta: 553
Iterating post reduction 0 with 553 rules applied. Total rules applied 553 place count 2688 transition count 1855
Reduce places removed 553 places and 0 transitions.
Iterating post reduction 1 with 553 rules applied. Total rules applied 1106 place count 2135 transition count 1855
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 315 Pre rules applied. Total rules applied 1106 place count 2135 transition count 1540
Deduced a syphon composed of 315 places in 3 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 2 with 630 rules applied. Total rules applied 1736 place count 1820 transition count 1540
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1738 place count 1818 transition count 1538
Iterating global reduction 2 with 2 rules applied. Total rules applied 1740 place count 1818 transition count 1538
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1740 place count 1818 transition count 1537
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1742 place count 1817 transition count 1537
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 2 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 2 with 1358 rules applied. Total rules applied 3100 place count 1138 transition count 858
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3101 place count 1138 transition count 857
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3103 place count 1137 transition count 856
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3305 place count 1036 transition count 856
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 3335 place count 1021 transition count 856
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3336 place count 1021 transition count 855
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3337 place count 1020 transition count 855
Partial Free-agglomeration rule applied 118 times.
Drop transitions removed 118 transitions
Iterating global reduction 4 with 118 rules applied. Total rules applied 3455 place count 1020 transition count 855
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3456 place count 1019 transition count 854
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3457 place count 1018 transition count 854
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3457 place count 1018 transition count 852
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3461 place count 1016 transition count 852
Applied a total of 3461 rules in 745 ms. Remains 1016 /2688 variables (removed 1672) and now considering 852/2408 (removed 1556) transitions.
Finished structural reductions, in 1 iterations. Remains : 1016/2688 places, 852/2408 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 517 ms. (steps per millisecond=19 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 95429 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95429 steps, saw 80021 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 852 rows 1016 cols
[2022-05-20 06:46:36] [INFO ] Computed 440 place invariants in 2 ms
[2022-05-20 06:46:36] [INFO ] [Real]Absence check using 440 positive place invariants in 61 ms returned sat
[2022-05-20 06:46:36] [INFO ] After 351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-20 06:46:37] [INFO ] [Nat]Absence check using 440 positive place invariants in 59 ms returned sat
[2022-05-20 06:46:38] [INFO ] After 669ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-20 06:46:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 06:46:38] [INFO ] After 388ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-05-20 06:46:39] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 0 ms to minimize.
[2022-05-20 06:46:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2022-05-20 06:46:39] [INFO ] After 1155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 372 ms.
[2022-05-20 06:46:39] [INFO ] After 2687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 71 ms.
Support contains 11 out of 1016 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1016/1016 places, 852/852 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 1016 transition count 850
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1014 transition count 850
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 1013 transition count 850
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 1013 transition count 850
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1012 transition count 849
Applied a total of 8 rules in 105 ms. Remains 1012 /1016 variables (removed 4) and now considering 849/852 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 1012/1016 places, 849/852 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 849 rows 1012 cols
[2022-05-20 06:46:40] [INFO ] Computed 440 place invariants in 6 ms
[2022-05-20 06:46:40] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 06:46:41] [INFO ] [Nat]Absence check using 440 positive place invariants in 63 ms returned sat
[2022-05-20 06:46:41] [INFO ] After 574ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 06:46:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 06:46:42] [INFO ] After 273ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-20 06:46:42] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2022-05-20 06:46:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2022-05-20 06:46:42] [INFO ] After 863ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 277 ms.
[2022-05-20 06:46:42] [INFO ] After 2121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 86 ms.
Support contains 10 out of 1012 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1012/1012 places, 849/849 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1012 transition count 848
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1011 transition count 848
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1010 transition count 848
Applied a total of 4 rules in 42 ms. Remains 1010 /1012 variables (removed 2) and now considering 848/849 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1012 places, 848/849 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 82499 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82499 steps, saw 68898 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 848 rows 1010 cols
[2022-05-20 06:46:46] [INFO ] Computed 440 place invariants in 7 ms
[2022-05-20 06:46:47] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 06:46:47] [INFO ] [Nat]Absence check using 440 positive place invariants in 58 ms returned sat
[2022-05-20 06:46:48] [INFO ] After 538ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 06:46:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 06:46:48] [INFO ] After 282ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-20 06:46:48] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2022-05-20 06:46:48] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 0 ms to minimize.
[2022-05-20 06:46:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
[2022-05-20 06:46:49] [INFO ] After 938ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 271 ms.
[2022-05-20 06:46:49] [INFO ] After 2154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 88 ms.
Support contains 10 out of 1010 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1010/1010 places, 848/848 transitions.
Applied a total of 0 rules in 27 ms. Remains 1010 /1010 variables (removed 0) and now considering 848/848 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1010 places, 848/848 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1010/1010 places, 848/848 transitions.
Applied a total of 0 rules in 20 ms. Remains 1010 /1010 variables (removed 0) and now considering 848/848 (removed 0) transitions.
// Phase 1: matrix 848 rows 1010 cols
[2022-05-20 06:46:49] [INFO ] Computed 440 place invariants in 1 ms
[2022-05-20 06:46:50] [INFO ] Implicit Places using invariants in 571 ms returned [993, 997]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 572 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1008/1010 places, 848/848 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1006 transition count 846
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1006 transition count 846
Applied a total of 4 rules in 33 ms. Remains 1006 /1008 variables (removed 2) and now considering 846/848 (removed 2) transitions.
// Phase 1: matrix 846 rows 1006 cols
[2022-05-20 06:46:50] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:46:50] [INFO ] Implicit Places using invariants in 483 ms returned []
// Phase 1: matrix 846 rows 1006 cols
[2022-05-20 06:46:50] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:46:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 06:46:51] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1006/1010 places, 846/848 transitions.
Finished structural reductions, in 2 iterations. Remains : 1006/1010 places, 846/848 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 846 rows 1006 cols
[2022-05-20 06:46:52] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:46:52] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 06:46:52] [INFO ] [Nat]Absence check using 438 positive place invariants in 60 ms returned sat
[2022-05-20 06:46:53] [INFO ] After 504ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 06:46:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 06:46:53] [INFO ] After 200ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-20 06:46:53] [INFO ] After 555ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 212 ms.
[2022-05-20 06:46:54] [INFO ] After 1619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 49 ms.
Support contains 9 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1006/1006 places, 846/846 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1006 transition count 845
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1005 transition count 845
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1005 transition count 844
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 1004 transition count 844
Applied a total of 4 rules in 58 ms. Remains 1004 /1006 variables (removed 2) and now considering 844/846 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1004/1006 places, 844/846 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 99760 steps, run timeout after 3011 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99760 steps, saw 83330 distinct states, run finished after 3011 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 844 rows 1004 cols
[2022-05-20 06:46:57] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:46:58] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 06:46:58] [INFO ] [Nat]Absence check using 438 positive place invariants in 61 ms returned sat
[2022-05-20 06:46:58] [INFO ] After 500ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 06:46:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 06:46:59] [INFO ] After 216ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-20 06:46:59] [INFO ] After 586ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 194 ms.
[2022-05-20 06:46:59] [INFO ] After 1631ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 54 ms.
Support contains 9 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1004/1004 places, 844/844 transitions.
Applied a total of 0 rules in 20 ms. Remains 1004 /1004 variables (removed 0) and now considering 844/844 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1004/1004 places, 844/844 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1004/1004 places, 844/844 transitions.
Applied a total of 0 rules in 18 ms. Remains 1004 /1004 variables (removed 0) and now considering 844/844 (removed 0) transitions.
// Phase 1: matrix 844 rows 1004 cols
[2022-05-20 06:46:59] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:47:00] [INFO ] Implicit Places using invariants in 467 ms returned []
// Phase 1: matrix 844 rows 1004 cols
[2022-05-20 06:47:00] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:47:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 06:47:01] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1512 ms to find 0 implicit places.
[2022-05-20 06:47:01] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 844 rows 1004 cols
[2022-05-20 06:47:01] [INFO ] Computed 438 place invariants in 5 ms
[2022-05-20 06:47:01] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1004/1004 places, 844/844 transitions.
Partial Free-agglomeration rule applied 231 times.
Drop transitions removed 231 transitions
Iterating global reduction 0 with 231 rules applied. Total rules applied 231 place count 1004 transition count 844
Applied a total of 231 rules in 40 ms. Remains 1004 /1004 variables (removed 0) and now considering 844/844 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 844 rows 1004 cols
[2022-05-20 06:47:01] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:47:02] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 06:47:02] [INFO ] [Nat]Absence check using 438 positive place invariants in 59 ms returned sat
[2022-05-20 06:47:02] [INFO ] After 496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 06:47:02] [INFO ] State equation strengthened by 226 read => feed constraints.
[2022-05-20 06:47:03] [INFO ] After 378ms SMT Verify possible using 226 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-20 06:47:03] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 1 ms to minimize.
[2022-05-20 06:47:03] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 0 ms to minimize.
[2022-05-20 06:47:03] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 1 ms to minimize.
[2022-05-20 06:47:04] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 5 ms to minimize.
[2022-05-20 06:47:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 854 ms
[2022-05-20 06:47:04] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 0 ms to minimize.
[2022-05-20 06:47:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2022-05-20 06:47:04] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2022-05-20 06:47:04] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 0 ms to minimize.
[2022-05-20 06:47:05] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 0 ms to minimize.
[2022-05-20 06:47:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 600 ms
[2022-05-20 06:47:05] [INFO ] After 2378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 244 ms.
[2022-05-20 06:47:05] [INFO ] After 3441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2022-05-20 06:47:05] [INFO ] Flatten gal took : 42 ms
[2022-05-20 06:47:05] [INFO ] Flatten gal took : 38 ms
[2022-05-20 06:47:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9057801686814738306.gal : 23 ms
[2022-05-20 06:47:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8053880954333855294.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16476125883367956085;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9057801686814738306.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8053880954333855294.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality8053880954333855294.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :6 after 36
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :36 after 70
Reachability property AtomicPropp7 is true.
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :70 after 133
Reachability property AtomicPropp9 is true.
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :133 after 159
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :159 after 222
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :222 after 506
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :506 after 11235
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :11235 after 75394
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :75394 after 2.25313e+06
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2.25313e+06 after 4.66876e+07
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :4.66876e+07 after 6.63063e+08
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :6.63063e+08 after 6.29876e+11
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :6.29876e+11 after 5.92348e+12
Reachability property AtomicPropp17 is true.
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :5.92348e+12 after 2.43616e+16
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :2.43616e+16 after 2.74951e+19
Reachability property AtomicPropp14 is true.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.74951e+19 after 1.11185e+24
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.11185e+24 after 1.49532e+26
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :1.49532e+26 after 2.41681e+30
Detected timeout of ITS tools.
[2022-05-20 06:47:20] [INFO ] Flatten gal took : 37 ms
[2022-05-20 06:47:20] [INFO ] Applying decomposition
[2022-05-20 06:47:20] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7459613666739186575.txt' '-o' '/tmp/graph7459613666739186575.bin' '-w' '/tmp/graph7459613666739186575.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7459613666739186575.bin' '-l' '-1' '-v' '-w' '/tmp/graph7459613666739186575.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:47:20] [INFO ] Decomposing Gal with order
[2022-05-20 06:47:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:47:21] [INFO ] Removed a total of 195 redundant transitions.
[2022-05-20 06:47:21] [INFO ] Flatten gal took : 90 ms
[2022-05-20 06:47:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 14 ms.
[2022-05-20 06:47:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9317229243625190262.gal : 10 ms
[2022-05-20 06:47:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11960356597296568881.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16476125883367956085;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9317229243625190262.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11960356597296568881.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality11960356597296568881.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :6720 after 4.6521e+06
Reachability property AtomicPropp29 is true.
Reachability property AtomicPropp6 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.46207e+64,14.8768,429964,11464,358,766982,1864,1098,2.13166e+06,163,31407,0
Total reachable state count : 1.462074784110253620997234698179137573675e+64

Verifying 2 reachability properties.
Reachability property AtomicPropp6 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp6,2.41242e+62,14.9569,429964,9140,317,766982,1864,1103,2.13166e+06,166,31407,0
Reachability property AtomicPropp29 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp29,2.24279e+58,14.9605,429964,1253,203,766982,1864,1111,2.13166e+06,170,31407,0
FORMULA ShieldPPPt-PT-040B-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 640 stabilizing places and 640 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((true U p0))'
Support contains 1 out of 2688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2688/2688 places, 2408/2408 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 563 transitions
Trivial Post-agglo rules discarded 563 transitions
Performed 563 trivial Post agglomeration. Transition count delta: 563
Iterating post reduction 0 with 563 rules applied. Total rules applied 563 place count 2687 transition count 1844
Reduce places removed 563 places and 0 transitions.
Iterating post reduction 1 with 563 rules applied. Total rules applied 1126 place count 2124 transition count 1844
Performed 317 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 317 Pre rules applied. Total rules applied 1126 place count 2124 transition count 1527
Deduced a syphon composed of 317 places in 2 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 2 with 634 rules applied. Total rules applied 1760 place count 1807 transition count 1527
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1764 place count 1803 transition count 1523
Iterating global reduction 2 with 4 rules applied. Total rules applied 1768 place count 1803 transition count 1523
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1768 place count 1803 transition count 1521
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1772 place count 1801 transition count 1521
Performed 677 Post agglomeration using F-continuation condition.Transition count delta: 677
Deduced a syphon composed of 677 places in 0 ms
Reduce places removed 677 places and 0 transitions.
Iterating global reduction 2 with 1354 rules applied. Total rules applied 3126 place count 1124 transition count 844
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3127 place count 1124 transition count 843
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3129 place count 1123 transition count 842
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3331 place count 1022 transition count 842
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3367 place count 1004 transition count 842
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3369 place count 1002 transition count 840
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3370 place count 1001 transition count 840
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3370 place count 1001 transition count 838
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3374 place count 999 transition count 838
Applied a total of 3374 rules in 574 ms. Remains 999 /2688 variables (removed 1689) and now considering 838/2408 (removed 1570) transitions.
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:47:37] [INFO ] Computed 440 place invariants in 11 ms
[2022-05-20 06:47:37] [INFO ] Implicit Places using invariants in 533 ms returned [982, 986]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 535 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 997/2688 places, 838/2408 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 995 transition count 836
Applied a total of 4 rules in 55 ms. Remains 995 /997 variables (removed 2) and now considering 836/838 (removed 2) transitions.
// Phase 1: matrix 836 rows 995 cols
[2022-05-20 06:47:37] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:47:38] [INFO ] Implicit Places using invariants in 466 ms returned []
// Phase 1: matrix 836 rows 995 cols
[2022-05-20 06:47:38] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:47:38] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-05-20 06:47:39] [INFO ] Implicit Places using invariants and state equation in 1125 ms returned []
Implicit Place search using SMT with State Equation took 1597 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 995/2688 places, 836/2408 transitions.
Finished structural reductions, in 2 iterations. Remains : 995/2688 places, 836/2408 transitions.
Stuttering acceptance computed with spot in 419 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 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 19491 reset in 866 ms.
Stack based approach found an accepted trace after 136 steps with 28 reset with depth 5 and stack size 5 in 2 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-00 finished in 4120 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(p0 U p1)||p2)))'
Support contains 4 out of 2688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2688/2688 places, 2408/2408 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2687 transition count 1848
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 2128 transition count 1848
Performed 318 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 318 Pre rules applied. Total rules applied 1118 place count 2128 transition count 1530
Deduced a syphon composed of 318 places in 2 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 2 with 636 rules applied. Total rules applied 1754 place count 1810 transition count 1530
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1758 place count 1806 transition count 1526
Iterating global reduction 2 with 4 rules applied. Total rules applied 1762 place count 1806 transition count 1526
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1762 place count 1806 transition count 1524
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1766 place count 1804 transition count 1524
Performed 678 Post agglomeration using F-continuation condition.Transition count delta: 678
Deduced a syphon composed of 678 places in 0 ms
Reduce places removed 678 places and 0 transitions.
Iterating global reduction 2 with 1356 rules applied. Total rules applied 3122 place count 1126 transition count 846
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3123 place count 1126 transition count 845
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3125 place count 1125 transition count 844
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3327 place count 1024 transition count 844
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3361 place count 1007 transition count 844
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3363 place count 1005 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3364 place count 1004 transition count 842
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3364 place count 1004 transition count 840
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3368 place count 1002 transition count 840
Applied a total of 3368 rules in 422 ms. Remains 1002 /2688 variables (removed 1686) and now considering 840/2408 (removed 1568) transitions.
// Phase 1: matrix 840 rows 1002 cols
[2022-05-20 06:47:40] [INFO ] Computed 440 place invariants in 1 ms
[2022-05-20 06:47:41] [INFO ] Implicit Places using invariants in 575 ms returned [985, 989]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 578 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/2688 places, 840/2408 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 998 transition count 838
Applied a total of 4 rules in 33 ms. Remains 998 /1000 variables (removed 2) and now considering 838/840 (removed 2) transitions.
// Phase 1: matrix 838 rows 998 cols
[2022-05-20 06:47:41] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:47:42] [INFO ] Implicit Places using invariants in 501 ms returned []
// Phase 1: matrix 838 rows 998 cols
[2022-05-20 06:47:42] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:47:43] [INFO ] Implicit Places using invariants and state equation in 980 ms returned []
Implicit Place search using SMT with State Equation took 1486 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 998/2688 places, 838/2408 transitions.
Finished structural reductions, in 2 iterations. Remains : 998/2688 places, 838/2408 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, p1, (AND p1 (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(OR p2 (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(AND (EQ s621 1) (EQ s637 1)), p0:(EQ s777 1), p2:(EQ s215 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 669 ms.
Product exploration explored 100000 steps with 0 reset in 915 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (OR p2 (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p2 (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 471 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 91 ms :[true, p1, (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 838 rows 998 cols
[2022-05-20 06:47:45] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:47:46] [INFO ] [Real]Absence check using 438 positive place invariants in 61 ms returned sat
[2022-05-20 06:47:46] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 06:47:46] [INFO ] [Nat]Absence check using 438 positive place invariants in 58 ms returned sat
[2022-05-20 06:47:46] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 06:47:47] [INFO ] After 656ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 145 ms.
[2022-05-20 06:47:47] [INFO ] After 1062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 72 ms.
Support contains 4 out of 998 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 998/998 places, 838/838 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 998 transition count 837
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 997 transition count 837
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 997 transition count 837
Applied a total of 3 rules in 52 ms. Remains 997 /998 variables (removed 1) and now considering 837/838 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 997/998 places, 837/838 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 121022 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121022 steps, saw 89528 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 837 rows 997 cols
[2022-05-20 06:47:50] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:47:50] [INFO ] [Real]Absence check using 438 positive place invariants in 61 ms returned sat
[2022-05-20 06:47:50] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 06:47:51] [INFO ] [Nat]Absence check using 438 positive place invariants in 57 ms returned sat
[2022-05-20 06:47:51] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 06:47:51] [INFO ] After 641ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 131 ms.
[2022-05-20 06:47:52] [INFO ] After 1027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 1 properties in 74 ms.
Support contains 4 out of 997 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 997/997 places, 837/837 transitions.
Applied a total of 0 rules in 17 ms. Remains 997 /997 variables (removed 0) and now considering 837/837 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 997/997 places, 837/837 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 997/997 places, 837/837 transitions.
Applied a total of 0 rules in 17 ms. Remains 997 /997 variables (removed 0) and now considering 837/837 (removed 0) transitions.
// Phase 1: matrix 837 rows 997 cols
[2022-05-20 06:47:52] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:47:52] [INFO ] Implicit Places using invariants in 464 ms returned []
// Phase 1: matrix 837 rows 997 cols
[2022-05-20 06:47:52] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:47:53] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1401 ms to find 0 implicit places.
[2022-05-20 06:47:53] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 837 rows 997 cols
[2022-05-20 06:47:53] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:47:53] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 997/997 places, 837/837 transitions.
Partial Free-agglomeration rule applied 235 times.
Drop transitions removed 235 transitions
Iterating global reduction 0 with 235 rules applied. Total rules applied 235 place count 997 transition count 837
Applied a total of 235 rules in 38 ms. Remains 997 /997 variables (removed 0) and now considering 837/837 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 837 rows 997 cols
[2022-05-20 06:47:53] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:47:54] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 06:47:54] [INFO ] [Nat]Absence check using 438 positive place invariants in 53 ms returned sat
[2022-05-20 06:47:54] [INFO ] After 358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 06:47:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 06:47:54] [INFO ] After 106ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 06:47:55] [INFO ] After 271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 105 ms.
[2022-05-20 06:47:55] [INFO ] After 967ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-20 06:47:55] [INFO ] Flatten gal took : 27 ms
[2022-05-20 06:47:55] [INFO ] Flatten gal took : 25 ms
[2022-05-20 06:47:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2059070405021906787.gal : 20 ms
[2022-05-20 06:47:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10546194026931938659.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17571419131766679652;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2059070405021906787.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10546194026931938659.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality10546194026931938659.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :2 after 12
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :12 after 30
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :30 after 62
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :62 after 95
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :95 after 191
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :191 after 5195
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :5195 after 85596
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :85596 after 3.71066e+06
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :3.71066e+06 after 1.23191e+14
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.23191e+14 after 4.57179e+29
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :4.57179e+29 after 8.16387e+60
Reachability property apf5 is true.
Detected timeout of ITS tools.
[2022-05-20 06:48:10] [INFO ] Flatten gal took : 25 ms
[2022-05-20 06:48:10] [INFO ] Applying decomposition
[2022-05-20 06:48:10] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14192825053772957931.txt' '-o' '/tmp/graph14192825053772957931.bin' '-w' '/tmp/graph14192825053772957931.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14192825053772957931.bin' '-l' '-1' '-v' '-w' '/tmp/graph14192825053772957931.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:48:10] [INFO ] Decomposing Gal with order
[2022-05-20 06:48:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:48:10] [INFO ] Removed a total of 119 redundant transitions.
[2022-05-20 06:48:10] [INFO ] Flatten gal took : 46 ms
[2022-05-20 06:48:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 6 ms.
[2022-05-20 06:48:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12339173821333303205.gal : 7 ms
[2022-05-20 06:48:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4371199461789030938.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms17571419131766679652;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12339173821333303205.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4371199461789030938.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality4371199461789030938.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 2
Reachability property apf4 is true.
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :622592 after 1.30409e+83
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3592362532593803624
[2022-05-20 06:48:25] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3592362532593803624
Running compilation step : cd /tmp/ltsmin3592362532593803624;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1529 ms.
Running link step : cd /tmp/ltsmin3592362532593803624;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3592362532593803624;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf3==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (OR p2 (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p2 (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 14 factoid took 496 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 66 ms :[true, p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 81 ms :[true, p1, (AND p1 (NOT p2))]
Support contains 4 out of 998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 998/998 places, 838/838 transitions.
Applied a total of 0 rules in 25 ms. Remains 998 /998 variables (removed 0) and now considering 838/838 (removed 0) transitions.
// Phase 1: matrix 838 rows 998 cols
[2022-05-20 06:48:41] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:48:41] [INFO ] Implicit Places using invariants in 563 ms returned []
// Phase 1: matrix 838 rows 998 cols
[2022-05-20 06:48:41] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:48:42] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1468 ms to find 0 implicit places.
[2022-05-20 06:48:42] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 838 rows 998 cols
[2022-05-20 06:48:42] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:48:43] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 838/838 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) (NOT p1))), (X (OR (AND (NOT p0) (NOT p1)) p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (AND (NOT p0) (NOT p1)) p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 447 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 72 ms :[true, p1, (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 838 rows 998 cols
[2022-05-20 06:48:44] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:48:44] [INFO ] [Real]Absence check using 438 positive place invariants in 58 ms returned sat
[2022-05-20 06:48:44] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 06:48:44] [INFO ] [Nat]Absence check using 438 positive place invariants in 60 ms returned sat
[2022-05-20 06:48:45] [INFO ] After 402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 06:48:45] [INFO ] After 614ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 129 ms.
[2022-05-20 06:48:45] [INFO ] After 1012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 56 ms.
Support contains 4 out of 998 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 998/998 places, 838/838 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 998 transition count 837
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 997 transition count 837
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 997 transition count 837
Applied a total of 3 rules in 57 ms. Remains 997 /998 variables (removed 1) and now considering 837/838 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 997/998 places, 837/838 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 119806 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119806 steps, saw 88625 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 837 rows 997 cols
[2022-05-20 06:48:49] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:48:49] [INFO ] [Real]Absence check using 438 positive place invariants in 61 ms returned sat
[2022-05-20 06:48:49] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 06:48:49] [INFO ] [Nat]Absence check using 438 positive place invariants in 62 ms returned sat
[2022-05-20 06:48:49] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 06:48:50] [INFO ] After 645ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 138 ms.
[2022-05-20 06:48:50] [INFO ] After 1047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 1 properties in 86 ms.
Support contains 4 out of 997 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 997/997 places, 837/837 transitions.
Applied a total of 0 rules in 16 ms. Remains 997 /997 variables (removed 0) and now considering 837/837 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 997/997 places, 837/837 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 997/997 places, 837/837 transitions.
Applied a total of 0 rules in 16 ms. Remains 997 /997 variables (removed 0) and now considering 837/837 (removed 0) transitions.
// Phase 1: matrix 837 rows 997 cols
[2022-05-20 06:48:50] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:48:50] [INFO ] Implicit Places using invariants in 456 ms returned []
// Phase 1: matrix 837 rows 997 cols
[2022-05-20 06:48:50] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:48:51] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1369 ms to find 0 implicit places.
[2022-05-20 06:48:51] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 837 rows 997 cols
[2022-05-20 06:48:51] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:48:52] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 997/997 places, 837/837 transitions.
Partial Free-agglomeration rule applied 235 times.
Drop transitions removed 235 transitions
Iterating global reduction 0 with 235 rules applied. Total rules applied 235 place count 997 transition count 837
Applied a total of 235 rules in 52 ms. Remains 997 /997 variables (removed 0) and now considering 837/837 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 837 rows 997 cols
[2022-05-20 06:48:52] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:48:52] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 06:48:52] [INFO ] [Nat]Absence check using 438 positive place invariants in 60 ms returned sat
[2022-05-20 06:48:53] [INFO ] After 378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 06:48:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 06:48:53] [INFO ] After 97ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 06:48:53] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 100 ms.
[2022-05-20 06:48:53] [INFO ] After 979ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-20 06:48:53] [INFO ] Flatten gal took : 25 ms
[2022-05-20 06:48:53] [INFO ] Flatten gal took : 25 ms
[2022-05-20 06:48:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18147576267042590629.gal : 3 ms
[2022-05-20 06:48:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2832862719337741782.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms5968010675195034866;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18147576267042590629.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2832862719337741782.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality2832862719337741782.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :2 after 12
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :12 after 30
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :30 after 62
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :62 after 95
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :95 after 191
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :191 after 5195
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :5195 after 85596
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :85596 after 3.71066e+06
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :3.71066e+06 after 1.23191e+14
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.23191e+14 after 4.57179e+29
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :4.57179e+29 after 8.16387e+60
Reachability property apf5 is true.
Reachability property apf3 is true.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8.16387e+60 after 8.80646e+102
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4.09676e+143,1.43714,42992,2,3483,19,162433,7,0,4833,214420,0
Total reachable state count : 4.096759537848523218260610886393254382868e+143

Verifying 3 reachability properties.
Reachability property apf3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf3,1.04858e+32,1.44042,42992,2,1283,19,162433,8,0,4840,214420,0
Reachability property apf4 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf4,1.04858e+32,1.44186,42992,2,1283,19,162433,8,0,4842,214420,0
Reachability property apf5 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf5,1.04858e+32,1.44296,42992,2,1283,19,162433,9,0,4845,214420,0
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) (NOT p1))), (X (OR (AND (NOT p0) (NOT p1)) p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (AND (NOT p0) (NOT p1)) p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 14 factoid took 521 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 70 ms :[true, p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 79 ms :[true, p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 77 ms :[true, p1, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 635 ms.
Product exploration explored 100000 steps with 0 reset in 807 ms.
Built C files in :
/tmp/ltsmin505455737680503977
[2022-05-20 06:48:57] [INFO ] Computing symmetric may disable matrix : 838 transitions.
[2022-05-20 06:48:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 06:48:57] [INFO ] Computing symmetric may enable matrix : 838 transitions.
[2022-05-20 06:48:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 06:48:57] [INFO ] Computing Do-Not-Accords matrix : 838 transitions.
[2022-05-20 06:48:57] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 06:48:57] [INFO ] Built C files in 119ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin505455737680503977
Running compilation step : cd /tmp/ltsmin505455737680503977;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2234 ms.
Running link step : cd /tmp/ltsmin505455737680503977;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin505455737680503977;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15278170417866081085.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 998/998 places, 838/838 transitions.
Applied a total of 0 rules in 23 ms. Remains 998 /998 variables (removed 0) and now considering 838/838 (removed 0) transitions.
// Phase 1: matrix 838 rows 998 cols
[2022-05-20 06:49:12] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:49:12] [INFO ] Implicit Places using invariants in 460 ms returned []
// Phase 1: matrix 838 rows 998 cols
[2022-05-20 06:49:12] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:49:13] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1361 ms to find 0 implicit places.
[2022-05-20 06:49:13] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 838 rows 998 cols
[2022-05-20 06:49:13] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:49:14] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 838/838 transitions.
Built C files in :
/tmp/ltsmin12054351451517906028
[2022-05-20 06:49:14] [INFO ] Computing symmetric may disable matrix : 838 transitions.
[2022-05-20 06:49:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 06:49:14] [INFO ] Computing symmetric may enable matrix : 838 transitions.
[2022-05-20 06:49:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 06:49:14] [INFO ] Computing Do-Not-Accords matrix : 838 transitions.
[2022-05-20 06:49:14] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 06:49:14] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12054351451517906028
Running compilation step : cd /tmp/ltsmin12054351451517906028;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2161 ms.
Running link step : cd /tmp/ltsmin12054351451517906028;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin12054351451517906028;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16478104919540830623.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 06:49:29] [INFO ] Flatten gal took : 21 ms
[2022-05-20 06:49:29] [INFO ] Flatten gal took : 21 ms
[2022-05-20 06:49:29] [INFO ] Time to serialize gal into /tmp/LTL13636301988077841379.gal : 5 ms
[2022-05-20 06:49:29] [INFO ] Time to serialize properties into /tmp/LTL3706941457713247449.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13636301988077841379.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3706941457713247449.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1363630...267
Read 1 LTL properties
Checking formula 0 : !((G((!(("(p2409==1)")U("((p1927==1)&&(p1986==1))")))||("(p685==0)"))))
Formula 0 simplified : !G("(p685==0)" | !("(p2409==1)" U "((p1927==1)&&(p1986==1))"))
Detected timeout of ITS tools.
[2022-05-20 06:49:44] [INFO ] Flatten gal took : 36 ms
[2022-05-20 06:49:44] [INFO ] Applying decomposition
[2022-05-20 06:49:44] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1651601759644247962.txt' '-o' '/tmp/graph1651601759644247962.bin' '-w' '/tmp/graph1651601759644247962.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1651601759644247962.bin' '-l' '-1' '-v' '-w' '/tmp/graph1651601759644247962.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:49:44] [INFO ] Decomposing Gal with order
[2022-05-20 06:49:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:49:44] [INFO ] Removed a total of 246 redundant transitions.
[2022-05-20 06:49:44] [INFO ] Flatten gal took : 45 ms
[2022-05-20 06:49:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 234 labels/synchronizations in 5 ms.
[2022-05-20 06:49:44] [INFO ] Time to serialize gal into /tmp/LTL15666294638320339694.gal : 6 ms
[2022-05-20 06:49:44] [INFO ] Time to serialize properties into /tmp/LTL2561466869508865815.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15666294638320339694.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2561466869508865815.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1566629...246
Read 1 LTL properties
Checking formula 0 : !((G((!(("(i30.u250.p2409==1)")U("((i24.u202.p1927==1)&&(i25.u207.p1986==1))")))||("(i8.u71.p685==0)"))))
Formula 0 simplified : !G("(i8.u71.p685==0)" | !("(i30.u250.p2409==1)" U "((i24.u202.p1927==1)&&(i25.u207.p1986==1))"))
Reverse transition relation is NOT exact ! Due to transitions i25.t765, i26.t78, Intersection with reachable at each step enabled. (destroyed/reverse/inte...180
Computing Next relation with stutter on 6.79862e+65 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15150404210311813764
[2022-05-20 06:49:59] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15150404210311813764
Running compilation step : cd /tmp/ltsmin15150404210311813764;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1412 ms.
Running link step : cd /tmp/ltsmin15150404210311813764;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15150404210311813764;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((!((LTLAPp0==true) U (LTLAPp1==true))||(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-040B-LTLFireability-01 finished in 154203 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(X(p0))||F(G(p1))||p2))||p3)))'
Support contains 4 out of 2688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2688/2688 places, 2408/2408 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 562 transitions
Trivial Post-agglo rules discarded 562 transitions
Performed 562 trivial Post agglomeration. Transition count delta: 562
Iterating post reduction 0 with 562 rules applied. Total rules applied 562 place count 2687 transition count 1845
Reduce places removed 562 places and 0 transitions.
Iterating post reduction 1 with 562 rules applied. Total rules applied 1124 place count 2125 transition count 1845
Performed 316 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 316 Pre rules applied. Total rules applied 1124 place count 2125 transition count 1529
Deduced a syphon composed of 316 places in 2 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 2 with 632 rules applied. Total rules applied 1756 place count 1809 transition count 1529
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1760 place count 1805 transition count 1525
Iterating global reduction 2 with 4 rules applied. Total rules applied 1764 place count 1805 transition count 1525
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1764 place count 1805 transition count 1523
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1768 place count 1803 transition count 1523
Performed 676 Post agglomeration using F-continuation condition.Transition count delta: 676
Deduced a syphon composed of 676 places in 0 ms
Reduce places removed 676 places and 0 transitions.
Iterating global reduction 2 with 1352 rules applied. Total rules applied 3120 place count 1127 transition count 847
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3121 place count 1127 transition count 846
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3123 place count 1126 transition count 845
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3325 place count 1025 transition count 845
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3361 place count 1007 transition count 845
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 3362 place count 1007 transition count 845
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3364 place count 1005 transition count 843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3365 place count 1004 transition count 843
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3365 place count 1004 transition count 841
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3369 place count 1002 transition count 841
Applied a total of 3369 rules in 474 ms. Remains 1002 /2688 variables (removed 1686) and now considering 841/2408 (removed 1567) transitions.
// Phase 1: matrix 841 rows 1002 cols
[2022-05-20 06:50:15] [INFO ] Computed 440 place invariants in 5 ms
[2022-05-20 06:50:15] [INFO ] Implicit Places using invariants in 540 ms returned [985, 989]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 543 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/2688 places, 841/2408 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 998 transition count 839
Applied a total of 4 rules in 31 ms. Remains 998 /1000 variables (removed 2) and now considering 839/841 (removed 2) transitions.
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 06:50:15] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:50:16] [INFO ] Implicit Places using invariants in 496 ms returned []
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 06:50:16] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:50:17] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1485 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 998/2688 places, 839/2408 transitions.
Finished structural reductions, in 2 iterations. Remains : 998/2688 places, 839/2408 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p3:(EQ s551 1), p2:(EQ s1 0), p1:(EQ s551 0), p0:(OR (EQ s317 0) (EQ s329 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 668 ms.
Product exploration explored 100000 steps with 0 reset in 851 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 294 ms. Reduced automaton from 2 states, 6 edges and 4 AP to 2 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 119235 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119235 steps, saw 88322 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 06:50:22] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:50:23] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 06:50:23] [INFO ] [Nat]Absence check using 438 positive place invariants in 59 ms returned sat
[2022-05-20 06:50:23] [INFO ] After 425ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 06:50:24] [INFO ] After 713ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 164 ms.
[2022-05-20 06:50:24] [INFO ] After 1173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 4 out of 998 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 998/998 places, 839/839 transitions.
Applied a total of 0 rules in 17 ms. Remains 998 /998 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 839/839 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 119698 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119698 steps, saw 88666 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 06:50:27] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:50:27] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 06:50:28] [INFO ] [Nat]Absence check using 438 positive place invariants in 63 ms returned sat
[2022-05-20 06:50:28] [INFO ] After 442ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 06:50:29] [INFO ] After 723ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 166 ms.
[2022-05-20 06:50:29] [INFO ] After 1218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 74 ms.
Support contains 4 out of 998 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 998/998 places, 839/839 transitions.
Applied a total of 0 rules in 16 ms. Remains 998 /998 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 839/839 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 998/998 places, 839/839 transitions.
Applied a total of 0 rules in 16 ms. Remains 998 /998 variables (removed 0) and now considering 839/839 (removed 0) transitions.
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 06:50:29] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:50:29] [INFO ] Implicit Places using invariants in 471 ms returned []
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 06:50:29] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:50:30] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 1361 ms to find 0 implicit places.
[2022-05-20 06:50:30] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 06:50:30] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:50:31] [INFO ] Dead Transitions using invariants and state equation in 395 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 839/839 transitions.
Partial Free-agglomeration rule applied 234 times.
Drop transitions removed 234 transitions
Iterating global reduction 0 with 234 rules applied. Total rules applied 234 place count 998 transition count 839
Applied a total of 234 rules in 36 ms. Remains 998 /998 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 06:50:31] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:50:31] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 06:50:31] [INFO ] [Nat]Absence check using 438 positive place invariants in 59 ms returned sat
[2022-05-20 06:50:32] [INFO ] After 433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 06:50:32] [INFO ] After 720ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 173 ms.
[2022-05-20 06:50:32] [INFO ] After 1195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2022-05-20 06:50:32] [INFO ] Flatten gal took : 23 ms
[2022-05-20 06:50:32] [INFO ] Flatten gal took : 23 ms
[2022-05-20 06:50:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14952035931687147136.gal : 3 ms
[2022-05-20 06:50:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15731940675872165645.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16456113550857200954;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14952035931687147136.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15731940675872165645.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality15731940675872165645.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :2 after 12
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :12 after 30
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :30 after 64
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :64 after 122
Reachability property apf1 is true.
Reachability property apf0 is true.
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :122 after 265
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :265 after 771
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :771 after 9129
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :9129 after 54617
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :54617 after 5.4467e+06
Detected timeout of ITS tools.
[2022-05-20 06:50:47] [INFO ] Flatten gal took : 24 ms
[2022-05-20 06:50:47] [INFO ] Applying decomposition
[2022-05-20 06:50:47] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13119847387328085387.txt' '-o' '/tmp/graph13119847387328085387.bin' '-w' '/tmp/graph13119847387328085387.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13119847387328085387.bin' '-l' '-1' '-v' '-w' '/tmp/graph13119847387328085387.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:50:47] [INFO ] Decomposing Gal with order
[2022-05-20 06:50:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:50:47] [INFO ] Removed a total of 122 redundant transitions.
[2022-05-20 06:50:47] [INFO ] Flatten gal took : 41 ms
[2022-05-20 06:50:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 7 ms.
[2022-05-20 06:50:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6727298229140544334.gal : 6 ms
[2022-05-20 06:50:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12453207288569038030.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16456113550857200954;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6727298229140544334.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12453207288569038030.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality12453207288569038030.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :2 after 2
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12050897880344588159
[2022-05-20 06:51:02] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12050897880344588159
Running compilation step : cd /tmp/ltsmin12050897880344588159;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1441 ms.
Running link step : cd /tmp/ltsmin12050897880344588159;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12050897880344588159;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf2==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p3) p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 345 ms. Reduced automaton from 2 states, 6 edges and 4 AP to 2 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 4 out of 998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 998/998 places, 839/839 transitions.
Applied a total of 0 rules in 21 ms. Remains 998 /998 variables (removed 0) and now considering 839/839 (removed 0) transitions.
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 06:51:18] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:51:18] [INFO ] Implicit Places using invariants in 510 ms returned []
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 06:51:18] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:51:19] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1463 ms to find 0 implicit places.
[2022-05-20 06:51:19] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 06:51:19] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:51:20] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 839/839 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p3) p0 p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 445 ms. Reduced automaton from 2 states, 6 edges and 4 AP to 2 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 120939 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 120939 steps, saw 89722 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 06:51:24] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:51:24] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 06:51:24] [INFO ] [Nat]Absence check using 438 positive place invariants in 57 ms returned sat
[2022-05-20 06:51:25] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 06:51:25] [INFO ] After 711ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 165 ms.
[2022-05-20 06:51:25] [INFO ] After 1160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 68 ms.
Support contains 4 out of 998 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 998/998 places, 839/839 transitions.
Applied a total of 0 rules in 16 ms. Remains 998 /998 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 839/839 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 120939 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 120939 steps, saw 89722 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 06:51:29] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:51:29] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 06:51:29] [INFO ] [Nat]Absence check using 438 positive place invariants in 58 ms returned sat
[2022-05-20 06:51:30] [INFO ] After 429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 06:51:30] [INFO ] After 706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 169 ms.
[2022-05-20 06:51:30] [INFO ] After 1175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 81 ms.
Support contains 4 out of 998 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 998/998 places, 839/839 transitions.
Applied a total of 0 rules in 16 ms. Remains 998 /998 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 839/839 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 998/998 places, 839/839 transitions.
Applied a total of 0 rules in 36 ms. Remains 998 /998 variables (removed 0) and now considering 839/839 (removed 0) transitions.
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 06:51:30] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:51:31] [INFO ] Implicit Places using invariants in 453 ms returned []
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 06:51:31] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:51:32] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1392 ms to find 0 implicit places.
[2022-05-20 06:51:32] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 06:51:32] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:51:32] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 839/839 transitions.
Partial Free-agglomeration rule applied 234 times.
Drop transitions removed 234 transitions
Iterating global reduction 0 with 234 rules applied. Total rules applied 234 place count 998 transition count 839
Applied a total of 234 rules in 37 ms. Remains 998 /998 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 06:51:32] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:51:32] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 06:51:33] [INFO ] [Nat]Absence check using 438 positive place invariants in 57 ms returned sat
[2022-05-20 06:51:33] [INFO ] After 444ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 06:51:33] [INFO ] After 724ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 170 ms.
[2022-05-20 06:51:34] [INFO ] After 1177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2022-05-20 06:51:34] [INFO ] Flatten gal took : 22 ms
[2022-05-20 06:51:34] [INFO ] Flatten gal took : 22 ms
[2022-05-20 06:51:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7010279666199053716.gal : 2 ms
[2022-05-20 06:51:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9397579159612029555.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3829218455556704405;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7010279666199053716.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9397579159612029555.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality9397579159612029555.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :2 after 12
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :12 after 30
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :30 after 64
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :64 after 122
Reachability property apf1 is true.
Reachability property apf0 is true.
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :122 after 265
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :265 after 771
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :771 after 9129
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :9129 after 54617
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :54617 after 5.4467e+06
Detected timeout of ITS tools.
[2022-05-20 06:51:49] [INFO ] Flatten gal took : 21 ms
[2022-05-20 06:51:49] [INFO ] Applying decomposition
[2022-05-20 06:51:49] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8361621505397777697.txt' '-o' '/tmp/graph8361621505397777697.bin' '-w' '/tmp/graph8361621505397777697.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8361621505397777697.bin' '-l' '-1' '-v' '-w' '/tmp/graph8361621505397777697.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:51:49] [INFO ] Decomposing Gal with order
[2022-05-20 06:51:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:51:49] [INFO ] Removed a total of 122 redundant transitions.
[2022-05-20 06:51:49] [INFO ] Flatten gal took : 36 ms
[2022-05-20 06:51:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 8 ms.
[2022-05-20 06:51:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3415229929996143458.gal : 6 ms
[2022-05-20 06:51:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9556776389696586851.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3829218455556704405;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3415229929996143458.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9556776389696586851.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality9556776389696586851.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :2 after 6
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14962096000950481226
[2022-05-20 06:52:04] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14962096000950481226
Running compilation step : cd /tmp/ltsmin14962096000950481226;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1424 ms.
Running link step : cd /tmp/ltsmin14962096000950481226;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14962096000950481226;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf2==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND p2 (NOT p3) p0 p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 306 ms. Reduced automaton from 2 states, 6 edges and 4 AP to 2 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 655 ms.
Product exploration explored 100000 steps with 0 reset in 857 ms.
Built C files in :
/tmp/ltsmin9250758625180760475
[2022-05-20 06:52:21] [INFO ] Computing symmetric may disable matrix : 839 transitions.
[2022-05-20 06:52:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 06:52:21] [INFO ] Computing symmetric may enable matrix : 839 transitions.
[2022-05-20 06:52:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 06:52:21] [INFO ] Computing Do-Not-Accords matrix : 839 transitions.
[2022-05-20 06:52:21] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 06:52:21] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9250758625180760475
Running compilation step : cd /tmp/ltsmin9250758625180760475;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2210 ms.
Running link step : cd /tmp/ltsmin9250758625180760475;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin9250758625180760475;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3445035236703110771.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 998/998 places, 839/839 transitions.
Applied a total of 0 rules in 21 ms. Remains 998 /998 variables (removed 0) and now considering 839/839 (removed 0) transitions.
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 06:52:36] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:52:37] [INFO ] Implicit Places using invariants in 511 ms returned []
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 06:52:37] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:52:38] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1455 ms to find 0 implicit places.
[2022-05-20 06:52:38] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 06:52:38] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:52:38] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 839/839 transitions.
Built C files in :
/tmp/ltsmin9862051580093878614
[2022-05-20 06:52:38] [INFO ] Computing symmetric may disable matrix : 839 transitions.
[2022-05-20 06:52:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 06:52:38] [INFO ] Computing symmetric may enable matrix : 839 transitions.
[2022-05-20 06:52:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 06:52:38] [INFO ] Computing Do-Not-Accords matrix : 839 transitions.
[2022-05-20 06:52:38] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 06:52:38] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9862051580093878614
Running compilation step : cd /tmp/ltsmin9862051580093878614;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2561 ms.
Running link step : cd /tmp/ltsmin9862051580093878614;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin9862051580093878614;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3632707847144271073.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 06:52:53] [INFO ] Flatten gal took : 20 ms
[2022-05-20 06:52:53] [INFO ] Flatten gal took : 20 ms
[2022-05-20 06:52:53] [INFO ] Time to serialize gal into /tmp/LTL13310670589934101691.gal : 2 ms
[2022-05-20 06:52:53] [INFO ] Time to serialize properties into /tmp/LTL2773233094232956257.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13310670589934101691.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2773233094232956257.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1331067...267
Read 1 LTL properties
Checking formula 0 : !((G((F(((G(X("((p995==0)||(p1042==0))")))||(F(G("(p1708==0)"))))||("(p41==0)")))||("(p1708==1)"))))
Formula 0 simplified : !G("(p1708==1)" | F("(p41==0)" | GX"((p995==0)||(p1042==0))" | FG"(p1708==0)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 6.79862e+65 deadlock states
Detected timeout of ITS tools.
[2022-05-20 06:53:08] [INFO ] Flatten gal took : 22 ms
[2022-05-20 06:53:08] [INFO ] Applying decomposition
[2022-05-20 06:53:08] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9203804009012888129.txt' '-o' '/tmp/graph9203804009012888129.bin' '-w' '/tmp/graph9203804009012888129.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9203804009012888129.bin' '-l' '-1' '-v' '-w' '/tmp/graph9203804009012888129.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:53:08] [INFO ] Decomposing Gal with order
[2022-05-20 06:53:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:53:09] [INFO ] Removed a total of 249 redundant transitions.
[2022-05-20 06:53:09] [INFO ] Flatten gal took : 40 ms
[2022-05-20 06:53:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 238 labels/synchronizations in 5 ms.
[2022-05-20 06:53:09] [INFO ] Time to serialize gal into /tmp/LTL10553878770814876280.gal : 7 ms
[2022-05-20 06:53:09] [INFO ] Time to serialize properties into /tmp/LTL2204969255374925752.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10553878770814876280.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2204969255374925752.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1055387...246
Read 1 LTL properties
Checking formula 0 : !((G((F(((G(X("((i12.u104.p995==0)||(i12.u106.p1042==0))")))||(F(G("(i21.u179.p1708==0)"))))||("(i0.u0.p41==0)")))||("(i21.u179.p1708=...163
Formula 0 simplified : !G("(i21.u179.p1708==1)" | F("(i0.u0.p41==0)" | GX"((i12.u104.p995==0)||(i12.u106.p1042==0))" | FG"(i21.u179.p1708==0)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 6.79862e+65 deadlock states
4 unique states visited
3 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
108 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.1832,49768,1,0,63612,230,3584,133059,227,765,132223
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-040B-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldPPPt-PT-040B-LTLFireability-02 finished in 175618 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1)&&X(X(G(p0))))))'
Support contains 3 out of 2688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2688/2688 places, 2408/2408 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2681 transition count 2401
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2681 transition count 2401
Applied a total of 14 rules in 280 ms. Remains 2681 /2688 variables (removed 7) and now considering 2401/2408 (removed 7) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 06:53:10] [INFO ] Computed 441 place invariants in 11 ms
[2022-05-20 06:53:11] [INFO ] Implicit Places using invariants in 825 ms returned []
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 06:53:11] [INFO ] Computed 441 place invariants in 7 ms
[2022-05-20 06:53:13] [INFO ] Implicit Places using invariants and state equation in 2435 ms returned []
Implicit Place search using SMT with State Equation took 3263 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 06:53:13] [INFO ] Computed 441 place invariants in 16 ms
[2022-05-20 06:53:15] [INFO ] Dead Transitions using invariants and state equation in 1499 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2681/2688 places, 2401/2408 transitions.
Finished structural reductions, in 1 iterations. Remains : 2681/2688 places, 2401/2408 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=(AND p1 p0), acceptance={0} source=5 dest: 2}, { cond=(NOT p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(EQ s1131 1), p0:(AND (EQ s2579 1) (EQ s2616 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-03 finished in 5273 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 4 out of 2688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2688/2688 places, 2408/2408 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2681 transition count 2401
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2681 transition count 2401
Applied a total of 14 rules in 254 ms. Remains 2681 /2688 variables (removed 7) and now considering 2401/2408 (removed 7) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 06:53:15] [INFO ] Computed 441 place invariants in 11 ms
[2022-05-20 06:53:16] [INFO ] Implicit Places using invariants in 891 ms returned []
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 06:53:16] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-20 06:53:19] [INFO ] Implicit Places using invariants and state equation in 2466 ms returned []
Implicit Place search using SMT with State Equation took 3362 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 06:53:19] [INFO ] Computed 441 place invariants in 11 ms
[2022-05-20 06:53:20] [INFO ] Dead Transitions using invariants and state equation in 1477 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2681/2688 places, 2401/2408 transitions.
Finished structural reductions, in 1 iterations. Remains : 2681/2688 places, 2401/2408 transitions.
Stuttering acceptance computed with spot in 64 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s650 0) (EQ s2262 1) (EQ s115 0)), p1:(EQ s477 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 777 reset in 349 ms.
Product exploration explored 100000 steps with 782 reset in 386 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 220 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 57 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 06:53:22] [INFO ] Computed 441 place invariants in 7 ms
[2022-05-20 06:53:22] [INFO ] After 309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 06:53:22] [INFO ] [Nat]Absence check using 441 positive place invariants in 153 ms returned sat
[2022-05-20 06:53:24] [INFO ] After 1422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 06:53:24] [INFO ] Deduced a trap composed of 22 places in 484 ms of which 1 ms to minimize.
[2022-05-20 06:53:25] [INFO ] Deduced a trap composed of 21 places in 481 ms of which 1 ms to minimize.
[2022-05-20 06:53:26] [INFO ] Deduced a trap composed of 17 places in 496 ms of which 1 ms to minimize.
[2022-05-20 06:53:26] [INFO ] Deduced a trap composed of 16 places in 471 ms of which 1 ms to minimize.
[2022-05-20 06:53:27] [INFO ] Deduced a trap composed of 20 places in 496 ms of which 2 ms to minimize.
[2022-05-20 06:53:27] [INFO ] Deduced a trap composed of 31 places in 443 ms of which 1 ms to minimize.
[2022-05-20 06:53:28] [INFO ] Deduced a trap composed of 26 places in 450 ms of which 1 ms to minimize.
[2022-05-20 06:53:28] [INFO ] Deduced a trap composed of 19 places in 452 ms of which 2 ms to minimize.
[2022-05-20 06:53:29] [INFO ] Deduced a trap composed of 23 places in 444 ms of which 1 ms to minimize.
[2022-05-20 06:53:29] [INFO ] Deduced a trap composed of 33 places in 430 ms of which 1 ms to minimize.
[2022-05-20 06:53:30] [INFO ] Deduced a trap composed of 27 places in 431 ms of which 1 ms to minimize.
[2022-05-20 06:53:30] [INFO ] Deduced a trap composed of 25 places in 412 ms of which 2 ms to minimize.
[2022-05-20 06:53:31] [INFO ] Deduced a trap composed of 24 places in 396 ms of which 1 ms to minimize.
[2022-05-20 06:53:31] [INFO ] Deduced a trap composed of 29 places in 376 ms of which 1 ms to minimize.
[2022-05-20 06:53:32] [INFO ] Deduced a trap composed of 27 places in 374 ms of which 1 ms to minimize.
[2022-05-20 06:53:32] [INFO ] Deduced a trap composed of 28 places in 382 ms of which 1 ms to minimize.
[2022-05-20 06:53:33] [INFO ] Deduced a trap composed of 21 places in 367 ms of which 1 ms to minimize.
[2022-05-20 06:53:33] [INFO ] Deduced a trap composed of 34 places in 361 ms of which 1 ms to minimize.
[2022-05-20 06:53:34] [INFO ] Deduced a trap composed of 32 places in 359 ms of which 1 ms to minimize.
[2022-05-20 06:53:34] [INFO ] Deduced a trap composed of 45 places in 348 ms of which 1 ms to minimize.
[2022-05-20 06:53:34] [INFO ] Deduced a trap composed of 44 places in 343 ms of which 1 ms to minimize.
[2022-05-20 06:53:35] [INFO ] Deduced a trap composed of 22 places in 348 ms of which 1 ms to minimize.
[2022-05-20 06:53:35] [INFO ] Deduced a trap composed of 31 places in 339 ms of which 1 ms to minimize.
[2022-05-20 06:53:36] [INFO ] Deduced a trap composed of 40 places in 334 ms of which 1 ms to minimize.
[2022-05-20 06:53:36] [INFO ] Deduced a trap composed of 45 places in 329 ms of which 1 ms to minimize.
[2022-05-20 06:53:37] [INFO ] Deduced a trap composed of 41 places in 354 ms of which 1 ms to minimize.
[2022-05-20 06:53:37] [INFO ] Deduced a trap composed of 40 places in 322 ms of which 1 ms to minimize.
[2022-05-20 06:53:37] [INFO ] Deduced a trap composed of 38 places in 304 ms of which 1 ms to minimize.
[2022-05-20 06:53:38] [INFO ] Deduced a trap composed of 32 places in 306 ms of which 1 ms to minimize.
[2022-05-20 06:53:38] [INFO ] Deduced a trap composed of 42 places in 278 ms of which 1 ms to minimize.
[2022-05-20 06:53:38] [INFO ] Deduced a trap composed of 38 places in 274 ms of which 1 ms to minimize.
[2022-05-20 06:53:39] [INFO ] Deduced a trap composed of 40 places in 266 ms of which 0 ms to minimize.
[2022-05-20 06:53:39] [INFO ] Deduced a trap composed of 39 places in 249 ms of which 1 ms to minimize.
[2022-05-20 06:53:39] [INFO ] Deduced a trap composed of 42 places in 258 ms of which 1 ms to minimize.
[2022-05-20 06:53:40] [INFO ] Deduced a trap composed of 44 places in 267 ms of which 1 ms to minimize.
[2022-05-20 06:53:40] [INFO ] Deduced a trap composed of 47 places in 262 ms of which 1 ms to minimize.
[2022-05-20 06:53:41] [INFO ] Deduced a trap composed of 45 places in 253 ms of which 1 ms to minimize.
[2022-05-20 06:53:41] [INFO ] Deduced a trap composed of 44 places in 229 ms of which 1 ms to minimize.
[2022-05-20 06:53:41] [INFO ] Deduced a trap composed of 43 places in 226 ms of which 1 ms to minimize.
[2022-05-20 06:53:41] [INFO ] Deduced a trap composed of 47 places in 213 ms of which 1 ms to minimize.
[2022-05-20 06:53:42] [INFO ] Deduced a trap composed of 51 places in 219 ms of which 1 ms to minimize.
[2022-05-20 06:53:42] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 1 ms to minimize.
[2022-05-20 06:53:42] [INFO ] Deduced a trap composed of 47 places in 237 ms of which 1 ms to minimize.
[2022-05-20 06:53:43] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 1 ms to minimize.
[2022-05-20 06:53:43] [INFO ] Deduced a trap composed of 54 places in 208 ms of which 1 ms to minimize.
[2022-05-20 06:53:43] [INFO ] Deduced a trap composed of 52 places in 206 ms of which 0 ms to minimize.
[2022-05-20 06:53:44] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 0 ms to minimize.
[2022-05-20 06:53:44] [INFO ] Deduced a trap composed of 50 places in 191 ms of which 0 ms to minimize.
[2022-05-20 06:53:44] [INFO ] Deduced a trap composed of 60 places in 183 ms of which 0 ms to minimize.
[2022-05-20 06:53:44] [INFO ] Deduced a trap composed of 55 places in 187 ms of which 0 ms to minimize.
[2022-05-20 06:53:45] [INFO ] Deduced a trap composed of 56 places in 185 ms of which 0 ms to minimize.
[2022-05-20 06:53:45] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 1 ms to minimize.
[2022-05-20 06:53:45] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 21099 ms
[2022-05-20 06:53:45] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 1 ms to minimize.
[2022-05-20 06:53:46] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 0 ms to minimize.
[2022-05-20 06:53:46] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 1 ms to minimize.
[2022-05-20 06:53:46] [INFO ] Deduced a trap composed of 54 places in 178 ms of which 0 ms to minimize.
[2022-05-20 06:53:46] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 1 ms to minimize.
[2022-05-20 06:53:47] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 1 ms to minimize.
[2022-05-20 06:53:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1643 ms
[2022-05-20 06:53:47] [INFO ] After 24304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 168 ms.
[2022-05-20 06:53:47] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 51 ms.
Support contains 4 out of 2681 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2681 transition count 1843
Reduce places removed 558 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 559 rules applied. Total rules applied 1117 place count 2123 transition count 1842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1118 place count 2122 transition count 1842
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 1118 place count 2122 transition count 1523
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1756 place count 1803 transition count 1523
Performed 676 Post agglomeration using F-continuation condition.Transition count delta: 676
Deduced a syphon composed of 676 places in 1 ms
Reduce places removed 676 places and 0 transitions.
Iterating global reduction 3 with 1352 rules applied. Total rules applied 3108 place count 1127 transition count 847
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3109 place count 1127 transition count 846
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3111 place count 1126 transition count 845
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3313 place count 1025 transition count 845
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3347 place count 1008 transition count 845
Partial Free-agglomeration rule applied 119 times.
Drop transitions removed 119 transitions
Iterating global reduction 4 with 119 rules applied. Total rules applied 3466 place count 1008 transition count 845
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3467 place count 1007 transition count 844
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3468 place count 1006 transition count 844
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3468 place count 1006 transition count 842
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3472 place count 1004 transition count 842
Applied a total of 3472 rules in 356 ms. Remains 1004 /2681 variables (removed 1677) and now considering 842/2401 (removed 1559) transitions.
Finished structural reductions, in 1 iterations. Remains : 1004/2681 places, 842/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 197974 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197974 steps, saw 178560 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 842 rows 1004 cols
[2022-05-20 06:53:51] [INFO ] Computed 440 place invariants in 4 ms
[2022-05-20 06:53:51] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 06:53:51] [INFO ] [Nat]Absence check using 440 positive place invariants in 61 ms returned sat
[2022-05-20 06:53:51] [INFO ] After 350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 06:53:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-20 06:53:51] [INFO ] After 70ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 06:53:52] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2022-05-20 06:53:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2022-05-20 06:53:52] [INFO ] After 287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 73 ms.
[2022-05-20 06:53:52] [INFO ] After 966ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 29 ms.
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1004/1004 places, 842/842 transitions.
Applied a total of 0 rules in 19 ms. Remains 1004 /1004 variables (removed 0) and now considering 842/842 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1004/1004 places, 842/842 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1004/1004 places, 842/842 transitions.
Applied a total of 0 rules in 18 ms. Remains 1004 /1004 variables (removed 0) and now considering 842/842 (removed 0) transitions.
// Phase 1: matrix 842 rows 1004 cols
[2022-05-20 06:53:52] [INFO ] Computed 440 place invariants in 2 ms
[2022-05-20 06:53:52] [INFO ] Implicit Places using invariants in 519 ms returned [987, 991]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 521 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1002/1004 places, 842/842 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1000 transition count 840
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1000 transition count 840
Applied a total of 4 rules in 30 ms. Remains 1000 /1002 variables (removed 2) and now considering 840/842 (removed 2) transitions.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:53:52] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:53:53] [INFO ] Implicit Places using invariants in 500 ms returned []
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:53:53] [INFO ] Computed 438 place invariants in 6 ms
[2022-05-20 06:53:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 06:53:54] [INFO ] Implicit Places using invariants and state equation in 998 ms returned []
Implicit Place search using SMT with State Equation took 1500 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1000/1004 places, 840/842 transitions.
Finished structural reductions, in 2 iterations. Remains : 1000/1004 places, 840/842 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 172084 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 172084 steps, saw 156088 distinct states, run finished after 3002 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:53:57] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:53:57] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 06:53:57] [INFO ] [Nat]Absence check using 438 positive place invariants in 64 ms returned sat
[2022-05-20 06:53:58] [INFO ] After 345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 06:53:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 06:53:58] [INFO ] After 70ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 06:53:58] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 0 ms to minimize.
[2022-05-20 06:53:58] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2022-05-20 06:53:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 255 ms
[2022-05-20 06:53:58] [INFO ] After 417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 74 ms.
[2022-05-20 06:53:58] [INFO ] After 1045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 27 ms.
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1000/1000 places, 840/840 transitions.
Applied a total of 0 rules in 20 ms. Remains 1000 /1000 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 840/840 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1000/1000 places, 840/840 transitions.
Applied a total of 0 rules in 20 ms. Remains 1000 /1000 variables (removed 0) and now considering 840/840 (removed 0) transitions.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:53:58] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:53:59] [INFO ] Implicit Places using invariants in 477 ms returned []
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:53:59] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:53:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 06:54:00] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned []
Implicit Place search using SMT with State Equation took 1495 ms to find 0 implicit places.
[2022-05-20 06:54:00] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:54:00] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:54:00] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 840/840 transitions.
Partial Free-agglomeration rule applied 236 times.
Drop transitions removed 236 transitions
Iterating global reduction 0 with 236 rules applied. Total rules applied 236 place count 1000 transition count 840
Applied a total of 236 rules in 46 ms. Remains 1000 /1000 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:54:00] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:54:00] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 06:54:01] [INFO ] [Nat]Absence check using 438 positive place invariants in 62 ms returned sat
[2022-05-20 06:54:01] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 06:54:01] [INFO ] State equation strengthened by 232 read => feed constraints.
[2022-05-20 06:54:01] [INFO ] After 223ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 06:54:01] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 1 ms to minimize.
[2022-05-20 06:54:02] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 0 ms to minimize.
[2022-05-20 06:54:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 399 ms
[2022-05-20 06:54:02] [INFO ] After 747ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 141 ms.
[2022-05-20 06:54:02] [INFO ] After 1462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-20 06:54:02] [INFO ] Flatten gal took : 26 ms
[2022-05-20 06:54:02] [INFO ] Flatten gal took : 26 ms
[2022-05-20 06:54:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3546156430688123164.gal : 5 ms
[2022-05-20 06:54:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16476025153160956402.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16315984491626204175;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3546156430688123164.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16476025153160956402.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality16476025153160956402.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 90
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :90 after 159
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :159 after 258
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :258 after 351
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :351 after 1061
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1061 after 12532
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :12532 after 809104
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :809104 after 8.20335e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8.20335e+07 after 3.81427e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3.81427e+08 after 3.04162e+11
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.04162e+11 after 1.86836e+13
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.86836e+13 after 2.45053e+18
Detected timeout of ITS tools.
[2022-05-20 06:54:17] [INFO ] Flatten gal took : 27 ms
[2022-05-20 06:54:17] [INFO ] Applying decomposition
[2022-05-20 06:54:17] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12632303854178768889.txt' '-o' '/tmp/graph12632303854178768889.bin' '-w' '/tmp/graph12632303854178768889.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12632303854178768889.bin' '-l' '-1' '-v' '-w' '/tmp/graph12632303854178768889.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:54:17] [INFO ] Decomposing Gal with order
[2022-05-20 06:54:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:54:17] [INFO ] Removed a total of 182 redundant transitions.
[2022-05-20 06:54:17] [INFO ] Flatten gal took : 41 ms
[2022-05-20 06:54:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 7 ms.
[2022-05-20 06:54:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3379498405494943152.gal : 6 ms
[2022-05-20 06:54:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15530439543554760917.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16315984491626204175;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3379498405494943152.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15530439543554760917.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality15530439543554760917.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 3
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :3 after 3
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :3 after 3
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3 after 3
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.00832e+07 after 5.23365e+12
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13819273185365213154
[2022-05-20 06:54:32] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13819273185365213154
Running compilation step : cd /tmp/ltsmin13819273185365213154;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1485 ms.
Running link step : cd /tmp/ltsmin13819273185365213154;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13819273185365213154;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf1==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 273 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 06:54:48] [INFO ] Computed 441 place invariants in 9 ms
[2022-05-20 06:54:50] [INFO ] [Real]Absence check using 441 positive place invariants in 722 ms returned sat
[2022-05-20 06:54:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 06:55:03] [INFO ] [Real]Absence check using state equation in 12754 ms returned unknown
Could not prove EG (NOT p0)
Support contains 4 out of 2681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Applied a total of 0 rules in 153 ms. Remains 2681 /2681 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 06:55:03] [INFO ] Computed 441 place invariants in 7 ms
[2022-05-20 06:55:04] [INFO ] Implicit Places using invariants in 787 ms returned []
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 06:55:04] [INFO ] Computed 441 place invariants in 7 ms
[2022-05-20 06:55:06] [INFO ] Implicit Places using invariants and state equation in 2387 ms returned []
Implicit Place search using SMT with State Equation took 3175 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 06:55:06] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-20 06:55:07] [INFO ] Dead Transitions using invariants and state equation in 1365 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2681/2681 places, 2401/2401 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 278 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 06:55:08] [INFO ] Computed 441 place invariants in 13 ms
[2022-05-20 06:55:08] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 06:55:09] [INFO ] [Nat]Absence check using 441 positive place invariants in 140 ms returned sat
[2022-05-20 06:55:10] [INFO ] After 1314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 06:55:11] [INFO ] Deduced a trap composed of 22 places in 482 ms of which 2 ms to minimize.
[2022-05-20 06:55:11] [INFO ] Deduced a trap composed of 21 places in 488 ms of which 1 ms to minimize.
[2022-05-20 06:55:12] [INFO ] Deduced a trap composed of 17 places in 477 ms of which 2 ms to minimize.
[2022-05-20 06:55:12] [INFO ] Deduced a trap composed of 16 places in 458 ms of which 1 ms to minimize.
[2022-05-20 06:55:13] [INFO ] Deduced a trap composed of 20 places in 462 ms of which 1 ms to minimize.
[2022-05-20 06:55:13] [INFO ] Deduced a trap composed of 31 places in 452 ms of which 1 ms to minimize.
[2022-05-20 06:55:14] [INFO ] Deduced a trap composed of 26 places in 445 ms of which 1 ms to minimize.
[2022-05-20 06:55:15] [INFO ] Deduced a trap composed of 19 places in 458 ms of which 1 ms to minimize.
[2022-05-20 06:55:15] [INFO ] Deduced a trap composed of 23 places in 436 ms of which 2 ms to minimize.
[2022-05-20 06:55:16] [INFO ] Deduced a trap composed of 33 places in 425 ms of which 1 ms to minimize.
[2022-05-20 06:55:16] [INFO ] Deduced a trap composed of 27 places in 417 ms of which 1 ms to minimize.
[2022-05-20 06:55:17] [INFO ] Deduced a trap composed of 25 places in 441 ms of which 1 ms to minimize.
[2022-05-20 06:55:17] [INFO ] Deduced a trap composed of 24 places in 393 ms of which 2 ms to minimize.
[2022-05-20 06:55:18] [INFO ] Deduced a trap composed of 29 places in 375 ms of which 1 ms to minimize.
[2022-05-20 06:55:18] [INFO ] Deduced a trap composed of 27 places in 377 ms of which 1 ms to minimize.
[2022-05-20 06:55:18] [INFO ] Deduced a trap composed of 28 places in 388 ms of which 1 ms to minimize.
[2022-05-20 06:55:19] [INFO ] Deduced a trap composed of 21 places in 368 ms of which 1 ms to minimize.
[2022-05-20 06:55:19] [INFO ] Deduced a trap composed of 34 places in 350 ms of which 1 ms to minimize.
[2022-05-20 06:55:20] [INFO ] Deduced a trap composed of 32 places in 362 ms of which 1 ms to minimize.
[2022-05-20 06:55:20] [INFO ] Deduced a trap composed of 45 places in 350 ms of which 1 ms to minimize.
[2022-05-20 06:55:21] [INFO ] Deduced a trap composed of 44 places in 344 ms of which 1 ms to minimize.
[2022-05-20 06:55:21] [INFO ] Deduced a trap composed of 22 places in 343 ms of which 1 ms to minimize.
[2022-05-20 06:55:21] [INFO ] Deduced a trap composed of 31 places in 343 ms of which 1 ms to minimize.
[2022-05-20 06:55:22] [INFO ] Deduced a trap composed of 40 places in 332 ms of which 1 ms to minimize.
[2022-05-20 06:55:22] [INFO ] Deduced a trap composed of 45 places in 319 ms of which 1 ms to minimize.
[2022-05-20 06:55:23] [INFO ] Deduced a trap composed of 41 places in 311 ms of which 1 ms to minimize.
[2022-05-20 06:55:23] [INFO ] Deduced a trap composed of 40 places in 305 ms of which 1 ms to minimize.
[2022-05-20 06:55:23] [INFO ] Deduced a trap composed of 38 places in 297 ms of which 1 ms to minimize.
[2022-05-20 06:55:24] [INFO ] Deduced a trap composed of 32 places in 291 ms of which 1 ms to minimize.
[2022-05-20 06:55:24] [INFO ] Deduced a trap composed of 42 places in 280 ms of which 1 ms to minimize.
[2022-05-20 06:55:25] [INFO ] Deduced a trap composed of 38 places in 271 ms of which 1 ms to minimize.
[2022-05-20 06:55:25] [INFO ] Deduced a trap composed of 40 places in 264 ms of which 0 ms to minimize.
[2022-05-20 06:55:25] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 1 ms to minimize.
[2022-05-20 06:55:26] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 1 ms to minimize.
[2022-05-20 06:55:26] [INFO ] Deduced a trap composed of 44 places in 243 ms of which 0 ms to minimize.
[2022-05-20 06:55:26] [INFO ] Deduced a trap composed of 47 places in 240 ms of which 0 ms to minimize.
[2022-05-20 06:55:27] [INFO ] Deduced a trap composed of 45 places in 235 ms of which 0 ms to minimize.
[2022-05-20 06:55:27] [INFO ] Deduced a trap composed of 44 places in 220 ms of which 1 ms to minimize.
[2022-05-20 06:55:27] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 1 ms to minimize.
[2022-05-20 06:55:27] [INFO ] Deduced a trap composed of 47 places in 219 ms of which 1 ms to minimize.
[2022-05-20 06:55:28] [INFO ] Deduced a trap composed of 51 places in 221 ms of which 1 ms to minimize.
[2022-05-20 06:55:28] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 1 ms to minimize.
[2022-05-20 06:55:28] [INFO ] Deduced a trap composed of 47 places in 216 ms of which 0 ms to minimize.
[2022-05-20 06:55:29] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 0 ms to minimize.
[2022-05-20 06:55:29] [INFO ] Deduced a trap composed of 54 places in 208 ms of which 1 ms to minimize.
[2022-05-20 06:55:29] [INFO ] Deduced a trap composed of 52 places in 204 ms of which 0 ms to minimize.
[2022-05-20 06:55:29] [INFO ] Deduced a trap composed of 50 places in 205 ms of which 1 ms to minimize.
[2022-05-20 06:55:30] [INFO ] Deduced a trap composed of 50 places in 190 ms of which 0 ms to minimize.
[2022-05-20 06:55:30] [INFO ] Deduced a trap composed of 60 places in 191 ms of which 0 ms to minimize.
[2022-05-20 06:55:30] [INFO ] Deduced a trap composed of 55 places in 182 ms of which 0 ms to minimize.
[2022-05-20 06:55:31] [INFO ] Deduced a trap composed of 56 places in 176 ms of which 1 ms to minimize.
[2022-05-20 06:55:31] [INFO ] Deduced a trap composed of 58 places in 175 ms of which 1 ms to minimize.
[2022-05-20 06:55:31] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 20757 ms
[2022-05-20 06:55:31] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 0 ms to minimize.
[2022-05-20 06:55:32] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 1 ms to minimize.
[2022-05-20 06:55:32] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 1 ms to minimize.
[2022-05-20 06:55:32] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 0 ms to minimize.
[2022-05-20 06:55:32] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 1 ms to minimize.
[2022-05-20 06:55:33] [INFO ] Deduced a trap composed of 58 places in 162 ms of which 1 ms to minimize.
[2022-05-20 06:55:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1629 ms
[2022-05-20 06:55:33] [INFO ] After 23833ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 167 ms.
[2022-05-20 06:55:33] [INFO ] After 24505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 74 ms.
Support contains 4 out of 2681 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2681 transition count 1843
Reduce places removed 558 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 559 rules applied. Total rules applied 1117 place count 2123 transition count 1842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1118 place count 2122 transition count 1842
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 1118 place count 2122 transition count 1523
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1756 place count 1803 transition count 1523
Performed 676 Post agglomeration using F-continuation condition.Transition count delta: 676
Deduced a syphon composed of 676 places in 0 ms
Reduce places removed 676 places and 0 transitions.
Iterating global reduction 3 with 1352 rules applied. Total rules applied 3108 place count 1127 transition count 847
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3109 place count 1127 transition count 846
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3111 place count 1126 transition count 845
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3313 place count 1025 transition count 845
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3347 place count 1008 transition count 845
Partial Free-agglomeration rule applied 119 times.
Drop transitions removed 119 transitions
Iterating global reduction 4 with 119 rules applied. Total rules applied 3466 place count 1008 transition count 845
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3467 place count 1007 transition count 844
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3468 place count 1006 transition count 844
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3468 place count 1006 transition count 842
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3472 place count 1004 transition count 842
Applied a total of 3472 rules in 322 ms. Remains 1004 /2681 variables (removed 1677) and now considering 842/2401 (removed 1559) transitions.
Finished structural reductions, in 1 iterations. Remains : 1004/2681 places, 842/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 200962 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200962 steps, saw 181242 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 842 rows 1004 cols
[2022-05-20 06:55:36] [INFO ] Computed 440 place invariants in 3 ms
[2022-05-20 06:55:37] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 06:55:37] [INFO ] [Nat]Absence check using 440 positive place invariants in 61 ms returned sat
[2022-05-20 06:55:37] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 06:55:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-20 06:55:37] [INFO ] After 68ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 06:55:37] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2022-05-20 06:55:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-20 06:55:37] [INFO ] After 275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 69 ms.
[2022-05-20 06:55:37] [INFO ] After 920ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1004/1004 places, 842/842 transitions.
Applied a total of 0 rules in 32 ms. Remains 1004 /1004 variables (removed 0) and now considering 842/842 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1004/1004 places, 842/842 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1004/1004 places, 842/842 transitions.
Applied a total of 0 rules in 16 ms. Remains 1004 /1004 variables (removed 0) and now considering 842/842 (removed 0) transitions.
// Phase 1: matrix 842 rows 1004 cols
[2022-05-20 06:55:38] [INFO ] Computed 440 place invariants in 1 ms
[2022-05-20 06:55:38] [INFO ] Implicit Places using invariants in 467 ms returned [987, 991]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 474 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1002/1004 places, 842/842 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1000 transition count 840
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1000 transition count 840
Applied a total of 4 rules in 29 ms. Remains 1000 /1002 variables (removed 2) and now considering 840/842 (removed 2) transitions.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:55:38] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:55:39] [INFO ] Implicit Places using invariants in 515 ms returned []
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:55:39] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:55:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 06:55:40] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1497 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1000/1004 places, 840/842 transitions.
Finished structural reductions, in 2 iterations. Remains : 1000/1004 places, 840/842 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 208835 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 208835 steps, saw 189402 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:55:43] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:55:43] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 06:55:43] [INFO ] [Nat]Absence check using 438 positive place invariants in 61 ms returned sat
[2022-05-20 06:55:43] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 06:55:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 06:55:44] [INFO ] After 65ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 06:55:44] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2022-05-20 06:55:44] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 0 ms to minimize.
[2022-05-20 06:55:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 234 ms
[2022-05-20 06:55:44] [INFO ] After 380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 69 ms.
[2022-05-20 06:55:44] [INFO ] After 1021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1000/1000 places, 840/840 transitions.
Applied a total of 0 rules in 43 ms. Remains 1000 /1000 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 840/840 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1000/1000 places, 840/840 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 840/840 (removed 0) transitions.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:55:44] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:55:44] [INFO ] Implicit Places using invariants in 475 ms returned []
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:55:44] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:55:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 06:55:46] [INFO ] Implicit Places using invariants and state equation in 1013 ms returned []
Implicit Place search using SMT with State Equation took 1489 ms to find 0 implicit places.
[2022-05-20 06:55:46] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:55:46] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:55:46] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 840/840 transitions.
Partial Free-agglomeration rule applied 236 times.
Drop transitions removed 236 transitions
Iterating global reduction 0 with 236 rules applied. Total rules applied 236 place count 1000 transition count 840
Applied a total of 236 rules in 37 ms. Remains 1000 /1000 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:55:46] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:55:46] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 06:55:46] [INFO ] [Nat]Absence check using 438 positive place invariants in 57 ms returned sat
[2022-05-20 06:55:47] [INFO ] After 357ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 06:55:47] [INFO ] State equation strengthened by 232 read => feed constraints.
[2022-05-20 06:55:47] [INFO ] After 215ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 06:55:47] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 1 ms to minimize.
[2022-05-20 06:55:47] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 0 ms to minimize.
[2022-05-20 06:55:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 434 ms
[2022-05-20 06:55:47] [INFO ] After 785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 149 ms.
[2022-05-20 06:55:48] [INFO ] After 1493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-20 06:55:48] [INFO ] Flatten gal took : 26 ms
[2022-05-20 06:55:48] [INFO ] Flatten gal took : 26 ms
[2022-05-20 06:55:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14745580203378028397.gal : 3 ms
[2022-05-20 06:55:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12941026446819199053.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms17584764578236443395;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14745580203378028397.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12941026446819199053.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality12941026446819199053.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 90
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :90 after 159
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :159 after 258
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :258 after 351
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :351 after 1061
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1061 after 12532
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :12532 after 809104
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :809104 after 8.20335e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8.20335e+07 after 3.81427e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3.81427e+08 after 3.04162e+11
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.04162e+11 after 1.86836e+13
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.86836e+13 after 2.45053e+18
Detected timeout of ITS tools.
[2022-05-20 06:56:03] [INFO ] Flatten gal took : 25 ms
[2022-05-20 06:56:03] [INFO ] Applying decomposition
[2022-05-20 06:56:03] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5416328208130969609.txt' '-o' '/tmp/graph5416328208130969609.bin' '-w' '/tmp/graph5416328208130969609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5416328208130969609.bin' '-l' '-1' '-v' '-w' '/tmp/graph5416328208130969609.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:56:03] [INFO ] Decomposing Gal with order
[2022-05-20 06:56:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:56:03] [INFO ] Removed a total of 214 redundant transitions.
[2022-05-20 06:56:03] [INFO ] Flatten gal took : 41 ms
[2022-05-20 06:56:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 161 labels/synchronizations in 3 ms.
[2022-05-20 06:56:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16613406993068977342.gal : 7 ms
[2022-05-20 06:56:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8759005813631103804.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17584764578236443395;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16613406993068977342.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8759005813631103804.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality8759005813631103804.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 3
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :3 after 3
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :3 after 3
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3 after 3
Reachability property apf1 is true.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :10080 after 1.39892e+38
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.39892e+38 after 1.4935e+52
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10292992180268823152
[2022-05-20 06:56:18] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10292992180268823152
Running compilation step : cd /tmp/ltsmin10292992180268823152;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1509 ms.
Running link step : cd /tmp/ltsmin10292992180268823152;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10292992180268823152;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf2==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 215 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 57 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 06:56:33] [INFO ] Computed 441 place invariants in 9 ms
[2022-05-20 06:56:36] [INFO ] [Real]Absence check using 441 positive place invariants in 698 ms returned sat
[2022-05-20 06:56:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 06:56:49] [INFO ] [Real]Absence check using state equation in 12781 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 778 reset in 305 ms.
Product exploration explored 100000 steps with 769 reset in 329 ms.
Built C files in :
/tmp/ltsmin6591555570504718811
[2022-05-20 06:56:50] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6591555570504718811
Running compilation step : cd /tmp/ltsmin6591555570504718811;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6591555570504718811;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6591555570504718811;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 2681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Applied a total of 0 rules in 126 ms. Remains 2681 /2681 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 06:56:53] [INFO ] Computed 441 place invariants in 9 ms
[2022-05-20 06:56:54] [INFO ] Implicit Places using invariants in 847 ms returned []
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 06:56:54] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-20 06:56:57] [INFO ] Implicit Places using invariants and state equation in 2327 ms returned []
Implicit Place search using SMT with State Equation took 3175 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 06:56:57] [INFO ] Computed 441 place invariants in 11 ms
[2022-05-20 06:56:58] [INFO ] Dead Transitions using invariants and state equation in 1512 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2681/2681 places, 2401/2401 transitions.
Built C files in :
/tmp/ltsmin9030669980815700191
[2022-05-20 06:56:58] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9030669980815700191
Running compilation step : cd /tmp/ltsmin9030669980815700191;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9030669980815700191;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9030669980815700191;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 06:57:01] [INFO ] Flatten gal took : 51 ms
[2022-05-20 06:57:01] [INFO ] Flatten gal took : 51 ms
[2022-05-20 06:57:01] [INFO ] Time to serialize gal into /tmp/LTL8395334901589800862.gal : 5 ms
[2022-05-20 06:57:01] [INFO ] Time to serialize properties into /tmp/LTL7194409987223816090.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8395334901589800862.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7194409987223816090.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8395334...266
Read 1 LTL properties
Checking formula 0 : !((F(((X("(p544==0)"))&&("(p749==0)"))&&("((p2628==1)&&(p126==0))"))))
Formula 0 simplified : !F("((p2628==1)&&(p126==0))" & "(p749==0)" & X"(p544==0)")
Detected timeout of ITS tools.
[2022-05-20 06:57:16] [INFO ] Flatten gal took : 59 ms
[2022-05-20 06:57:16] [INFO ] Applying decomposition
[2022-05-20 06:57:16] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12300331470874011660.txt' '-o' '/tmp/graph12300331470874011660.bin' '-w' '/tmp/graph12300331470874011660.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12300331470874011660.bin' '-l' '-1' '-v' '-w' '/tmp/graph12300331470874011660.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:57:17] [INFO ] Decomposing Gal with order
[2022-05-20 06:57:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:57:17] [INFO ] Removed a total of 402 redundant transitions.
[2022-05-20 06:57:17] [INFO ] Flatten gal took : 90 ms
[2022-05-20 06:57:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2022-05-20 06:57:17] [INFO ] Time to serialize gal into /tmp/LTL8560937253305803780.gal : 14 ms
[2022-05-20 06:57:17] [INFO ] Time to serialize properties into /tmp/LTL968817125390919122.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8560937253305803780.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL968817125390919122.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8560937...244
Read 1 LTL properties
Checking formula 0 : !((F(((X("(i6.i2.i1.u172.p544==0)"))&&("(i9.u235.p749==0)"))&&("((i33.i2.i2.u814.p2628==1)&&(i2.u45.p126==0))"))))
Formula 0 simplified : !F("((i33.i2.i2.u814.p2628==1)&&(i2.u45.p126==0))" & "(i9.u235.p749==0)" & X"(i6.i2.i1.u172.p544==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12941271373535753377
[2022-05-20 06:57:32] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12941271373535753377
Running compilation step : cd /tmp/ltsmin12941271373535753377;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12941271373535753377;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12941271373535753377;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPt-PT-040B-LTLFireability-06 finished in 259878 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2688/2688 places, 2408/2408 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 562 transitions
Trivial Post-agglo rules discarded 562 transitions
Performed 562 trivial Post agglomeration. Transition count delta: 562
Iterating post reduction 0 with 562 rules applied. Total rules applied 562 place count 2687 transition count 1845
Reduce places removed 562 places and 0 transitions.
Iterating post reduction 1 with 562 rules applied. Total rules applied 1124 place count 2125 transition count 1845
Performed 317 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 317 Pre rules applied. Total rules applied 1124 place count 2125 transition count 1528
Deduced a syphon composed of 317 places in 2 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 2 with 634 rules applied. Total rules applied 1758 place count 1808 transition count 1528
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1762 place count 1804 transition count 1524
Iterating global reduction 2 with 4 rules applied. Total rules applied 1766 place count 1804 transition count 1524
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1766 place count 1804 transition count 1522
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1770 place count 1802 transition count 1522
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 2 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 2 with 1358 rules applied. Total rules applied 3128 place count 1123 transition count 843
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3129 place count 1123 transition count 842
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3131 place count 1122 transition count 841
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3333 place count 1021 transition count 841
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3367 place count 1004 transition count 841
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3369 place count 1002 transition count 839
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3370 place count 1001 transition count 839
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3370 place count 1001 transition count 837
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3374 place count 999 transition count 837
Applied a total of 3374 rules in 388 ms. Remains 999 /2688 variables (removed 1689) and now considering 837/2408 (removed 1571) transitions.
// Phase 1: matrix 837 rows 999 cols
[2022-05-20 06:57:35] [INFO ] Computed 440 place invariants in 2 ms
[2022-05-20 06:57:36] [INFO ] Implicit Places using invariants in 462 ms returned [982, 986]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 465 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 997/2688 places, 837/2408 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 995 transition count 835
Applied a total of 4 rules in 29 ms. Remains 995 /997 variables (removed 2) and now considering 835/837 (removed 2) transitions.
// Phase 1: matrix 835 rows 995 cols
[2022-05-20 06:57:36] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:57:36] [INFO ] Implicit Places using invariants in 455 ms returned []
// Phase 1: matrix 835 rows 995 cols
[2022-05-20 06:57:36] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:57:37] [INFO ] Implicit Places using invariants and state equation in 911 ms returned []
Implicit Place search using SMT with State Equation took 1368 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 995/2688 places, 835/2408 transitions.
Finished structural reductions, in 2 iterations. Remains : 995/2688 places, 835/2408 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s926 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 598 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-07 finished in 2901 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||X(G((F(p2)||p1))))))'
Support contains 4 out of 2688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2688/2688 places, 2408/2408 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2682 transition count 2402
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2682 transition count 2402
Applied a total of 12 rules in 270 ms. Remains 2682 /2688 variables (removed 6) and now considering 2402/2408 (removed 6) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:57:38] [INFO ] Computed 441 place invariants in 13 ms
[2022-05-20 06:57:39] [INFO ] Implicit Places using invariants in 782 ms returned []
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:57:39] [INFO ] Computed 441 place invariants in 12 ms
[2022-05-20 06:57:41] [INFO ] Implicit Places using invariants and state equation in 2489 ms returned []
Implicit Place search using SMT with State Equation took 3271 ms to find 0 implicit places.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:57:41] [INFO ] Computed 441 place invariants in 14 ms
[2022-05-20 06:57:43] [INFO ] Dead Transitions using invariants and state equation in 1476 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2682/2688 places, 2402/2408 transitions.
Finished structural reductions, in 1 iterations. Remains : 2682/2688 places, 2402/2408 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (EQ s1863 1) (EQ s2599 1)), p1:(OR (EQ s316 0) (EQ s2599 1)), p2:(EQ s1498 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 614 ms.
Product exploration explored 100000 steps with 0 reset in 839 ms.
Computed a total of 639 stabilizing places and 639 stable transitions
Computed a total of 639 stabilizing places and 639 stable transitions
Detected a total of 639/2682 stabilizing places and 639/2402 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 217 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:57:45] [INFO ] Computed 441 place invariants in 12 ms
[2022-05-20 06:57:46] [INFO ] [Real]Absence check using 441 positive place invariants in 147 ms returned sat
[2022-05-20 06:57:46] [INFO ] After 524ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 06:57:46] [INFO ] [Nat]Absence check using 441 positive place invariants in 141 ms returned sat
[2022-05-20 06:57:47] [INFO ] After 1206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 06:57:48] [INFO ] Deduced a trap composed of 23 places in 551 ms of which 2 ms to minimize.
[2022-05-20 06:57:49] [INFO ] Deduced a trap composed of 22 places in 553 ms of which 1 ms to minimize.
[2022-05-20 06:57:49] [INFO ] Deduced a trap composed of 38 places in 530 ms of which 1 ms to minimize.
[2022-05-20 06:57:50] [INFO ] Deduced a trap composed of 25 places in 518 ms of which 2 ms to minimize.
[2022-05-20 06:57:50] [INFO ] Deduced a trap composed of 24 places in 514 ms of which 1 ms to minimize.
[2022-05-20 06:57:51] [INFO ] Deduced a trap composed of 16 places in 513 ms of which 1 ms to minimize.
[2022-05-20 06:57:52] [INFO ] Deduced a trap composed of 18 places in 535 ms of which 2 ms to minimize.
[2022-05-20 06:57:52] [INFO ] Deduced a trap composed of 17 places in 528 ms of which 1 ms to minimize.
[2022-05-20 06:57:53] [INFO ] Deduced a trap composed of 27 places in 501 ms of which 1 ms to minimize.
[2022-05-20 06:57:53] [INFO ] Deduced a trap composed of 22 places in 539 ms of which 2 ms to minimize.
[2022-05-20 06:57:54] [INFO ] Deduced a trap composed of 23 places in 531 ms of which 2 ms to minimize.
[2022-05-20 06:57:55] [INFO ] Deduced a trap composed of 18 places in 532 ms of which 1 ms to minimize.
[2022-05-20 06:57:55] [INFO ] Deduced a trap composed of 27 places in 532 ms of which 2 ms to minimize.
[2022-05-20 06:57:56] [INFO ] Deduced a trap composed of 24 places in 504 ms of which 2 ms to minimize.
[2022-05-20 06:57:56] [INFO ] Deduced a trap composed of 23 places in 477 ms of which 1 ms to minimize.
[2022-05-20 06:57:57] [INFO ] Deduced a trap composed of 41 places in 506 ms of which 2 ms to minimize.
[2022-05-20 06:57:58] [INFO ] Deduced a trap composed of 48 places in 490 ms of which 2 ms to minimize.
[2022-05-20 06:57:58] [INFO ] Deduced a trap composed of 29 places in 491 ms of which 2 ms to minimize.
[2022-05-20 06:57:59] [INFO ] Deduced a trap composed of 28 places in 468 ms of which 2 ms to minimize.
[2022-05-20 06:57:59] [INFO ] Deduced a trap composed of 22 places in 476 ms of which 1 ms to minimize.
[2022-05-20 06:58:00] [INFO ] Deduced a trap composed of 34 places in 465 ms of which 1 ms to minimize.
[2022-05-20 06:58:00] [INFO ] Deduced a trap composed of 27 places in 472 ms of which 1 ms to minimize.
[2022-05-20 06:58:01] [INFO ] Deduced a trap composed of 24 places in 444 ms of which 3 ms to minimize.
[2022-05-20 06:58:02] [INFO ] Deduced a trap composed of 19 places in 457 ms of which 1 ms to minimize.
[2022-05-20 06:58:02] [INFO ] Deduced a trap composed of 38 places in 435 ms of which 1 ms to minimize.
[2022-05-20 06:58:03] [INFO ] Deduced a trap composed of 41 places in 431 ms of which 2 ms to minimize.
[2022-05-20 06:58:03] [INFO ] Deduced a trap composed of 45 places in 401 ms of which 1 ms to minimize.
[2022-05-20 06:58:04] [INFO ] Deduced a trap composed of 45 places in 415 ms of which 1 ms to minimize.
[2022-05-20 06:58:04] [INFO ] Deduced a trap composed of 41 places in 380 ms of which 1 ms to minimize.
[2022-05-20 06:58:04] [INFO ] Deduced a trap composed of 38 places in 404 ms of which 1 ms to minimize.
[2022-05-20 06:58:05] [INFO ] Deduced a trap composed of 32 places in 387 ms of which 1 ms to minimize.
[2022-05-20 06:58:05] [INFO ] Deduced a trap composed of 34 places in 376 ms of which 1 ms to minimize.
[2022-05-20 06:58:06] [INFO ] Deduced a trap composed of 29 places in 381 ms of which 1 ms to minimize.
[2022-05-20 06:58:06] [INFO ] Deduced a trap composed of 33 places in 371 ms of which 1 ms to minimize.
[2022-05-20 06:58:07] [INFO ] Deduced a trap composed of 58 places in 332 ms of which 1 ms to minimize.
[2022-05-20 06:58:07] [INFO ] Deduced a trap composed of 49 places in 330 ms of which 1 ms to minimize.
[2022-05-20 06:58:08] [INFO ] Deduced a trap composed of 55 places in 342 ms of which 1 ms to minimize.
[2022-05-20 06:58:08] [INFO ] Deduced a trap composed of 52 places in 352 ms of which 1 ms to minimize.
[2022-05-20 06:58:08] [INFO ] Deduced a trap composed of 37 places in 349 ms of which 0 ms to minimize.
[2022-05-20 06:58:09] [INFO ] Deduced a trap composed of 27 places in 312 ms of which 1 ms to minimize.
[2022-05-20 06:58:09] [INFO ] Deduced a trap composed of 44 places in 330 ms of which 1 ms to minimize.
[2022-05-20 06:58:10] [INFO ] Deduced a trap composed of 44 places in 299 ms of which 1 ms to minimize.
[2022-05-20 06:58:10] [INFO ] Deduced a trap composed of 34 places in 315 ms of which 1 ms to minimize.
[2022-05-20 06:58:10] [INFO ] Deduced a trap composed of 31 places in 313 ms of which 1 ms to minimize.
[2022-05-20 06:58:11] [INFO ] Deduced a trap composed of 37 places in 308 ms of which 1 ms to minimize.
[2022-05-20 06:58:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 06:58:11] [INFO ] After 25182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 100 ms.
Support contains 4 out of 2682 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2682/2682 places, 2402/2402 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2682 transition count 1844
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 2124 transition count 1844
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 1116 place count 2124 transition count 1525
Deduced a syphon composed of 319 places in 3 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1754 place count 1805 transition count 1525
Performed 678 Post agglomeration using F-continuation condition.Transition count delta: 678
Deduced a syphon composed of 678 places in 1 ms
Reduce places removed 678 places and 0 transitions.
Iterating global reduction 2 with 1356 rules applied. Total rules applied 3110 place count 1127 transition count 847
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3111 place count 1127 transition count 846
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3113 place count 1126 transition count 845
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3315 place count 1025 transition count 845
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3349 place count 1008 transition count 845
Partial Free-agglomeration rule applied 119 times.
Drop transitions removed 119 transitions
Iterating global reduction 3 with 119 rules applied. Total rules applied 3468 place count 1008 transition count 845
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3469 place count 1007 transition count 844
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3470 place count 1006 transition count 844
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3470 place count 1006 transition count 842
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3474 place count 1004 transition count 842
Applied a total of 3474 rules in 315 ms. Remains 1004 /2682 variables (removed 1678) and now considering 842/2402 (removed 1560) transitions.
Finished structural reductions, in 1 iterations. Remains : 1004/2682 places, 842/2402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 188845 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188845 steps, saw 157293 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 842 rows 1004 cols
[2022-05-20 06:58:14] [INFO ] Computed 440 place invariants in 2 ms
[2022-05-20 06:58:15] [INFO ] [Real]Absence check using 440 positive place invariants in 60 ms returned sat
[2022-05-20 06:58:15] [INFO ] After 512ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 06:58:15] [INFO ] [Nat]Absence check using 440 positive place invariants in 60 ms returned sat
[2022-05-20 06:58:15] [INFO ] After 354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 06:58:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-20 06:58:16] [INFO ] After 66ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 06:58:16] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2022-05-20 06:58:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-05-20 06:58:16] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 0 ms to minimize.
[2022-05-20 06:58:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2022-05-20 06:58:16] [INFO ] After 394ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 72 ms.
[2022-05-20 06:58:16] [INFO ] After 1016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 ms.
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1004/1004 places, 842/842 transitions.
Applied a total of 0 rules in 16 ms. Remains 1004 /1004 variables (removed 0) and now considering 842/842 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1004/1004 places, 842/842 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1004/1004 places, 842/842 transitions.
Applied a total of 0 rules in 16 ms. Remains 1004 /1004 variables (removed 0) and now considering 842/842 (removed 0) transitions.
// Phase 1: matrix 842 rows 1004 cols
[2022-05-20 06:58:16] [INFO ] Computed 440 place invariants in 2 ms
[2022-05-20 06:58:16] [INFO ] Implicit Places using invariants in 466 ms returned [987, 991]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 467 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1002/1004 places, 842/842 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1000 transition count 840
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1000 transition count 840
Applied a total of 4 rules in 29 ms. Remains 1000 /1002 variables (removed 2) and now considering 840/842 (removed 2) transitions.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:58:17] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:58:17] [INFO ] Implicit Places using invariants in 475 ms returned []
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:58:17] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:58:17] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-20 06:58:18] [INFO ] Implicit Places using invariants and state equation in 1013 ms returned []
Implicit Place search using SMT with State Equation took 1488 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1000/1004 places, 840/842 transitions.
Finished structural reductions, in 2 iterations. Remains : 1000/1004 places, 840/842 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 195103 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 195103 steps, saw 162791 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:58:21] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:58:21] [INFO ] [Real]Absence check using 438 positive place invariants in 59 ms returned sat
[2022-05-20 06:58:21] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 06:58:22] [INFO ] [Nat]Absence check using 438 positive place invariants in 61 ms returned sat
[2022-05-20 06:58:22] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 06:58:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-20 06:58:22] [INFO ] After 74ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 06:58:22] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 70 ms.
[2022-05-20 06:58:22] [INFO ] After 810ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1000/1000 places, 840/840 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 840/840 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1000/1000 places, 840/840 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 840/840 (removed 0) transitions.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:58:22] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:58:23] [INFO ] Implicit Places using invariants in 469 ms returned []
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:58:23] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:58:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-20 06:58:24] [INFO ] Implicit Places using invariants and state equation in 991 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
[2022-05-20 06:58:24] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:58:24] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:58:24] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 840/840 transitions.
Partial Free-agglomeration rule applied 235 times.
Drop transitions removed 235 transitions
Iterating global reduction 0 with 235 rules applied. Total rules applied 235 place count 1000 transition count 840
Applied a total of 235 rules in 37 ms. Remains 1000 /1000 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:58:24] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:58:24] [INFO ] [Real]Absence check using 438 positive place invariants in 60 ms returned sat
[2022-05-20 06:58:24] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 06:58:25] [INFO ] [Nat]Absence check using 438 positive place invariants in 61 ms returned sat
[2022-05-20 06:58:25] [INFO ] After 347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 06:58:25] [INFO ] State equation strengthened by 233 read => feed constraints.
[2022-05-20 06:58:25] [INFO ] After 146ms SMT Verify possible using 233 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 06:58:25] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 1 ms to minimize.
[2022-05-20 06:58:26] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 1 ms to minimize.
[2022-05-20 06:58:26] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 0 ms to minimize.
[2022-05-20 06:58:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 660 ms
[2022-05-20 06:58:26] [INFO ] After 930ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 99 ms.
[2022-05-20 06:58:26] [INFO ] After 1602ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-20 06:58:26] [INFO ] Flatten gal took : 26 ms
[2022-05-20 06:58:26] [INFO ] Flatten gal took : 25 ms
[2022-05-20 06:58:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1854263764448948269.gal : 3 ms
[2022-05-20 06:58:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13497879928848207289.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms9468637156026170912;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1854263764448948269.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13497879928848207289.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality13497879928848207289.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 78
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :78 after 143
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :143 after 186
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :186 after 712
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :712 after 14684
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :14684 after 1.03542e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.03542e+06 after 7.93729e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :7.93729e+07 after 5.37467e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5.37467e+08 after 1.02265e+12
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.02265e+12 after 1.55174e+15
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.55174e+15 after 1.32161e+19
Detected timeout of ITS tools.
[2022-05-20 06:58:41] [INFO ] Flatten gal took : 26 ms
[2022-05-20 06:58:41] [INFO ] Applying decomposition
[2022-05-20 06:58:41] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14885241749303135070.txt' '-o' '/tmp/graph14885241749303135070.bin' '-w' '/tmp/graph14885241749303135070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14885241749303135070.bin' '-l' '-1' '-v' '-w' '/tmp/graph14885241749303135070.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:58:41] [INFO ] Decomposing Gal with order
[2022-05-20 06:58:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:58:41] [INFO ] Removed a total of 203 redundant transitions.
[2022-05-20 06:58:41] [INFO ] Flatten gal took : 37 ms
[2022-05-20 06:58:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 142 labels/synchronizations in 3 ms.
[2022-05-20 06:58:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14260944980281349949.gal : 4 ms
[2022-05-20 06:58:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7017478369255218993.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms9468637156026170912;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14260944980281349949.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7017478369255218993.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality7017478369255218993.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :10080 after 8.57734e+32
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10134580496658244347
[2022-05-20 06:58:56] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10134580496658244347
Running compilation step : cd /tmp/ltsmin10134580496658244347;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1495 ms.
Running link step : cd /tmp/ltsmin10134580496658244347;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10134580496658244347;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) p1))]
Knowledge based reduction with 7 factoid took 437 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 2682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2682/2682 places, 2402/2402 transitions.
Applied a total of 0 rules in 132 ms. Remains 2682 /2682 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:59:12] [INFO ] Computed 441 place invariants in 11 ms
[2022-05-20 06:59:13] [INFO ] Implicit Places using invariants in 886 ms returned []
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:59:13] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-20 06:59:16] [INFO ] Implicit Places using invariants and state equation in 2546 ms returned []
Implicit Place search using SMT with State Equation took 3434 ms to find 0 implicit places.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:59:16] [INFO ] Computed 441 place invariants in 9 ms
[2022-05-20 06:59:17] [INFO ] Dead Transitions using invariants and state equation in 1494 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2682/2682 places, 2402/2402 transitions.
Computed a total of 639 stabilizing places and 639 stable transitions
Computed a total of 639 stabilizing places and 639 stable transitions
Detected a total of 639/2682 stabilizing places and 639/2402 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 219 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:59:18] [INFO ] Computed 441 place invariants in 12 ms
[2022-05-20 06:59:18] [INFO ] [Real]Absence check using 441 positive place invariants in 149 ms returned sat
[2022-05-20 06:59:18] [INFO ] After 475ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 06:59:19] [INFO ] [Nat]Absence check using 441 positive place invariants in 144 ms returned sat
[2022-05-20 06:59:20] [INFO ] After 1245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 06:59:21] [INFO ] Deduced a trap composed of 23 places in 551 ms of which 1 ms to minimize.
[2022-05-20 06:59:21] [INFO ] Deduced a trap composed of 22 places in 546 ms of which 1 ms to minimize.
[2022-05-20 06:59:22] [INFO ] Deduced a trap composed of 38 places in 526 ms of which 2 ms to minimize.
[2022-05-20 06:59:22] [INFO ] Deduced a trap composed of 25 places in 514 ms of which 1 ms to minimize.
[2022-05-20 06:59:23] [INFO ] Deduced a trap composed of 24 places in 516 ms of which 2 ms to minimize.
[2022-05-20 06:59:24] [INFO ] Deduced a trap composed of 16 places in 518 ms of which 2 ms to minimize.
[2022-05-20 06:59:24] [INFO ] Deduced a trap composed of 18 places in 546 ms of which 2 ms to minimize.
[2022-05-20 06:59:25] [INFO ] Deduced a trap composed of 17 places in 570 ms of which 2 ms to minimize.
[2022-05-20 06:59:26] [INFO ] Deduced a trap composed of 27 places in 508 ms of which 2 ms to minimize.
[2022-05-20 06:59:26] [INFO ] Deduced a trap composed of 22 places in 508 ms of which 1 ms to minimize.
[2022-05-20 06:59:27] [INFO ] Deduced a trap composed of 23 places in 489 ms of which 1 ms to minimize.
[2022-05-20 06:59:27] [INFO ] Deduced a trap composed of 18 places in 502 ms of which 1 ms to minimize.
[2022-05-20 06:59:28] [INFO ] Deduced a trap composed of 27 places in 519 ms of which 1 ms to minimize.
[2022-05-20 06:59:28] [INFO ] Deduced a trap composed of 24 places in 513 ms of which 2 ms to minimize.
[2022-05-20 06:59:29] [INFO ] Deduced a trap composed of 23 places in 508 ms of which 1 ms to minimize.
[2022-05-20 06:59:30] [INFO ] Deduced a trap composed of 41 places in 508 ms of which 2 ms to minimize.
[2022-05-20 06:59:30] [INFO ] Deduced a trap composed of 48 places in 490 ms of which 1 ms to minimize.
[2022-05-20 06:59:31] [INFO ] Deduced a trap composed of 29 places in 486 ms of which 1 ms to minimize.
[2022-05-20 06:59:31] [INFO ] Deduced a trap composed of 28 places in 473 ms of which 2 ms to minimize.
[2022-05-20 06:59:32] [INFO ] Deduced a trap composed of 22 places in 489 ms of which 1 ms to minimize.
[2022-05-20 06:59:33] [INFO ] Deduced a trap composed of 34 places in 487 ms of which 1 ms to minimize.
[2022-05-20 06:59:35] [INFO ] Deduced a trap composed of 27 places in 2872 ms of which 2 ms to minimize.
[2022-05-20 06:59:37] [INFO ] Deduced a trap composed of 24 places in 1845 ms of which 1 ms to minimize.
[2022-05-20 06:59:38] [INFO ] Deduced a trap composed of 19 places in 447 ms of which 1 ms to minimize.
[2022-05-20 06:59:38] [INFO ] Deduced a trap composed of 38 places in 437 ms of which 2 ms to minimize.
[2022-05-20 06:59:39] [INFO ] Deduced a trap composed of 41 places in 428 ms of which 1 ms to minimize.
[2022-05-20 06:59:40] [INFO ] Deduced a trap composed of 45 places in 425 ms of which 1 ms to minimize.
[2022-05-20 06:59:40] [INFO ] Deduced a trap composed of 45 places in 416 ms of which 1 ms to minimize.
[2022-05-20 06:59:41] [INFO ] Deduced a trap composed of 41 places in 415 ms of which 2 ms to minimize.
[2022-05-20 06:59:41] [INFO ] Deduced a trap composed of 38 places in 421 ms of which 1 ms to minimize.
[2022-05-20 06:59:42] [INFO ] Deduced a trap composed of 32 places in 397 ms of which 1 ms to minimize.
[2022-05-20 06:59:42] [INFO ] Deduced a trap composed of 34 places in 386 ms of which 1 ms to minimize.
[2022-05-20 06:59:42] [INFO ] Deduced a trap composed of 29 places in 384 ms of which 1 ms to minimize.
[2022-05-20 06:59:43] [INFO ] Deduced a trap composed of 33 places in 368 ms of which 1 ms to minimize.
[2022-05-20 06:59:43] [INFO ] Deduced a trap composed of 58 places in 357 ms of which 1 ms to minimize.
[2022-05-20 06:59:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 06:59:43] [INFO ] After 25134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 98 ms.
Support contains 4 out of 2682 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2682/2682 places, 2402/2402 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2682 transition count 1844
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 2124 transition count 1844
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 1116 place count 2124 transition count 1525
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1754 place count 1805 transition count 1525
Performed 678 Post agglomeration using F-continuation condition.Transition count delta: 678
Deduced a syphon composed of 678 places in 1 ms
Reduce places removed 678 places and 0 transitions.
Iterating global reduction 2 with 1356 rules applied. Total rules applied 3110 place count 1127 transition count 847
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3111 place count 1127 transition count 846
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3113 place count 1126 transition count 845
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3315 place count 1025 transition count 845
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3349 place count 1008 transition count 845
Partial Free-agglomeration rule applied 119 times.
Drop transitions removed 119 transitions
Iterating global reduction 3 with 119 rules applied. Total rules applied 3468 place count 1008 transition count 845
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3469 place count 1007 transition count 844
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3470 place count 1006 transition count 844
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3470 place count 1006 transition count 842
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3474 place count 1004 transition count 842
Applied a total of 3474 rules in 318 ms. Remains 1004 /2682 variables (removed 1678) and now considering 842/2402 (removed 1560) transitions.
Finished structural reductions, in 1 iterations. Remains : 1004/2682 places, 842/2402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 192300 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 192300 steps, saw 160115 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 842 rows 1004 cols
[2022-05-20 06:59:47] [INFO ] Computed 440 place invariants in 2 ms
[2022-05-20 06:59:47] [INFO ] [Real]Absence check using 440 positive place invariants in 67 ms returned sat
[2022-05-20 06:59:48] [INFO ] After 582ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 06:59:48] [INFO ] [Nat]Absence check using 440 positive place invariants in 59 ms returned sat
[2022-05-20 06:59:48] [INFO ] After 342ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 06:59:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-20 06:59:48] [INFO ] After 66ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 06:59:48] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2022-05-20 06:59:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2022-05-20 06:59:48] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 0 ms to minimize.
[2022-05-20 06:59:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2022-05-20 06:59:48] [INFO ] After 384ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 70 ms.
[2022-05-20 06:59:49] [INFO ] After 1014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1004/1004 places, 842/842 transitions.
Applied a total of 0 rules in 16 ms. Remains 1004 /1004 variables (removed 0) and now considering 842/842 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1004/1004 places, 842/842 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1004/1004 places, 842/842 transitions.
Applied a total of 0 rules in 16 ms. Remains 1004 /1004 variables (removed 0) and now considering 842/842 (removed 0) transitions.
// Phase 1: matrix 842 rows 1004 cols
[2022-05-20 06:59:49] [INFO ] Computed 440 place invariants in 2 ms
[2022-05-20 06:59:49] [INFO ] Implicit Places using invariants in 478 ms returned [987, 991]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 479 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1002/1004 places, 842/842 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1000 transition count 840
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1000 transition count 840
Applied a total of 4 rules in 29 ms. Remains 1000 /1002 variables (removed 2) and now considering 840/842 (removed 2) transitions.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:59:49] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:59:50] [INFO ] Implicit Places using invariants in 477 ms returned []
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:59:50] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:59:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-20 06:59:51] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1485 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1000/1004 places, 840/842 transitions.
Finished structural reductions, in 2 iterations. Remains : 1000/1004 places, 840/842 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 188687 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188687 steps, saw 157070 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:59:54] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:59:54] [INFO ] [Real]Absence check using 438 positive place invariants in 58 ms returned sat
[2022-05-20 06:59:54] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 06:59:54] [INFO ] [Nat]Absence check using 438 positive place invariants in 55 ms returned sat
[2022-05-20 06:59:55] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 06:59:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-20 06:59:55] [INFO ] After 62ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 06:59:55] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 68 ms.
[2022-05-20 06:59:55] [INFO ] After 760ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1000/1000 places, 840/840 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 840/840 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1000/1000 places, 840/840 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 840/840 (removed 0) transitions.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:59:55] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:59:55] [INFO ] Implicit Places using invariants in 470 ms returned []
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:59:55] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:59:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-20 06:59:56] [INFO ] Implicit Places using invariants and state equation in 1054 ms returned []
Implicit Place search using SMT with State Equation took 1527 ms to find 0 implicit places.
[2022-05-20 06:59:56] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:59:56] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:59:57] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 840/840 transitions.
Partial Free-agglomeration rule applied 235 times.
Drop transitions removed 235 transitions
Iterating global reduction 0 with 235 rules applied. Total rules applied 235 place count 1000 transition count 840
Applied a total of 235 rules in 41 ms. Remains 1000 /1000 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 06:59:57] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:59:57] [INFO ] [Real]Absence check using 438 positive place invariants in 64 ms returned sat
[2022-05-20 06:59:57] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 06:59:57] [INFO ] [Nat]Absence check using 438 positive place invariants in 63 ms returned sat
[2022-05-20 06:59:58] [INFO ] After 375ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 06:59:58] [INFO ] State equation strengthened by 233 read => feed constraints.
[2022-05-20 06:59:58] [INFO ] After 145ms SMT Verify possible using 233 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 06:59:58] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 0 ms to minimize.
[2022-05-20 06:59:58] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 0 ms to minimize.
[2022-05-20 06:59:58] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 1 ms to minimize.
[2022-05-20 06:59:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 676 ms
[2022-05-20 06:59:59] [INFO ] After 941ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 90 ms.
[2022-05-20 06:59:59] [INFO ] After 1633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-20 06:59:59] [INFO ] Flatten gal took : 26 ms
[2022-05-20 06:59:59] [INFO ] Flatten gal took : 25 ms
[2022-05-20 06:59:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6679469589203058092.gal : 3 ms
[2022-05-20 06:59:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5560216002511855832.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms9021088537714326368;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6679469589203058092.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5560216002511855832.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality5560216002511855832.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 78
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :78 after 143
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :143 after 186
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :186 after 712
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :712 after 14684
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :14684 after 1.03542e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.03542e+06 after 7.93729e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :7.93729e+07 after 5.37467e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5.37467e+08 after 1.02265e+12
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.02265e+12 after 1.55174e+15
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.55174e+15 after 1.32161e+19
Detected timeout of ITS tools.
[2022-05-20 07:00:14] [INFO ] Flatten gal took : 30 ms
[2022-05-20 07:00:14] [INFO ] Applying decomposition
[2022-05-20 07:00:14] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8958991562155011245.txt' '-o' '/tmp/graph8958991562155011245.bin' '-w' '/tmp/graph8958991562155011245.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8958991562155011245.bin' '-l' '-1' '-v' '-w' '/tmp/graph8958991562155011245.weights' '-q' '0' '-e' '0.001'
[2022-05-20 07:00:14] [INFO ] Decomposing Gal with order
[2022-05-20 07:00:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:00:14] [INFO ] Removed a total of 188 redundant transitions.
[2022-05-20 07:00:14] [INFO ] Flatten gal took : 41 ms
[2022-05-20 07:00:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 3 ms.
[2022-05-20 07:00:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12090686851160077716.gal : 5 ms
[2022-05-20 07:00:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3327585067030139308.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms9021088537714326368;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12090686851160077716.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3327585067030139308.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality3327585067030139308.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :7.10382e+08 after 1.9366e+13
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin286219627548023715
[2022-05-20 07:00:29] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin286219627548023715
Running compilation step : cd /tmp/ltsmin286219627548023715;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1641 ms.
Running link step : cd /tmp/ltsmin286219627548023715;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin286219627548023715;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) p1))]
Knowledge based reduction with 7 factoid took 660 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 732 ms.
Product exploration explored 100000 steps with 0 reset in 901 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 2682 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2682/2682 places, 2402/2402 transitions.
Performed 558 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2682 transition count 2402
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 200 Pre rules applied. Total rules applied 558 place count 2682 transition count 2562
Deduced a syphon composed of 758 places in 3 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 758 place count 2682 transition count 2562
Performed 758 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1516 places in 3 ms
Iterating global reduction 1 with 758 rules applied. Total rules applied 1516 place count 2682 transition count 2564
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1517 place count 2682 transition count 2563
Renaming transitions due to excessive name length > 1024 char.
Discarding 281 places :
Symmetric choice reduction at 2 with 281 rule applications. Total rules 1798 place count 2401 transition count 2281
Deduced a syphon composed of 1235 places in 3 ms
Iterating global reduction 2 with 281 rules applied. Total rules applied 2079 place count 2401 transition count 2281
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1236 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2080 place count 2401 transition count 2281
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2082 place count 2399 transition count 2279
Deduced a syphon composed of 1234 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2084 place count 2399 transition count 2279
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 1335 places in 4 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2185 place count 2399 transition count 2709
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2286 place count 2298 transition count 2507
Deduced a syphon composed of 1234 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2387 place count 2298 transition count 2507
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: -238
Deduced a syphon composed of 1290 places in 2 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 2443 place count 2298 transition count 2745
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 2499 place count 2242 transition count 2633
Deduced a syphon composed of 1234 places in 2 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 2555 place count 2242 transition count 2633
Deduced a syphon composed of 1234 places in 3 ms
Applied a total of 2555 rules in 1757 ms. Remains 2242 /2682 variables (removed 440) and now considering 2633/2402 (removed -231) transitions.
[2022-05-20 07:00:49] [INFO ] Redundant transitions in 43 ms returned []
// Phase 1: matrix 2633 rows 2242 cols
[2022-05-20 07:00:49] [INFO ] Computed 441 place invariants in 23 ms
[2022-05-20 07:00:50] [INFO ] Dead Transitions using invariants and state equation in 1294 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2242/2682 places, 2633/2402 transitions.
Finished structural reductions, in 1 iterations. Remains : 2242/2682 places, 2633/2402 transitions.
Product exploration explored 100000 steps with 0 reset in 706 ms.
Product exploration explored 100000 steps with 0 reset in 866 ms.
Built C files in :
/tmp/ltsmin4640845302024147523
[2022-05-20 07:00:52] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4640845302024147523
Running compilation step : cd /tmp/ltsmin4640845302024147523;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin4640845302024147523;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin4640845302024147523;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 2682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2682/2682 places, 2402/2402 transitions.
Applied a total of 0 rules in 196 ms. Remains 2682 /2682 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 07:00:55] [INFO ] Computed 441 place invariants in 11 ms
[2022-05-20 07:00:56] [INFO ] Implicit Places using invariants in 967 ms returned []
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 07:00:56] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-20 07:00:58] [INFO ] Implicit Places using invariants and state equation in 2368 ms returned []
Implicit Place search using SMT with State Equation took 3345 ms to find 0 implicit places.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 07:00:58] [INFO ] Computed 441 place invariants in 4 ms
[2022-05-20 07:01:00] [INFO ] Dead Transitions using invariants and state equation in 1365 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2682/2682 places, 2402/2402 transitions.
Built C files in :
/tmp/ltsmin5383096521784811735
[2022-05-20 07:01:00] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5383096521784811735
Running compilation step : cd /tmp/ltsmin5383096521784811735;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin5383096521784811735;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin5383096521784811735;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 07:01:03] [INFO ] Flatten gal took : 49 ms
[2022-05-20 07:01:03] [INFO ] Flatten gal took : 50 ms
[2022-05-20 07:01:03] [INFO ] Time to serialize gal into /tmp/LTL3151860058201551036.gal : 5 ms
[2022-05-20 07:01:03] [INFO ] Time to serialize properties into /tmp/LTL4401191089433500520.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3151860058201551036.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4401191089433500520.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3151860...266
Read 1 LTL properties
Checking formula 0 : !((F((X("((p2161==1)&&(p3021==1))"))||(X(G(((F("(p1740==0)"))||("(p360==0)"))||("(p3021==1)")))))))
Formula 0 simplified : !F(X"((p2161==1)&&(p3021==1))" | XG("(p360==0)" | "(p3021==1)" | F"(p1740==0)"))
Detected timeout of ITS tools.
[2022-05-20 07:01:18] [INFO ] Flatten gal took : 50 ms
[2022-05-20 07:01:18] [INFO ] Applying decomposition
[2022-05-20 07:01:18] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3344549519919960573.txt' '-o' '/tmp/graph3344549519919960573.bin' '-w' '/tmp/graph3344549519919960573.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3344549519919960573.bin' '-l' '-1' '-v' '-w' '/tmp/graph3344549519919960573.weights' '-q' '0' '-e' '0.001'
[2022-05-20 07:01:18] [INFO ] Decomposing Gal with order
[2022-05-20 07:01:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:01:18] [INFO ] Removed a total of 397 redundant transitions.
[2022-05-20 07:01:18] [INFO ] Flatten gal took : 90 ms
[2022-05-20 07:01:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-20 07:01:18] [INFO ] Time to serialize gal into /tmp/LTL1347571119513241155.gal : 13 ms
[2022-05-20 07:01:19] [INFO ] Time to serialize properties into /tmp/LTL3447098129703571820.ltl : 580 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1347571119513241155.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3447098129703571820.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1347571...245
Read 1 LTL properties
Checking formula 0 : !((F((X("((i27.i2.i1.u665.p2161==1)&&(i38.u926.p3021==1))"))||(X(G(((F("(i22.i2.i0.u537.p1740==0)"))||("(i4.u118.p360==0)"))||("(i38.u...176
Formula 0 simplified : !F(X"((i27.i2.i1.u665.p2161==1)&&(i38.u926.p3021==1))" | XG("(i4.u118.p360==0)" | "(i38.u926.p3021==1)" | F"(i22.i2.i0.u537.p1740==0...159
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13647211026225493832
[2022-05-20 07:01:34] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13647211026225493832
Running compilation step : cd /tmp/ltsmin13647211026225493832;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin13647211026225493832;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin13647211026225493832;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPt-PT-040B-LTLFireability-08 finished in 239174 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(F(p0) U p1)||X(F(G(p2)))))'
Support contains 3 out of 2688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2688/2688 places, 2408/2408 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 562 transitions
Trivial Post-agglo rules discarded 562 transitions
Performed 562 trivial Post agglomeration. Transition count delta: 562
Iterating post reduction 0 with 562 rules applied. Total rules applied 562 place count 2687 transition count 1845
Reduce places removed 562 places and 0 transitions.
Iterating post reduction 1 with 562 rules applied. Total rules applied 1124 place count 2125 transition count 1845
Performed 317 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 317 Pre rules applied. Total rules applied 1124 place count 2125 transition count 1528
Deduced a syphon composed of 317 places in 2 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 2 with 634 rules applied. Total rules applied 1758 place count 1808 transition count 1528
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1761 place count 1805 transition count 1525
Iterating global reduction 2 with 3 rules applied. Total rules applied 1764 place count 1805 transition count 1525
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1764 place count 1805 transition count 1524
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1766 place count 1804 transition count 1524
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 0 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 2 with 1358 rules applied. Total rules applied 3124 place count 1125 transition count 845
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3125 place count 1125 transition count 844
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3127 place count 1124 transition count 843
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3329 place count 1023 transition count 843
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3363 place count 1006 transition count 843
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3365 place count 1004 transition count 841
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3366 place count 1003 transition count 841
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3366 place count 1003 transition count 839
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3370 place count 1001 transition count 839
Applied a total of 3370 rules in 452 ms. Remains 1001 /2688 variables (removed 1687) and now considering 839/2408 (removed 1569) transitions.
// Phase 1: matrix 839 rows 1001 cols
[2022-05-20 07:01:38] [INFO ] Computed 440 place invariants in 4 ms
[2022-05-20 07:01:38] [INFO ] Implicit Places using invariants in 500 ms returned [984, 988]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 502 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 999/2688 places, 839/2408 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 997 transition count 837
Applied a total of 4 rules in 34 ms. Remains 997 /999 variables (removed 2) and now considering 837/839 (removed 2) transitions.
// Phase 1: matrix 837 rows 997 cols
[2022-05-20 07:01:38] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 07:01:39] [INFO ] Implicit Places using invariants in 475 ms returned []
// Phase 1: matrix 837 rows 997 cols
[2022-05-20 07:01:39] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 07:01:39] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1432 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 997/2688 places, 837/2408 transitions.
Finished structural reductions, in 2 iterations. Remains : 997/2688 places, 837/2408 transitions.
Stuttering acceptance computed with spot in 2109 ms :[(AND p1 (NOT p2)), (NOT p2), (AND p0 p1 (NOT p2)), (AND (NOT p2) p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s806 1), p1:(OR (EQ s806 1) (EQ s50 1)), p2:(EQ s577 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 608 ms.
Stack based approach found an accepted trace after 892 steps with 0 reset with depth 893 and stack size 847 in 7 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-09 finished in 5172 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(p0)))))'
Support contains 1 out of 2688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2688/2688 places, 2408/2408 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2682 transition count 2402
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2682 transition count 2402
Applied a total of 12 rules in 320 ms. Remains 2682 /2688 variables (removed 6) and now considering 2402/2408 (removed 6) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 07:01:43] [INFO ] Computed 441 place invariants in 12 ms
[2022-05-20 07:01:43] [INFO ] Implicit Places using invariants in 806 ms returned []
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 07:01:43] [INFO ] Computed 441 place invariants in 7 ms
[2022-05-20 07:01:46] [INFO ] Implicit Places using invariants and state equation in 2392 ms returned []
Implicit Place search using SMT with State Equation took 3199 ms to find 0 implicit places.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 07:01:46] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-20 07:01:47] [INFO ] Dead Transitions using invariants and state equation in 1483 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2682/2688 places, 2402/2408 transitions.
Finished structural reductions, in 1 iterations. Remains : 2682/2688 places, 2402/2408 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s421 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-10 finished in 5198 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X(p0)))||F((X(p2)||p1))))))'
Support contains 5 out of 2688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2688/2688 places, 2408/2408 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2681 transition count 2401
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2681 transition count 2401
Applied a total of 14 rules in 324 ms. Remains 2681 /2688 variables (removed 7) and now considering 2401/2408 (removed 7) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 07:01:48] [INFO ] Computed 441 place invariants in 10 ms
[2022-05-20 07:01:49] [INFO ] Implicit Places using invariants in 887 ms returned []
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 07:01:49] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-20 07:01:51] [INFO ] Implicit Places using invariants and state equation in 2493 ms returned []
Implicit Place search using SMT with State Equation took 3381 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 07:01:51] [INFO ] Computed 441 place invariants in 12 ms
[2022-05-20 07:01:53] [INFO ] Dead Transitions using invariants and state equation in 1466 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2681/2688 places, 2401/2408 transitions.
Finished structural reductions, in 1 iterations. Remains : 2681/2688 places, 2401/2408 transitions.
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (EQ s205 1) (EQ s231 1)) (EQ s905 1)), p2:(EQ s439 1), p0:(EQ s1298 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16636 reset in 811 ms.
Product exploration explored 100000 steps with 16664 reset in 759 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2681 stabilizing places and 638/2401 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 302 ms. Reduced automaton from 6 states, 7 edges and 3 AP to 6 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Finished random walk after 518 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 728 ms. Reduced automaton from 6 states, 7 edges and 3 AP to 6 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 2681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Applied a total of 0 rules in 154 ms. Remains 2681 /2681 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 07:01:56] [INFO ] Computed 441 place invariants in 13 ms
[2022-05-20 07:01:57] [INFO ] Implicit Places using invariants in 878 ms returned []
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 07:01:57] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-20 07:02:00] [INFO ] Implicit Places using invariants and state equation in 2429 ms returned []
Implicit Place search using SMT with State Equation took 3311 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 07:02:00] [INFO ] Computed 441 place invariants in 11 ms
[2022-05-20 07:02:01] [INFO ] Dead Transitions using invariants and state equation in 1359 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2681/2681 places, 2401/2401 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2681 stabilizing places and 638/2401 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 292 ms. Reduced automaton from 6 states, 7 edges and 3 AP to 6 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Finished random walk after 619 steps, including 0 resets, run visited all 3 properties in 25 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 360 ms. Reduced automaton from 6 states, 7 edges and 3 AP to 6 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 16615 reset in 697 ms.
Product exploration explored 100000 steps with 16647 reset in 728 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 2681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Performed 559 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2681 transition count 2401
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 199 Pre rules applied. Total rules applied 559 place count 2681 transition count 2560
Deduced a syphon composed of 758 places in 3 ms
Iterating global reduction 1 with 199 rules applied. Total rules applied 758 place count 2681 transition count 2560
Performed 754 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1512 places in 4 ms
Iterating global reduction 1 with 754 rules applied. Total rules applied 1512 place count 2681 transition count 2560
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1513 place count 2681 transition count 2559
Renaming transitions due to excessive name length > 1024 char.
Discarding 280 places :
Symmetric choice reduction at 2 with 280 rule applications. Total rules 1793 place count 2401 transition count 2279
Deduced a syphon composed of 1232 places in 3 ms
Iterating global reduction 2 with 280 rules applied. Total rules applied 2073 place count 2401 transition count 2279
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1233 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2074 place count 2401 transition count 2279
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2076 place count 2399 transition count 2277
Deduced a syphon composed of 1231 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2078 place count 2399 transition count 2277
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -428
Deduced a syphon composed of 1332 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2179 place count 2399 transition count 2705
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2280 place count 2298 transition count 2503
Deduced a syphon composed of 1231 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2381 place count 2298 transition count 2503
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -245
Deduced a syphon composed of 1289 places in 3 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2439 place count 2298 transition count 2748
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 2497 place count 2240 transition count 2632
Deduced a syphon composed of 1231 places in 2 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2555 place count 2240 transition count 2632
Deduced a syphon composed of 1231 places in 2 ms
Applied a total of 2555 rules in 922 ms. Remains 2240 /2681 variables (removed 441) and now considering 2632/2401 (removed -231) transitions.
[2022-05-20 07:02:05] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 2632 rows 2240 cols
[2022-05-20 07:02:05] [INFO ] Computed 441 place invariants in 24 ms
[2022-05-20 07:02:07] [INFO ] Dead Transitions using invariants and state equation in 1293 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2240/2681 places, 2632/2401 transitions.
Finished structural reductions, in 1 iterations. Remains : 2240/2681 places, 2632/2401 transitions.
Product exploration explored 100000 steps with 16644 reset in 3088 ms.
Product exploration explored 100000 steps with 16705 reset in 3126 ms.
Built C files in :
/tmp/ltsmin7491690543161085892
[2022-05-20 07:02:13] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7491690543161085892
Running compilation step : cd /tmp/ltsmin7491690543161085892;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin7491690543161085892;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin7491690543161085892;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 2681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Applied a total of 0 rules in 157 ms. Remains 2681 /2681 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 07:02:16] [INFO ] Computed 441 place invariants in 12 ms
[2022-05-20 07:02:17] [INFO ] Implicit Places using invariants in 855 ms returned []
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 07:02:17] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-20 07:02:19] [INFO ] Implicit Places using invariants and state equation in 2406 ms returned []
Implicit Place search using SMT with State Equation took 3262 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 07:02:19] [INFO ] Computed 441 place invariants in 11 ms
[2022-05-20 07:02:21] [INFO ] Dead Transitions using invariants and state equation in 1458 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2681/2681 places, 2401/2401 transitions.
Built C files in :
/tmp/ltsmin1977163946436714361
[2022-05-20 07:02:21] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1977163946436714361
Running compilation step : cd /tmp/ltsmin1977163946436714361;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin1977163946436714361;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin1977163946436714361;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 07:02:24] [INFO ] Flatten gal took : 84 ms
[2022-05-20 07:02:24] [INFO ] Flatten gal took : 52 ms
[2022-05-20 07:02:24] [INFO ] Time to serialize gal into /tmp/LTL10124271261893943486.gal : 6 ms
[2022-05-20 07:02:24] [INFO ] Time to serialize properties into /tmp/LTL14997428063280363886.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10124271261893943486.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14997428063280363886.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1012427...268
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(X("(p1507==0)"))))||(F(((X("(p505==1)"))||("((p227==1)&&(p260==1))"))||("(p1048==1)")))))))
Formula 0 simplified : !XG(XXX"(p1507==0)" | F("((p227==1)&&(p260==1))" | "(p1048==1)" | X"(p505==1)"))
Detected timeout of ITS tools.
[2022-05-20 07:02:39] [INFO ] Flatten gal took : 48 ms
[2022-05-20 07:02:39] [INFO ] Applying decomposition
[2022-05-20 07:02:39] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7948140764299168702.txt' '-o' '/tmp/graph7948140764299168702.bin' '-w' '/tmp/graph7948140764299168702.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7948140764299168702.bin' '-l' '-1' '-v' '-w' '/tmp/graph7948140764299168702.weights' '-q' '0' '-e' '0.001'
[2022-05-20 07:02:39] [INFO ] Decomposing Gal with order
[2022-05-20 07:02:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:02:40] [INFO ] Removed a total of 400 redundant transitions.
[2022-05-20 07:02:40] [INFO ] Flatten gal took : 87 ms
[2022-05-20 07:02:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-20 07:02:40] [INFO ] Time to serialize gal into /tmp/LTL6215187595249171863.gal : 12 ms
[2022-05-20 07:02:40] [INFO ] Time to serialize properties into /tmp/LTL12919629389370984136.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6215187595249171863.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12919629389370984136.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6215187...246
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(X("(i20.u460.p1507==0)"))))||(F(((X("(i7.u157.p505==1)"))||("((i3.u72.p227==1)&&(i3.u81.p260==1))"))||("(i14.u320.p1048==1...164
Formula 0 simplified : !XG(XXX"(i20.u460.p1507==0)" | F("((i3.u72.p227==1)&&(i3.u81.p260==1))" | "(i14.u320.p1048==1)" | X"(i7.u157.p505==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7610108455146867619
[2022-05-20 07:02:55] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7610108455146867619
Running compilation step : cd /tmp/ltsmin7610108455146867619;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin7610108455146867619;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin7610108455146867619;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPt-PT-040B-LTLFireability-11 finished in 70372 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0)) U (X(G(X(p1))) U X(p2))))'
Support contains 3 out of 2688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2688/2688 places, 2408/2408 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2681 transition count 2401
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2681 transition count 2401
Applied a total of 14 rules in 336 ms. Remains 2681 /2688 variables (removed 7) and now considering 2401/2408 (removed 7) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 07:02:58] [INFO ] Computed 441 place invariants in 11 ms
[2022-05-20 07:02:59] [INFO ] Implicit Places using invariants in 777 ms returned []
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 07:02:59] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-20 07:03:01] [INFO ] Implicit Places using invariants and state equation in 2279 ms returned []
Implicit Place search using SMT with State Equation took 3058 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 07:03:01] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-20 07:03:03] [INFO ] Dead Transitions using invariants and state equation in 1365 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2681/2688 places, 2401/2408 transitions.
Finished structural reductions, in 1 iterations. Remains : 2681/2688 places, 2401/2408 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND p2 p0 p1), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s2274 1), p0:(NEQ s2552 1), p1:(EQ s2174 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-14 finished in 5055 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(p0 U p1)||p2)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Found a CL insensitive property : ShieldPPPt-PT-040B-LTLFireability-06
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 2688 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2688/2688 places, 2408/2408 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 561 rules applied. Total rules applied 561 place count 2687 transition count 1846
Reduce places removed 561 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 562 rules applied. Total rules applied 1123 place count 2126 transition count 1845
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1124 place count 2125 transition count 1845
Performed 316 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 316 Pre rules applied. Total rules applied 1124 place count 2125 transition count 1529
Deduced a syphon composed of 316 places in 2 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 3 with 632 rules applied. Total rules applied 1756 place count 1809 transition count 1529
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1760 place count 1805 transition count 1525
Iterating global reduction 3 with 4 rules applied. Total rules applied 1764 place count 1805 transition count 1525
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1764 place count 1805 transition count 1523
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1768 place count 1803 transition count 1523
Performed 675 Post agglomeration using F-continuation condition.Transition count delta: 675
Deduced a syphon composed of 675 places in 1 ms
Reduce places removed 675 places and 0 transitions.
Iterating global reduction 3 with 1350 rules applied. Total rules applied 3118 place count 1128 transition count 848
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3119 place count 1128 transition count 847
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3121 place count 1127 transition count 846
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3323 place count 1026 transition count 846
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3357 place count 1009 transition count 846
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3359 place count 1007 transition count 844
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3360 place count 1006 transition count 844
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3360 place count 1006 transition count 842
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3364 place count 1004 transition count 842
Applied a total of 3364 rules in 405 ms. Remains 1004 /2688 variables (removed 1684) and now considering 842/2408 (removed 1566) transitions.
// Phase 1: matrix 842 rows 1004 cols
[2022-05-20 07:03:03] [INFO ] Computed 440 place invariants in 2 ms
[2022-05-20 07:03:04] [INFO ] Implicit Places using invariants in 460 ms returned [987, 991]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 463 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1002/2688 places, 842/2408 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1000 transition count 840
Applied a total of 4 rules in 33 ms. Remains 1000 /1002 variables (removed 2) and now considering 840/842 (removed 2) transitions.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 07:03:04] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 07:03:04] [INFO ] Implicit Places using invariants in 495 ms returned []
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 07:03:04] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 07:03:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 07:03:05] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 1000/2688 places, 840/2408 transitions.
Finished structural reductions, in 2 iterations. Remains : 1000/2688 places, 840/2408 transitions.
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s234 0) (EQ s852 1) (EQ s28 0)), p1:(EQ s174 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3 reset in 572 ms.
Stack based approach found an accepted trace after 27 steps with 4 reset with depth 3 and stack size 3 in 1 ms.
Treatment of property ShieldPPPt-PT-040B-LTLFireability-06 finished in 3060 ms.
CL/SL decision was in the wrong direction : CL + false
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||X(G((F(p2)||p1))))))'
Found a CL insensitive property : ShieldPPPt-PT-040B-LTLFireability-08
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 2688 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2688/2688 places, 2408/2408 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 2687 transition count 1847
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 2127 transition count 1847
Performed 316 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 316 Pre rules applied. Total rules applied 1120 place count 2127 transition count 1531
Deduced a syphon composed of 316 places in 2 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 2 with 632 rules applied. Total rules applied 1752 place count 1811 transition count 1531
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1755 place count 1808 transition count 1528
Iterating global reduction 2 with 3 rules applied. Total rules applied 1758 place count 1808 transition count 1528
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1758 place count 1808 transition count 1526
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1762 place count 1806 transition count 1526
Performed 678 Post agglomeration using F-continuation condition.Transition count delta: 678
Deduced a syphon composed of 678 places in 0 ms
Reduce places removed 678 places and 0 transitions.
Iterating global reduction 2 with 1356 rules applied. Total rules applied 3118 place count 1128 transition count 848
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3119 place count 1128 transition count 847
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3121 place count 1127 transition count 846
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3323 place count 1026 transition count 846
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3357 place count 1009 transition count 846
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3359 place count 1007 transition count 844
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3360 place count 1006 transition count 844
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3360 place count 1006 transition count 842
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3364 place count 1004 transition count 842
Applied a total of 3364 rules in 424 ms. Remains 1004 /2688 variables (removed 1684) and now considering 842/2408 (removed 1566) transitions.
// Phase 1: matrix 842 rows 1004 cols
[2022-05-20 07:03:07] [INFO ] Computed 440 place invariants in 3 ms
[2022-05-20 07:03:07] [INFO ] Implicit Places using invariants in 528 ms returned [987, 991]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 539 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1002/2688 places, 842/2408 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1000 transition count 840
Applied a total of 4 rules in 36 ms. Remains 1000 /1002 variables (removed 2) and now considering 840/842 (removed 2) transitions.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 07:03:07] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 07:03:08] [INFO ] Implicit Places using invariants in 479 ms returned []
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 07:03:08] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 07:03:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-20 07:03:09] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1483 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 1000/2688 places, 840/2408 transitions.
Finished structural reductions, in 2 iterations. Remains : 1000/2688 places, 840/2408 transitions.
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (EQ s700 1) (EQ s979 1)), p1:(OR (EQ s103 0) (EQ s979 1)), p2:(EQ s554 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 593 ms.
Product exploration explored 100000 steps with 0 reset in 776 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/1000 stabilizing places and 4/840 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
Knowledge based reduction with 6 factoid took 260 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 537 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 07:03:11] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 07:03:11] [INFO ] [Real]Absence check using 438 positive place invariants in 59 ms returned sat
[2022-05-20 07:03:11] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 07:03:12] [INFO ] [Nat]Absence check using 438 positive place invariants in 59 ms returned sat
[2022-05-20 07:03:12] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 07:03:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-20 07:03:12] [INFO ] After 67ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 07:03:12] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 66 ms.
[2022-05-20 07:03:12] [INFO ] After 791ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 18 ms.
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1000/1000 places, 840/840 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1000 transition count 839
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 999 transition count 839
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 998 transition count 839
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 998 transition count 839
Applied a total of 7 rules in 53 ms. Remains 998 /1000 variables (removed 2) and now considering 839/840 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 998/1000 places, 839/840 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 251008 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 251008 steps, saw 185741 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 07:03:15] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 07:03:15] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:03:16] [INFO ] [Nat]Absence check using 438 positive place invariants in 58 ms returned sat
[2022-05-20 07:03:16] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:03:16] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-20 07:03:16] [INFO ] After 32ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 07:03:16] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-20 07:03:16] [INFO ] After 603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 998 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 998/998 places, 839/839 transitions.
Applied a total of 0 rules in 17 ms. Remains 998 /998 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 839/839 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 998/998 places, 839/839 transitions.
Applied a total of 0 rules in 17 ms. Remains 998 /998 variables (removed 0) and now considering 839/839 (removed 0) transitions.
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 07:03:16] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 07:03:17] [INFO ] Implicit Places using invariants in 468 ms returned []
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 07:03:17] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 07:03:17] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-20 07:03:18] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1478 ms to find 0 implicit places.
[2022-05-20 07:03:18] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 07:03:18] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 07:03:18] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 839/839 transitions.
Partial Free-agglomeration rule applied 237 times.
Drop transitions removed 237 transitions
Iterating global reduction 0 with 237 rules applied. Total rules applied 237 place count 998 transition count 839
Applied a total of 237 rules in 43 ms. Remains 998 /998 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 07:03:18] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 07:03:18] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:03:18] [INFO ] [Nat]Absence check using 438 positive place invariants in 63 ms returned sat
[2022-05-20 07:03:19] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:03:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 07:03:19] [INFO ] After 35ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 07:03:19] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-20 07:03:19] [INFO ] After 646ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 07:03:19] [INFO ] Flatten gal took : 24 ms
[2022-05-20 07:03:19] [INFO ] Flatten gal took : 23 ms
[2022-05-20 07:03:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10539635480440513870.gal : 6 ms
[2022-05-20 07:03:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10236811324527536304.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4507352115430121171;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10539635480440513870.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10236811324527536304.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality10236811324527536304.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 75
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :75 after 140
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :140 after 235
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :235 after 1970
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1970 after 33878
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :33878 after 5.76016e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.76016e+06 after 1.25262e+14
Detected timeout of ITS tools.
[2022-05-20 07:03:34] [INFO ] Flatten gal took : 24 ms
[2022-05-20 07:03:34] [INFO ] Applying decomposition
[2022-05-20 07:03:34] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9117756702247998742.txt' '-o' '/tmp/graph9117756702247998742.bin' '-w' '/tmp/graph9117756702247998742.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9117756702247998742.bin' '-l' '-1' '-v' '-w' '/tmp/graph9117756702247998742.weights' '-q' '0' '-e' '0.001'
[2022-05-20 07:03:34] [INFO ] Decomposing Gal with order
[2022-05-20 07:03:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:03:34] [INFO ] Removed a total of 122 redundant transitions.
[2022-05-20 07:03:34] [INFO ] Flatten gal took : 56 ms
[2022-05-20 07:03:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 5 ms.
[2022-05-20 07:03:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4990480244361485497.gal : 7 ms
[2022-05-20 07:03:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13303127493503578597.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4507352115430121171;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4990480244361485497.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13303127493503578597.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality13303127493503578597.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3 after 153984
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5758511101453502255
[2022-05-20 07:03:49] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5758511101453502255
Running compilation step : cd /tmp/ltsmin5758511101453502255;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1403 ms.
Running link step : cd /tmp/ltsmin5758511101453502255;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin5758511101453502255;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf1==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F p0), (F (AND (NOT p0) (NOT p2) p1))]
Knowledge based reduction with 6 factoid took 347 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 840/840 transitions.
Applied a total of 0 rules in 14 ms. Remains 1000 /1000 variables (removed 0) and now considering 840/840 (removed 0) transitions.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 07:04:05] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 07:04:05] [INFO ] Implicit Places using invariants in 465 ms returned []
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 07:04:05] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 07:04:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-20 07:04:06] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1437 ms to find 0 implicit places.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 07:04:06] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 07:04:07] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 840/840 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/1000 stabilizing places and 4/840 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
Knowledge based reduction with 6 factoid took 211 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 07:04:07] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 07:04:08] [INFO ] [Real]Absence check using 438 positive place invariants in 63 ms returned sat
[2022-05-20 07:04:08] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 07:04:08] [INFO ] [Nat]Absence check using 438 positive place invariants in 62 ms returned sat
[2022-05-20 07:04:08] [INFO ] After 363ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 07:04:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-20 07:04:08] [INFO ] After 74ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 07:04:08] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 66 ms.
[2022-05-20 07:04:08] [INFO ] After 840ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 17 ms.
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1000/1000 places, 840/840 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1000 transition count 839
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 999 transition count 839
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 998 transition count 839
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 998 transition count 839
Applied a total of 7 rules in 69 ms. Remains 998 /1000 variables (removed 2) and now considering 839/840 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 998/1000 places, 839/840 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 241618 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 241618 steps, saw 178606 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 07:04:12] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 07:04:12] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:04:12] [INFO ] [Nat]Absence check using 438 positive place invariants in 64 ms returned sat
[2022-05-20 07:04:12] [INFO ] After 323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:04:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-20 07:04:12] [INFO ] After 34ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 07:04:12] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-20 07:04:12] [INFO ] After 647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 998 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 998/998 places, 839/839 transitions.
Applied a total of 0 rules in 18 ms. Remains 998 /998 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 839/839 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 998/998 places, 839/839 transitions.
Applied a total of 0 rules in 18 ms. Remains 998 /998 variables (removed 0) and now considering 839/839 (removed 0) transitions.
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 07:04:12] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 07:04:13] [INFO ] Implicit Places using invariants in 498 ms returned []
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 07:04:13] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 07:04:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-20 07:04:14] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 1531 ms to find 0 implicit places.
[2022-05-20 07:04:14] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 07:04:14] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 07:04:14] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 839/839 transitions.
Partial Free-agglomeration rule applied 237 times.
Drop transitions removed 237 transitions
Iterating global reduction 0 with 237 rules applied. Total rules applied 237 place count 998 transition count 839
Applied a total of 237 rules in 43 ms. Remains 998 /998 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 839 rows 998 cols
[2022-05-20 07:04:14] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 07:04:15] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:04:15] [INFO ] [Nat]Absence check using 438 positive place invariants in 61 ms returned sat
[2022-05-20 07:04:15] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:04:15] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 07:04:15] [INFO ] After 34ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 07:04:15] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-05-20 07:04:15] [INFO ] After 649ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 07:04:15] [INFO ] Flatten gal took : 24 ms
[2022-05-20 07:04:15] [INFO ] Flatten gal took : 24 ms
[2022-05-20 07:04:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11731938197226499421.gal : 3 ms
[2022-05-20 07:04:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15421028019235433094.prop : 230 ms
Invoking ITS tools like this :cd /tmp/redAtoms15854903013319611114;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11731938197226499421.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15421028019235433094.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality15421028019235433094.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 75
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :75 after 140
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :140 after 235
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :235 after 1970
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1970 after 33878
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :33878 after 5.76016e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.76016e+06 after 1.25262e+14
Detected timeout of ITS tools.
[2022-05-20 07:04:30] [INFO ] Flatten gal took : 21 ms
[2022-05-20 07:04:30] [INFO ] Applying decomposition
[2022-05-20 07:04:31] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10918306951486907353.txt' '-o' '/tmp/graph10918306951486907353.bin' '-w' '/tmp/graph10918306951486907353.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10918306951486907353.bin' '-l' '-1' '-v' '-w' '/tmp/graph10918306951486907353.weights' '-q' '0' '-e' '0.001'
[2022-05-20 07:04:31] [INFO ] Decomposing Gal with order
[2022-05-20 07:04:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:04:31] [INFO ] Removed a total of 119 redundant transitions.
[2022-05-20 07:04:31] [INFO ] Flatten gal took : 32 ms
[2022-05-20 07:04:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 4 ms.
[2022-05-20 07:04:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7228244860056903293.gal : 765 ms
[2022-05-20 07:04:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11762319678076051247.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms15854903013319611114;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7228244860056903293.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11762319678076051247.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality11762319678076051247.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3 after 3
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8454164685635163048
[2022-05-20 07:04:46] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8454164685635163048
Running compilation step : cd /tmp/ltsmin8454164685635163048;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1348 ms.
Running link step : cd /tmp/ltsmin8454164685635163048;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8454164685635163048;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf1==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F p0), (F (AND (NOT p0) (NOT p2) p1))]
Knowledge based reduction with 6 factoid took 286 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 516 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 615 ms.
Product exploration explored 100000 steps with 0 reset in 777 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 840/840 transitions.
Applied a total of 0 rules in 24 ms. Remains 1000 /1000 variables (removed 0) and now considering 840/840 (removed 0) transitions.
[2022-05-20 07:05:04] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 07:05:04] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 07:05:05] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 840/840 transitions.
Product exploration explored 100000 steps with 0 reset in 598 ms.
Product exploration explored 100000 steps with 0 reset in 839 ms.
Built C files in :
/tmp/ltsmin6347448520360615212
[2022-05-20 07:05:06] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6347448520360615212
Running compilation step : cd /tmp/ltsmin6347448520360615212;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2834 ms.
Running link step : cd /tmp/ltsmin6347448520360615212;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6347448520360615212;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8121713640644985240.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 840/840 transitions.
Applied a total of 0 rules in 21 ms. Remains 1000 /1000 variables (removed 0) and now considering 840/840 (removed 0) transitions.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 07:05:21] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 07:05:22] [INFO ] Implicit Places using invariants in 471 ms returned []
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 07:05:22] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 07:05:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-20 07:05:23] [INFO ] Implicit Places using invariants and state equation in 1052 ms returned []
Implicit Place search using SMT with State Equation took 1525 ms to find 0 implicit places.
// Phase 1: matrix 840 rows 1000 cols
[2022-05-20 07:05:23] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 07:05:23] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 840/840 transitions.
Built C files in :
/tmp/ltsmin4863976837435507996
[2022-05-20 07:05:23] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4863976837435507996
Running compilation step : cd /tmp/ltsmin4863976837435507996;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1966 ms.
Running link step : cd /tmp/ltsmin4863976837435507996;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4863976837435507996;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2388980458952122424.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 07:05:38] [INFO ] Flatten gal took : 21 ms
[2022-05-20 07:05:38] [INFO ] Flatten gal took : 21 ms
[2022-05-20 07:05:38] [INFO ] Time to serialize gal into /tmp/LTL6383163538444202529.gal : 2 ms
[2022-05-20 07:05:38] [INFO ] Time to serialize properties into /tmp/LTL1687134698053619899.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6383163538444202529.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1687134698053619899.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6383163...266
Read 1 LTL properties
Checking formula 0 : !((F((X("((p2161==1)&&(p3021==1))"))||(X(G(((F("(p1740==0)"))||("(p360==0)"))||("(p3021==1)")))))))
Formula 0 simplified : !F(X"((p2161==1)&&(p3021==1))" | XG("(p360==0)" | "(p3021==1)" | F"(p1740==0)"))
Detected timeout of ITS tools.
[2022-05-20 07:05:53] [INFO ] Flatten gal took : 21 ms
[2022-05-20 07:05:53] [INFO ] Applying decomposition
[2022-05-20 07:05:53] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17937706518534258312.txt' '-o' '/tmp/graph17937706518534258312.bin' '-w' '/tmp/graph17937706518534258312.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17937706518534258312.bin' '-l' '-1' '-v' '-w' '/tmp/graph17937706518534258312.weights' '-q' '0' '-e' '0.001'
[2022-05-20 07:05:53] [INFO ] Decomposing Gal with order
[2022-05-20 07:05:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:05:53] [INFO ] Removed a total of 246 redundant transitions.
[2022-05-20 07:05:53] [INFO ] Flatten gal took : 35 ms
[2022-05-20 07:05:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 238 labels/synchronizations in 3 ms.
[2022-05-20 07:05:54] [INFO ] Time to serialize gal into /tmp/LTL11502298795518051612.gal : 4 ms
[2022-05-20 07:05:54] [INFO ] Time to serialize properties into /tmp/LTL14911944086082528152.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11502298795518051612.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14911944086082528152.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1150229...247
Read 1 LTL properties
Checking formula 0 : !((F((X("((i27.u225.p2161==1)&&(i38.i0.i0.u315.p3021==1))"))||(X(G(((F("(i22.u178.p1740==0)"))||("(i4.u34.p360==0)"))||("(i38.i0.i0.u3...175
Formula 0 simplified : !F(X"((i27.u225.p2161==1)&&(i38.i0.i0.u315.p3021==1))" | XG("(i4.u34.p360==0)" | "(i38.i0.i0.u315.p3021==1)" | F"(i22.u178.p1740==0)...158
Reverse transition relation is NOT exact ! Due to transitions i0.t2, i0.t1, i0.t0, i0.u1.t643, i1.t5, i1.t4, i1.t3, i1.u10.t648, i2.t8, i2.t7, i2.t6, i2.u1...1075
Computing Next relation with stutter on 6.79862e+65 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin487903285895018815
[2022-05-20 07:06:09] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin487903285895018815
Running compilation step : cd /tmp/ltsmin487903285895018815;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1369 ms.
Running link step : cd /tmp/ltsmin487903285895018815;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin487903285895018815;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp0==true))||X([]((<>((LTLAPp2==true))||(LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-040B-LTLFireability-08 finished in 197655 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X(p0)))||F((X(p2)||p1))))))'
Found a SL insensitive property : ShieldPPPt-PT-040B-LTLFireability-11
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 2688 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2688/2688 places, 2408/2408 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 561 rules applied. Total rules applied 561 place count 2687 transition count 1846
Reduce places removed 561 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 562 rules applied. Total rules applied 1123 place count 2126 transition count 1845
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1124 place count 2125 transition count 1845
Performed 316 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 316 Pre rules applied. Total rules applied 1124 place count 2125 transition count 1529
Deduced a syphon composed of 316 places in 1 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 3 with 632 rules applied. Total rules applied 1756 place count 1809 transition count 1529
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1760 place count 1805 transition count 1525
Iterating global reduction 3 with 4 rules applied. Total rules applied 1764 place count 1805 transition count 1525
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1764 place count 1805 transition count 1523
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1768 place count 1803 transition count 1523
Performed 673 Post agglomeration using F-continuation condition.Transition count delta: 673
Deduced a syphon composed of 673 places in 1 ms
Reduce places removed 673 places and 0 transitions.
Iterating global reduction 3 with 1346 rules applied. Total rules applied 3114 place count 1130 transition count 850
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3115 place count 1130 transition count 849
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3117 place count 1129 transition count 848
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3319 place count 1028 transition count 848
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3355 place count 1010 transition count 848
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3357 place count 1008 transition count 846
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3358 place count 1007 transition count 846
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3358 place count 1007 transition count 844
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3362 place count 1005 transition count 844
Applied a total of 3362 rules in 438 ms. Remains 1005 /2688 variables (removed 1683) and now considering 844/2408 (removed 1564) transitions.
// Phase 1: matrix 844 rows 1005 cols
[2022-05-20 07:06:24] [INFO ] Computed 440 place invariants in 3 ms
[2022-05-20 07:06:25] [INFO ] Implicit Places using invariants in 469 ms returned [988, 992]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 470 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1003/2688 places, 844/2408 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1001 transition count 842
Applied a total of 4 rules in 33 ms. Remains 1001 /1003 variables (removed 2) and now considering 842/844 (removed 2) transitions.
// Phase 1: matrix 842 rows 1001 cols
[2022-05-20 07:06:25] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 07:06:25] [INFO ] Implicit Places using invariants in 510 ms returned []
// Phase 1: matrix 842 rows 1001 cols
[2022-05-20 07:06:25] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 07:06:26] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-20 07:06:27] [INFO ] Implicit Places using invariants and state equation in 1430 ms returned []
Implicit Place search using SMT with State Equation took 1942 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 1001/2688 places, 842/2408 transitions.
Finished structural reductions, in 2 iterations. Remains : 1001/2688 places, 842/2408 transitions.
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (EQ s69 1) (EQ s77 1)) (EQ s332 1)), p2:(EQ s155 1), p0:(EQ s484 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10 reset in 679 ms.
Stack based approach found an accepted trace after 555 steps with 25 reset with depth 356 and stack size 356 in 5 ms.
Treatment of property ShieldPPPt-PT-040B-LTLFireability-11 finished in 3894 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-11 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-20 07:06:28] [INFO ] Flatten gal took : 52 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3684473986650657972
[2022-05-20 07:06:28] [INFO ] Too many transitions (2408) to apply POR reductions. Disabling POR matrices.
[2022-05-20 07:06:28] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3684473986650657972
Running compilation step : cd /tmp/ltsmin3684473986650657972;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 07:06:28] [INFO ] Applying decomposition
[2022-05-20 07:06:28] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5367206499521005805.txt' '-o' '/tmp/graph5367206499521005805.bin' '-w' '/tmp/graph5367206499521005805.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5367206499521005805.bin' '-l' '-1' '-v' '-w' '/tmp/graph5367206499521005805.weights' '-q' '0' '-e' '0.001'
[2022-05-20 07:06:28] [INFO ] Decomposing Gal with order
[2022-05-20 07:06:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:06:28] [INFO ] Removed a total of 390 redundant transitions.
[2022-05-20 07:06:28] [INFO ] Flatten gal took : 97 ms
[2022-05-20 07:06:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-20 07:06:28] [INFO ] Time to serialize gal into /tmp/LTLFireability2599667062469956093.gal : 13 ms
[2022-05-20 07:06:28] [INFO ] Time to serialize properties into /tmp/LTLFireability12513415226329916815.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2599667062469956093.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12513415226329916815.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 3 LTL properties
Checking formula 0 : !((G((!(("(i30.i1.i3.u745.p2409==1)")U("((i25.i2.i1.u595.p1927==1)&&(i26.i1.i1.u615.p1986==1))")))||("(i9.u215.p685==0)"))))
Formula 0 simplified : !G("(i9.u215.p685==0)" | !("(i30.i1.i3.u745.p2409==1)" U "((i25.i2.i1.u595.p1927==1)&&(i26.i1.i1.u615.p1986==1))"))
Compilation finished in 4977 ms.
Running link step : cd /tmp/ltsmin3684473986650657972;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin3684473986650657972;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((!((LTLAPp0==true) U (LTLAPp1==true))||(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin3684473986650657972;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((!((LTLAPp0==true) U (LTLAPp1==true))||(LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3684473986650657972;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp4==true))&&(LTLAPp3==true)))' '--buchi-type=spotba'
LTSmin run took 12352 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin3684473986650657972;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp5==true))||X([]((<>((LTLAPp7==true))||(LTLAPp6==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 07:33:39] [INFO ] Applying decomposition
[2022-05-20 07:33:39] [INFO ] Flatten gal took : 559 ms
[2022-05-20 07:33:40] [INFO ] Decomposing Gal with order
[2022-05-20 07:33:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:33:46] [INFO ] Removed a total of 118 redundant transitions.
[2022-05-20 07:33:47] [INFO ] Flatten gal took : 4988 ms
[2022-05-20 07:33:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 472 labels/synchronizations in 464 ms.
[2022-05-20 07:33:48] [INFO ] Time to serialize gal into /tmp/LTLFireability7920244491324849695.gal : 43 ms
[2022-05-20 07:33:48] [INFO ] Time to serialize properties into /tmp/LTLFireability3692763266162926953.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7920244491324849695.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3692763266162926953.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 2 LTL properties
Checking formula 0 : !((G((!(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u690.p2409==1)")U("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u562.p1927==...377
Formula 0 simplified : !G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i1.u996.p685==0)" |...370
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: LTL layer: formula: <>((X((LTLAPp5==true))||X([]((<>((LTLAPp7==true))||(LTLAPp6==true))))))
pins2lts-mc-linux64( 4/ 8), 0.012: "<>((X((LTLAPp5==true))||X([]((<>((LTLAPp7==true))||(LTLAPp6==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.013: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.136: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.160: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.196: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.198: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.200: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.202: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.504: There are 2420 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.504: State length is 2689, there are 2415 groups
pins2lts-mc-linux64( 0/ 8), 1.504: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.504: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.504: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 1.504: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 2.014: [Blue] ~120 levels ~960 states ~13552 transitions
pins2lts-mc-linux64( 0/ 8), 2.270: [Blue] ~240 levels ~1920 states ~16440 transitions
pins2lts-mc-linux64( 3/ 8), 3.001: [Blue] ~480 levels ~3840 states ~34992 transitions
pins2lts-mc-linux64( 2/ 8), 4.257: [Blue] ~960 levels ~7680 states ~173928 transitions
pins2lts-mc-linux64( 2/ 8), 6.460: [Blue] ~1920 levels ~15360 states ~302880 transitions
pins2lts-mc-linux64( 1/ 8), 9.749: [Blue] ~3840 levels ~30720 states ~341440 transitions
pins2lts-mc-linux64( 1/ 8), 15.863: [Blue] ~7653 levels ~61440 states ~467984 transitions
pins2lts-mc-linux64( 3/ 8), 30.831: [Blue] ~15306 levels ~122880 states ~642712 transitions
pins2lts-mc-linux64( 3/ 8), 59.137: [Blue] ~30495 levels ~245760 states ~1264464 transitions
pins2lts-mc-linux64( 6/ 8), 296.394: [Blue] ~1203 levels ~491520 states ~3176056 transitions
pins2lts-mc-linux64( 6/ 8), 499.944: [Blue] ~1203 levels ~983040 states ~6489776 transitions
pins2lts-mc-linux64( 6/ 8), 700.717: [Blue] ~61897 levels ~1966080 states ~12959080 transitions
pins2lts-mc-linux64( 2/ 8), 1075.555: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1075.709:
pins2lts-mc-linux64( 0/ 8), 1075.709: Explored 3581637 states 21340376 transitions, fanout: 5.958
pins2lts-mc-linux64( 0/ 8), 1075.710: Total exploration time 1074.190 sec (1074.060 sec minimum, 1074.124 sec on average)
pins2lts-mc-linux64( 0/ 8), 1075.710: States per second: 3334, Transitions per second: 19866
pins2lts-mc-linux64( 0/ 8), 1075.710:
pins2lts-mc-linux64( 0/ 8), 1075.710: State space has 10262566 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1075.710: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1075.710: blue states: 3581637 (34.90%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1075.710: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1075.710: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1075.710:
pins2lts-mc-linux64( 0/ 8), 1075.710: Total memory used for local state coloring: 43.3MB
pins2lts-mc-linux64( 0/ 8), 1075.710:
pins2lts-mc-linux64( 0/ 8), 1075.710: Queue width: 8B, total height: 2836915, memory: 21.64MB
pins2lts-mc-linux64( 0/ 8), 1075.710: Tree memory: 334.3MB, 34.2 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 1075.710: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1075.712: Stored 2500 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1075.727: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1075.727: Est. total memory use: 355.9MB (~1045.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3684473986650657972;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp5==true))||X([]((<>((LTLAPp7==true))||(LTLAPp6==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3684473986650657972;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp5==true))||X([]((<>((LTLAPp7==true))||(LTLAPp6==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-040B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-040B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025600668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-040B.tgz
mv ShieldPPPt-PT-040B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;