About the Execution of ITS-Tools for ShieldIIPt-PT-040B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16221.191 | 3600000.00 | 7613192.00 | 157899.20 | FFFFFFTT?FTF?FFT | normal |
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-165286025000315.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 ShieldIIPt-PT-040B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025000315
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 932K
-rw-r--r-- 1 mcc users 6.0K Apr 29 18:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 29 18:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 29 18:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 29 18:28 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:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:51 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 686K 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 ShieldIIPt-PT-040B-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652963113700
Running Version 202205111006
[2022-05-19 12:25:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-19 12:25:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 12:25:15] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2022-05-19 12:25:15] [INFO ] Transformed 2803 places.
[2022-05-19 12:25:15] [INFO ] Transformed 2603 transitions.
[2022-05-19 12:25:15] [INFO ] Found NUPN structural information;
[2022-05-19 12:25:15] [INFO ] Parsed PT model containing 2803 places and 2603 transitions in 367 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 2803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Discarding 433 places :
Symmetric choice reduction at 0 with 433 rule applications. Total rules 433 place count 2370 transition count 2170
Iterating global reduction 0 with 433 rules applied. Total rules applied 866 place count 2370 transition count 2170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 867 place count 2369 transition count 2169
Iterating global reduction 0 with 1 rules applied. Total rules applied 868 place count 2369 transition count 2169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 869 place count 2368 transition count 2168
Iterating global reduction 0 with 1 rules applied. Total rules applied 870 place count 2368 transition count 2168
Applied a total of 870 rules in 1193 ms. Remains 2368 /2803 variables (removed 435) and now considering 2168/2603 (removed 435) transitions.
// Phase 1: matrix 2168 rows 2368 cols
[2022-05-19 12:25:16] [INFO ] Computed 361 place invariants in 38 ms
[2022-05-19 12:25:17] [INFO ] Implicit Places using invariants in 931 ms returned []
// Phase 1: matrix 2168 rows 2368 cols
[2022-05-19 12:25:17] [INFO ] Computed 361 place invariants in 12 ms
[2022-05-19 12:25:19] [INFO ] Implicit Places using invariants and state equation in 2066 ms returned []
Implicit Place search using SMT with State Equation took 3026 ms to find 0 implicit places.
// Phase 1: matrix 2168 rows 2368 cols
[2022-05-19 12:25:19] [INFO ] Computed 361 place invariants in 16 ms
[2022-05-19 12:25:20] [INFO ] Dead Transitions using invariants and state equation in 1283 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2368/2803 places, 2168/2603 transitions.
Finished structural reductions, in 1 iterations. Remains : 2368/2803 places, 2168/2603 transitions.
Support contains 39 out of 2368 places after structural reductions.
[2022-05-19 12:25:21] [INFO ] Flatten gal took : 165 ms
[2022-05-19 12:25:21] [INFO ] Flatten gal took : 102 ms
[2022-05-19 12:25:21] [INFO ] Input system was already deterministic with 2168 transitions.
Support contains 37 out of 2368 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 619 ms. (steps per millisecond=16 ) properties (out of 19) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2168 rows 2368 cols
[2022-05-19 12:25:22] [INFO ] Computed 361 place invariants in 12 ms
[2022-05-19 12:25:23] [INFO ] After 579ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-19 12:25:23] [INFO ] [Nat]Absence check using 361 positive place invariants in 125 ms returned sat
[2022-05-19 12:25:25] [INFO ] After 1540ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2022-05-19 12:25:26] [INFO ] Deduced a trap composed of 28 places in 534 ms of which 6 ms to minimize.
[2022-05-19 12:25:26] [INFO ] Deduced a trap composed of 26 places in 520 ms of which 2 ms to minimize.
[2022-05-19 12:25:27] [INFO ] Deduced a trap composed of 16 places in 555 ms of which 4 ms to minimize.
[2022-05-19 12:25:28] [INFO ] Deduced a trap composed of 21 places in 539 ms of which 2 ms to minimize.
[2022-05-19 12:25:28] [INFO ] Deduced a trap composed of 22 places in 504 ms of which 3 ms to minimize.
[2022-05-19 12:25:29] [INFO ] Deduced a trap composed of 29 places in 485 ms of which 1 ms to minimize.
[2022-05-19 12:25:29] [INFO ] Deduced a trap composed of 27 places in 494 ms of which 2 ms to minimize.
[2022-05-19 12:25:30] [INFO ] Deduced a trap composed of 23 places in 470 ms of which 1 ms to minimize.
[2022-05-19 12:25:30] [INFO ] Deduced a trap composed of 23 places in 490 ms of which 1 ms to minimize.
[2022-05-19 12:25:31] [INFO ] Deduced a trap composed of 39 places in 507 ms of which 1 ms to minimize.
[2022-05-19 12:25:32] [INFO ] Deduced a trap composed of 19 places in 462 ms of which 1 ms to minimize.
[2022-05-19 12:25:32] [INFO ] Deduced a trap composed of 16 places in 476 ms of which 1 ms to minimize.
[2022-05-19 12:25:33] [INFO ] Deduced a trap composed of 33 places in 480 ms of which 1 ms to minimize.
[2022-05-19 12:25:33] [INFO ] Deduced a trap composed of 33 places in 444 ms of which 2 ms to minimize.
[2022-05-19 12:25:34] [INFO ] Deduced a trap composed of 42 places in 463 ms of which 1 ms to minimize.
[2022-05-19 12:25:34] [INFO ] Deduced a trap composed of 35 places in 473 ms of which 1 ms to minimize.
[2022-05-19 12:25:35] [INFO ] Deduced a trap composed of 36 places in 445 ms of which 2 ms to minimize.
[2022-05-19 12:25:35] [INFO ] Deduced a trap composed of 30 places in 425 ms of which 1 ms to minimize.
[2022-05-19 12:25:36] [INFO ] Deduced a trap composed of 33 places in 460 ms of which 1 ms to minimize.
[2022-05-19 12:25:36] [INFO ] Deduced a trap composed of 31 places in 443 ms of which 1 ms to minimize.
[2022-05-19 12:25:37] [INFO ] Deduced a trap composed of 41 places in 463 ms of which 2 ms to minimize.
[2022-05-19 12:25:37] [INFO ] Deduced a trap composed of 33 places in 428 ms of which 2 ms to minimize.
[2022-05-19 12:25:38] [INFO ] Deduced a trap composed of 38 places in 400 ms of which 2 ms to minimize.
[2022-05-19 12:25:38] [INFO ] Deduced a trap composed of 38 places in 406 ms of which 1 ms to minimize.
[2022-05-19 12:25:39] [INFO ] Deduced a trap composed of 40 places in 413 ms of which 1 ms to minimize.
[2022-05-19 12:25:39] [INFO ] Deduced a trap composed of 38 places in 407 ms of which 1 ms to minimize.
[2022-05-19 12:25:40] [INFO ] Deduced a trap composed of 35 places in 383 ms of which 1 ms to minimize.
[2022-05-19 12:25:40] [INFO ] Deduced a trap composed of 39 places in 367 ms of which 1 ms to minimize.
[2022-05-19 12:25:41] [INFO ] Deduced a trap composed of 30 places in 362 ms of which 1 ms to minimize.
[2022-05-19 12:25:41] [INFO ] Deduced a trap composed of 32 places in 389 ms of which 2 ms to minimize.
[2022-05-19 12:25:42] [INFO ] Deduced a trap composed of 39 places in 351 ms of which 1 ms to minimize.
[2022-05-19 12:25:42] [INFO ] Deduced a trap composed of 41 places in 343 ms of which 1 ms to minimize.
[2022-05-19 12:25:42] [INFO ] Deduced a trap composed of 41 places in 361 ms of which 1 ms to minimize.
[2022-05-19 12:25:43] [INFO ] Deduced a trap composed of 40 places in 352 ms of which 1 ms to minimize.
[2022-05-19 12:25:43] [INFO ] Deduced a trap composed of 33 places in 327 ms of which 1 ms to minimize.
[2022-05-19 12:25:44] [INFO ] Deduced a trap composed of 48 places in 327 ms of which 0 ms to minimize.
[2022-05-19 12:25:44] [INFO ] Deduced a trap composed of 48 places in 322 ms of which 1 ms to minimize.
[2022-05-19 12:25:45] [INFO ] Deduced a trap composed of 46 places in 303 ms of which 1 ms to minimize.
[2022-05-19 12:25:45] [INFO ] Deduced a trap composed of 40 places in 312 ms of which 2 ms to minimize.
[2022-05-19 12:25:45] [INFO ] Deduced a trap composed of 37 places in 332 ms of which 2 ms to minimize.
[2022-05-19 12:25:46] [INFO ] Deduced a trap composed of 54 places in 297 ms of which 0 ms to minimize.
[2022-05-19 12:25:46] [INFO ] Deduced a trap composed of 48 places in 299 ms of which 0 ms to minimize.
[2022-05-19 12:25:46] [INFO ] Deduced a trap composed of 54 places in 302 ms of which 1 ms to minimize.
[2022-05-19 12:25:47] [INFO ] Deduced a trap composed of 61 places in 273 ms of which 1 ms to minimize.
[2022-05-19 12:25:47] [INFO ] Deduced a trap composed of 51 places in 273 ms of which 1 ms to minimize.
[2022-05-19 12:25:47] [INFO ] Deduced a trap composed of 51 places in 261 ms of which 1 ms to minimize.
[2022-05-19 12:25:48] [INFO ] Deduced a trap composed of 53 places in 263 ms of which 1 ms to minimize.
[2022-05-19 12:25:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 12:25:48] [INFO ] After 25208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 481 ms.
Support contains 14 out of 2368 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Drop transitions removed 474 transitions
Trivial Post-agglo rules discarded 474 transitions
Performed 474 trivial Post agglomeration. Transition count delta: 474
Iterating post reduction 0 with 474 rules applied. Total rules applied 474 place count 2368 transition count 1694
Reduce places removed 474 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 475 rules applied. Total rules applied 949 place count 1894 transition count 1693
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 950 place count 1893 transition count 1693
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 314 Pre rules applied. Total rules applied 950 place count 1893 transition count 1379
Deduced a syphon composed of 314 places in 3 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 3 with 628 rules applied. Total rules applied 1578 place count 1579 transition count 1379
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1580 place count 1577 transition count 1377
Iterating global reduction 3 with 2 rules applied. Total rules applied 1582 place count 1577 transition count 1377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1582 place count 1577 transition count 1376
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1584 place count 1576 transition count 1376
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 3 with 1358 rules applied. Total rules applied 2942 place count 897 transition count 697
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2943 place count 897 transition count 696
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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2945 place count 896 transition count 695
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3147 place count 795 transition count 759
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 3177 place count 780 transition count 770
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3178 place count 780 transition count 769
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3179 place count 780 transition count 768
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3180 place count 779 transition count 768
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 6 with 40 rules applied. Total rules applied 3220 place count 779 transition count 768
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3221 place count 778 transition count 767
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3223 place count 776 transition count 767
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3223 place count 776 transition count 766
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3225 place count 775 transition count 766
Applied a total of 3225 rules in 539 ms. Remains 775 /2368 variables (removed 1593) and now considering 766/2168 (removed 1402) transitions.
Finished structural reductions, in 1 iterations. Remains : 775/2368 places, 766/2168 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) 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 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 766 rows 775 cols
[2022-05-19 12:25:50] [INFO ] Computed 359 place invariants in 2 ms
[2022-05-19 12:25:50] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-19 12:25:50] [INFO ] [Nat]Absence check using 359 positive place invariants in 52 ms returned sat
[2022-05-19 12:25:50] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 12:25:50] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-19 12:25:51] [INFO ] After 176ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-19 12:25:51] [INFO ] After 462ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 171 ms.
[2022-05-19 12:25:51] [INFO ] After 1320ms 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 62 ms.
Support contains 12 out of 775 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 775/775 places, 766/766 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 774 transition count 765
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 773 transition count 764
Applied a total of 3 rules in 80 ms. Remains 773 /775 variables (removed 2) and now considering 764/766 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 773/775 places, 764/766 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) 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 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
Interrupted probabilistic random walk after 109896 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109896 steps, saw 70109 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 764 rows 773 cols
[2022-05-19 12:25:55] [INFO ] Computed 359 place invariants in 2 ms
[2022-05-19 12:25:55] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-19 12:25:55] [INFO ] [Nat]Absence check using 359 positive place invariants in 46 ms returned sat
[2022-05-19 12:25:56] [INFO ] After 398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 12:25:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-19 12:25:56] [INFO ] After 183ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-19 12:25:56] [INFO ] After 461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 167 ms.
[2022-05-19 12:25:56] [INFO ] After 1291ms 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 37 ms.
Support contains 12 out of 773 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 773/773 places, 764/764 transitions.
Applied a total of 0 rules in 14 ms. Remains 773 /773 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 773/773 places, 764/764 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 773/773 places, 764/764 transitions.
Applied a total of 0 rules in 15 ms. Remains 773 /773 variables (removed 0) and now considering 764/764 (removed 0) transitions.
// Phase 1: matrix 764 rows 773 cols
[2022-05-19 12:25:57] [INFO ] Computed 359 place invariants in 2 ms
[2022-05-19 12:25:57] [INFO ] Implicit Places using invariants in 366 ms returned [762]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 370 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 772/773 places, 764/764 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 771 transition count 763
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 771 transition count 763
Applied a total of 2 rules in 30 ms. Remains 771 /772 variables (removed 1) and now considering 763/764 (removed 1) transitions.
// Phase 1: matrix 763 rows 771 cols
[2022-05-19 12:25:57] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:25:57] [INFO ] Implicit Places using invariants in 391 ms returned []
// Phase 1: matrix 763 rows 771 cols
[2022-05-19 12:25:57] [INFO ] Computed 358 place invariants in 6 ms
[2022-05-19 12:25:58] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-19 12:25:58] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 1228 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 771/773 places, 763/764 transitions.
Finished structural reductions, in 2 iterations. Remains : 771/773 places, 763/764 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 121361 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121361 steps, saw 78181 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 763 rows 771 cols
[2022-05-19 12:26:02] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:26:02] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-19 12:26:02] [INFO ] [Nat]Absence check using 358 positive place invariants in 45 ms returned sat
[2022-05-19 12:26:03] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 12:26:03] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-19 12:26:03] [INFO ] After 200ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-19 12:26:03] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2022-05-19 12:26:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2022-05-19 12:26:03] [INFO ] After 559ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 179 ms.
[2022-05-19 12:26:03] [INFO ] After 1415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 197 ms.
Support contains 12 out of 771 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 771/771 places, 763/763 transitions.
Applied a total of 0 rules in 13 ms. Remains 771 /771 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 763/763 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 771/771 places, 763/763 transitions.
Applied a total of 0 rules in 12 ms. Remains 771 /771 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 771 cols
[2022-05-19 12:26:04] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:26:04] [INFO ] Implicit Places using invariants in 361 ms returned []
// Phase 1: matrix 763 rows 771 cols
[2022-05-19 12:26:04] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:26:04] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-19 12:26:05] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1220 ms to find 0 implicit places.
[2022-05-19 12:26:05] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 763 rows 771 cols
[2022-05-19 12:26:05] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:26:05] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 763/763 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 771 transition count 763
Applied a total of 80 rules in 25 ms. Remains 771 /771 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 763 rows 771 cols
[2022-05-19 12:26:05] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:26:05] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-19 12:26:06] [INFO ] [Nat]Absence check using 358 positive place invariants in 49 ms returned sat
[2022-05-19 12:26:06] [INFO ] After 408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 12:26:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-19 12:26:06] [INFO ] After 291ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-19 12:26:07] [INFO ] After 657ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 283 ms.
[2022-05-19 12:26:07] [INFO ] After 1607ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2022-05-19 12:26:07] [INFO ] Flatten gal took : 43 ms
[2022-05-19 12:26:07] [INFO ] Flatten gal took : 39 ms
[2022-05-19 12:26:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4987103264489309780.gal : 22 ms
[2022-05-19 12:26:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1774942435304154086.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11297095264313434309;'/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/ReachabilityCardinality4987103264489309780.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1774942435304154086.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/ReachabilityCardinality1774942435304154086.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :6 after 18
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :18 after 612
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :612 after 942
Reachability property AtomicPropp18 is true.
Reachability property AtomicPropp6 is true.
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :942 after 1209
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1209 after 1444
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1444 after 6218
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :6218 after 74872
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :74872 after 1.09858e+07
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.09858e+07 after 8.18808e+07
Reachability property AtomicPropp14 is true.
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :8.18808e+07 after 3.82375e+11
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :3.82375e+11 after 4.42386e+13
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :4.42386e+13 after 4.22376e+16
Reachability property AtomicPropp9 is true.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4.22376e+16 after 3.76087e+19
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.76087e+19 after 2.91373e+22
Reachability property AtomicPropp4 is true.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.91373e+22 after 8.59713e+27
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :8.59713e+27 after 1.23938e+31
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.23938e+31 after 5.07923e+36
Detected timeout of ITS tools.
[2022-05-19 12:26:22] [INFO ] Flatten gal took : 47 ms
[2022-05-19 12:26:22] [INFO ] Applying decomposition
[2022-05-19 12:26:22] [INFO ] Flatten gal took : 29 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/graph14912222409678249708.txt' '-o' '/tmp/graph14912222409678249708.bin' '-w' '/tmp/graph14912222409678249708.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14912222409678249708.bin' '-l' '-1' '-v' '-w' '/tmp/graph14912222409678249708.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:26:23] [INFO ] Decomposing Gal with order
[2022-05-19 12:26:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:26:23] [INFO ] Removed a total of 431 redundant transitions.
[2022-05-19 12:26:23] [INFO ] Flatten gal took : 233 ms
[2022-05-19 12:26:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 24 ms.
[2022-05-19 12:26:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16272588617419559318.gal : 15 ms
[2022-05-19 12:26:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10620846289866369181.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms11297095264313434309;'/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/ReachabilityCardinality16272588617419559318.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10620846289866369181.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...300
Loading property file /tmp/ReachabilityCardinality10620846289866369181.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
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3 after 3
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3 after 18
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :552960 after 1.20827e+26
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5732865284318726079
[2022-05-19 12:26:38] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5732865284318726079
Running compilation step : cd /tmp/ltsmin5732865284318726079;'/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 1389 ms.
Running link step : cd /tmp/ltsmin5732865284318726079;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin5732865284318726079;'/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' 'AtomicPropp12==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 639 stabilizing places and 639 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 2368 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2367 transition count 1690
Reduce places removed 477 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 478 rules applied. Total rules applied 955 place count 1890 transition count 1689
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 956 place count 1889 transition count 1689
Performed 317 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 317 Pre rules applied. Total rules applied 956 place count 1889 transition count 1372
Deduced a syphon composed of 317 places in 2 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 3 with 634 rules applied. Total rules applied 1590 place count 1572 transition count 1372
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1596 place count 1566 transition count 1366
Iterating global reduction 3 with 6 rules applied. Total rules applied 1602 place count 1566 transition count 1366
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1602 place count 1566 transition count 1361
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1612 place count 1561 transition count 1361
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 2964 place count 885 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2965 place count 885 transition count 684
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 2967 place count 884 transition count 683
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 3169 place count 783 transition count 749
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -12
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 3203 place count 766 transition count 761
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3205 place count 764 transition count 759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3207 place count 762 transition count 759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3207 place count 762 transition count 758
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3209 place count 761 transition count 758
Applied a total of 3209 rules in 438 ms. Remains 761 /2368 variables (removed 1607) and now considering 758/2168 (removed 1410) transitions.
// Phase 1: matrix 758 rows 761 cols
[2022-05-19 12:26:54] [INFO ] Computed 359 place invariants in 5 ms
[2022-05-19 12:26:54] [INFO ] Implicit Places using invariants in 419 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 420 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 760/2368 places, 758/2168 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 759 transition count 757
Applied a total of 2 rules in 25 ms. Remains 759 /760 variables (removed 1) and now considering 757/758 (removed 1) transitions.
// Phase 1: matrix 757 rows 759 cols
[2022-05-19 12:26:54] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:26:55] [INFO ] Implicit Places using invariants in 382 ms returned []
// Phase 1: matrix 757 rows 759 cols
[2022-05-19 12:26:55] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:26:55] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 1088 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 759/2368 places, 757/2168 transitions.
Finished structural reductions, in 2 iterations. Remains : 759/2368 places, 757/2168 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s582 0) (EQ s744 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-00 finished in 2159 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!X(F(p0)) U G((G((X(p1)&&p2))&&G(p0))))))'
Support contains 6 out of 2368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2362 transition count 2162
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2362 transition count 2162
Applied a total of 12 rules in 211 ms. Remains 2362 /2368 variables (removed 6) and now considering 2162/2168 (removed 6) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:26:56] [INFO ] Computed 361 place invariants in 19 ms
[2022-05-19 12:26:56] [INFO ] Implicit Places using invariants in 642 ms returned []
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:26:56] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:26:58] [INFO ] Implicit Places using invariants and state equation in 1939 ms returned []
Implicit Place search using SMT with State Equation took 2583 ms to find 0 implicit places.
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:26:58] [INFO ] Computed 361 place invariants in 12 ms
[2022-05-19 12:26:59] [INFO ] Dead Transitions using invariants and state equation in 1151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2368 places, 2162/2168 transitions.
Finished structural reductions, in 1 iterations. Remains : 2362/2368 places, 2162/2168 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s1562 0) (EQ s1613 1)), p2:(OR (EQ s1723 0) (EQ s33 1)), p1:(OR (EQ s1599 0) (EQ s1484 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19292 steps with 0 reset in 189 ms.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-03 finished in 4329 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(G(X((F(p1)||p0))))))||G(p2)))'
Support contains 6 out of 2368 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 475 transitions
Trivial Post-agglo rules discarded 475 transitions
Performed 475 trivial Post agglomeration. Transition count delta: 475
Iterating post reduction 0 with 475 rules applied. Total rules applied 475 place count 2367 transition count 1692
Reduce places removed 475 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 476 rules applied. Total rules applied 951 place count 1892 transition count 1691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 952 place count 1891 transition count 1691
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 315 Pre rules applied. Total rules applied 952 place count 1891 transition count 1376
Deduced a syphon composed of 315 places in 2 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 3 with 630 rules applied. Total rules applied 1582 place count 1576 transition count 1376
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1588 place count 1570 transition count 1370
Iterating global reduction 3 with 6 rules applied. Total rules applied 1594 place count 1570 transition count 1370
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1594 place count 1570 transition count 1365
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1604 place count 1565 transition count 1365
Performed 674 Post agglomeration using F-continuation condition.Transition count delta: 674
Deduced a syphon composed of 674 places in 1 ms
Reduce places removed 674 places and 0 transitions.
Iterating global reduction 3 with 1348 rules applied. Total rules applied 2952 place count 891 transition count 691
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2953 place count 891 transition count 690
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 2955 place count 890 transition count 689
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
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 3157 place count 789 transition count 756
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
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 3191 place count 772 transition count 767
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3193 place count 770 transition count 765
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3195 place count 768 transition count 765
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3195 place count 768 transition count 764
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3197 place count 767 transition count 764
Applied a total of 3197 rules in 368 ms. Remains 767 /2368 variables (removed 1601) and now considering 764/2168 (removed 1404) transitions.
// Phase 1: matrix 764 rows 767 cols
[2022-05-19 12:27:00] [INFO ] Computed 359 place invariants in 1 ms
[2022-05-19 12:27:01] [INFO ] Implicit Places using invariants in 350 ms returned [755]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 352 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 766/2368 places, 764/2168 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 765 transition count 763
Applied a total of 2 rules in 21 ms. Remains 765 /766 variables (removed 1) and now considering 763/764 (removed 1) transitions.
// Phase 1: matrix 763 rows 765 cols
[2022-05-19 12:27:01] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:27:01] [INFO ] Implicit Places using invariants in 371 ms returned []
// Phase 1: matrix 763 rows 765 cols
[2022-05-19 12:27:01] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:27:01] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-19 12:27:02] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 1219 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 765/2368 places, 763/2168 transitions.
Finished structural reductions, in 2 iterations. Remains : 765/2368 places, 763/2168 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s542 0) (EQ s289 1)), p0:(OR (EQ s170 0) (EQ s71 1)), p1:(OR (EQ s762 0) (EQ s519 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 607 ms.
Product exploration explored 100000 steps with 0 reset in 844 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 8 factoid took 378 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 763 rows 765 cols
[2022-05-19 12:27:04] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:27:04] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:27:04] [INFO ] [Nat]Absence check using 358 positive place invariants in 46 ms returned sat
[2022-05-19 12:27:05] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:27:05] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-19 12:27:05] [INFO ] After 33ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:27:05] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-05-19 12:27:05] [INFO ] After 528ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 765 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 765/765 places, 763/763 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 765 transition count 762
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 764 transition count 762
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 763 transition count 761
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 762 transition count 762
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 762 transition count 762
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 761 transition count 761
Applied a total of 9 rules in 58 ms. Remains 761 /765 variables (removed 4) and now considering 761/763 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 761/765 places, 761/763 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 262320 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 262320 steps, saw 162764 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 761 rows 761 cols
[2022-05-19 12:27:08] [INFO ] Computed 358 place invariants in 4 ms
[2022-05-19 12:27:08] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:27:08] [INFO ] [Nat]Absence check using 358 positive place invariants in 50 ms returned sat
[2022-05-19 12:27:08] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:27:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-19 12:27:08] [INFO ] After 50ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:27:08] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-05-19 12:27:08] [INFO ] After 545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 761 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 761/761 places, 761/761 transitions.
Applied a total of 0 rules in 12 ms. Remains 761 /761 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 761/761 places, 761/761 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 761/761 places, 761/761 transitions.
Applied a total of 0 rules in 11 ms. Remains 761 /761 variables (removed 0) and now considering 761/761 (removed 0) transitions.
// Phase 1: matrix 761 rows 761 cols
[2022-05-19 12:27:09] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:27:09] [INFO ] Implicit Places using invariants in 386 ms returned []
// Phase 1: matrix 761 rows 761 cols
[2022-05-19 12:27:09] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:27:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-19 12:27:10] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1246 ms to find 0 implicit places.
[2022-05-19 12:27:10] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 761 rows 761 cols
[2022-05-19 12:27:10] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:27:10] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 761/761 places, 761/761 transitions.
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 0 with 81 rules applied. Total rules applied 81 place count 761 transition count 761
Applied a total of 81 rules in 23 ms. Remains 761 /761 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 761 rows 761 cols
[2022-05-19 12:27:10] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:27:10] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:27:10] [INFO ] [Nat]Absence check using 358 positive place invariants in 48 ms returned sat
[2022-05-19 12:27:11] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:27:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-19 12:27:11] [INFO ] After 38ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:27:11] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-05-19 12:27:11] [INFO ] After 530ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:27:11] [INFO ] Flatten gal took : 31 ms
[2022-05-19 12:27:11] [INFO ] Flatten gal took : 29 ms
[2022-05-19 12:27:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2654331349361026109.gal : 3 ms
[2022-05-19 12:27:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9713621990142516559.prop : 68 ms
Invoking ITS tools like this :cd /tmp/redAtoms10075647328830124383;'/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/ReachabilityCardinality2654331349361026109.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9713621990142516559.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/ReachabilityCardinality9713621990142516559.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :45 after 180
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :180 after 495
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :495 after 744
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :744 after 992
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :992 after 17213
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :17213 after 5.73521e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5.73521e+06 after 1.2153e+11
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.2153e+11 after 7.58146e+15
Detected timeout of ITS tools.
[2022-05-19 12:27:26] [INFO ] Flatten gal took : 25 ms
[2022-05-19 12:27:26] [INFO ] Applying decomposition
[2022-05-19 12:27:26] [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/graph468940876306836823.txt' '-o' '/tmp/graph468940876306836823.bin' '-w' '/tmp/graph468940876306836823.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph468940876306836823.bin' '-l' '-1' '-v' '-w' '/tmp/graph468940876306836823.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:27:26] [INFO ] Decomposing Gal with order
[2022-05-19 12:27:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:27:26] [INFO ] Removed a total of 436 redundant transitions.
[2022-05-19 12:27:26] [INFO ] Flatten gal took : 44 ms
[2022-05-19 12:27:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 8 ms.
[2022-05-19 12:27:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14084408132108697360.gal : 7 ms
[2022-05-19 12:27:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9724257687058529240.prop : 106 ms
Invoking ITS tools like this :cd /tmp/redAtoms10075647328830124383;'/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/ReachabilityCardinality14084408132108697360.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9724257687058529240.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/ReachabilityCardinality9724257687058529240.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 9
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,2.83505e+59,1.28816,47112,1539,112,90319,694,713,174534,67,5606,0
Total reachable state count : 2.835051873797550286254387711298370113248e+59
Verifying 1 reachability properties.
Reachability property apf0 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
apf0,4.69063e+41,1.29172,47376,393,72,90319,694,736,174534,76,5606,0
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 356 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 765 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 765/765 places, 763/763 transitions.
Applied a total of 0 rules in 23 ms. Remains 765 /765 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 765 cols
[2022-05-19 12:27:28] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:27:29] [INFO ] Implicit Places using invariants in 361 ms returned []
// Phase 1: matrix 763 rows 765 cols
[2022-05-19 12:27:29] [INFO ] Computed 358 place invariants in 4 ms
[2022-05-19 12:27:29] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-19 12:27:29] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1223 ms to find 0 implicit places.
[2022-05-19 12:27:29] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 763 rows 765 cols
[2022-05-19 12:27:29] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:27:30] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 765/765 places, 763/763 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 763 rows 765 cols
[2022-05-19 12:27:30] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:27:30] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:27:31] [INFO ] [Nat]Absence check using 358 positive place invariants in 43 ms returned sat
[2022-05-19 12:27:31] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:27:31] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-19 12:27:31] [INFO ] After 32ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:27:31] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-05-19 12:27:31] [INFO ] After 500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 765 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 765/765 places, 763/763 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 765 transition count 762
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 764 transition count 762
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 763 transition count 761
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 762 transition count 762
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 762 transition count 762
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 761 transition count 761
Applied a total of 9 rules in 51 ms. Remains 761 /765 variables (removed 4) and now considering 761/763 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 761/765 places, 761/763 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 271466 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 271466 steps, saw 168019 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 761 rows 761 cols
[2022-05-19 12:27:34] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:27:34] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:27:34] [INFO ] [Nat]Absence check using 358 positive place invariants in 47 ms returned sat
[2022-05-19 12:27:35] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:27:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-19 12:27:35] [INFO ] After 33ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:27:35] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-19 12:27:35] [INFO ] After 526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 761 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 761/761 places, 761/761 transitions.
Applied a total of 0 rules in 13 ms. Remains 761 /761 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 761/761 places, 761/761 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 761/761 places, 761/761 transitions.
Applied a total of 0 rules in 13 ms. Remains 761 /761 variables (removed 0) and now considering 761/761 (removed 0) transitions.
// Phase 1: matrix 761 rows 761 cols
[2022-05-19 12:27:35] [INFO ] Computed 358 place invariants in 4 ms
[2022-05-19 12:27:35] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 761 rows 761 cols
[2022-05-19 12:27:35] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:27:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-19 12:27:36] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
[2022-05-19 12:27:36] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 761 rows 761 cols
[2022-05-19 12:27:36] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:27:36] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 761/761 places, 761/761 transitions.
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 0 with 81 rules applied. Total rules applied 81 place count 761 transition count 761
Applied a total of 81 rules in 26 ms. Remains 761 /761 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 761 rows 761 cols
[2022-05-19 12:27:36] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:27:36] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:27:37] [INFO ] [Nat]Absence check using 358 positive place invariants in 46 ms returned sat
[2022-05-19 12:27:37] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:27:37] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-19 12:27:37] [INFO ] After 37ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:27:37] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-05-19 12:27:37] [INFO ] After 525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:27:37] [INFO ] Flatten gal took : 23 ms
[2022-05-19 12:27:37] [INFO ] Flatten gal took : 23 ms
[2022-05-19 12:27:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14563304688620260297.gal : 3 ms
[2022-05-19 12:27:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9128566648360679533.prop : 221 ms
Invoking ITS tools like this :cd /tmp/redAtoms7075449321116255831;'/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/ReachabilityCardinality14563304688620260297.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9128566648360679533.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/ReachabilityCardinality9128566648360679533.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :45 after 180
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :180 after 495
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :495 after 744
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :744 after 992
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :992 after 17213
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :17213 after 5.73521e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5.73521e+06 after 1.2153e+11
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.2153e+11 after 7.58146e+15
Detected timeout of ITS tools.
[2022-05-19 12:27:52] [INFO ] Flatten gal took : 25 ms
[2022-05-19 12:27:52] [INFO ] Applying decomposition
[2022-05-19 12:27:52] [INFO ] Flatten gal took : 23 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/graph11245506601970994090.txt' '-o' '/tmp/graph11245506601970994090.bin' '-w' '/tmp/graph11245506601970994090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11245506601970994090.bin' '-l' '-1' '-v' '-w' '/tmp/graph11245506601970994090.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:27:52] [INFO ] Decomposing Gal with order
[2022-05-19 12:27:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:27:52] [INFO ] Removed a total of 436 redundant transitions.
[2022-05-19 12:27:52] [INFO ] Flatten gal took : 77 ms
[2022-05-19 12:27:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2022-05-19 12:27:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9694286737973905567.gal : 6 ms
[2022-05-19 12:27:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5861503063497838978.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms7075449321116255831;'/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/ReachabilityCardinality9694286737973905567.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5861503063497838978.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/ReachabilityCardinality5861503063497838978.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 27
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,4.74413e+61,1.44876,53728,1421,103,104176,752,704,200450,67,6176,0
Total reachable state count : 4.744126629575551486251310775710152687382e+61
Verifying 1 reachability properties.
Reachability property apf0 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
apf0,2.06116e+43,1.45243,53992,372,64,104176,752,727,200450,76,6176,0
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 223 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 554 ms.
Product exploration explored 100000 steps with 0 reset in 726 ms.
Built C files in :
/tmp/ltsmin9803492021621968344
[2022-05-19 12:27:56] [INFO ] Computing symmetric may disable matrix : 763 transitions.
[2022-05-19 12:27:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:27:56] [INFO ] Computing symmetric may enable matrix : 763 transitions.
[2022-05-19 12:27:56] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:27:56] [INFO ] Computing Do-Not-Accords matrix : 763 transitions.
[2022-05-19 12:27:56] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:27:56] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9803492021621968344
Running compilation step : cd /tmp/ltsmin9803492021621968344;'/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 2010 ms.
Running link step : cd /tmp/ltsmin9803492021621968344;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9803492021621968344;'/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/stateBased14750338512243507744.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 765/765 places, 763/763 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 764 transition count 761
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 763 transition count 761
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 762 transition count 762
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 761 transition count 761
Applied a total of 5 rules in 40 ms. Remains 761 /765 variables (removed 4) and now considering 761/763 (removed 2) transitions.
// Phase 1: matrix 761 rows 761 cols
[2022-05-19 12:28:11] [INFO ] Computed 358 place invariants in 4 ms
[2022-05-19 12:28:11] [INFO ] Implicit Places using invariants in 362 ms returned []
// Phase 1: matrix 761 rows 761 cols
[2022-05-19 12:28:11] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:28:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-19 12:28:12] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
[2022-05-19 12:28:12] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 761 rows 761 cols
[2022-05-19 12:28:12] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:28:12] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 761/765 places, 761/763 transitions.
Finished structural reductions, in 1 iterations. Remains : 761/765 places, 761/763 transitions.
Built C files in :
/tmp/ltsmin16703922734124629973
[2022-05-19 12:28:12] [INFO ] Computing symmetric may disable matrix : 761 transitions.
[2022-05-19 12:28:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:28:12] [INFO ] Computing symmetric may enable matrix : 761 transitions.
[2022-05-19 12:28:12] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:28:12] [INFO ] Computing Do-Not-Accords matrix : 761 transitions.
[2022-05-19 12:28:12] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:28:12] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16703922734124629973
Running compilation step : cd /tmp/ltsmin16703922734124629973;'/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 1957 ms.
Running link step : cd /tmp/ltsmin16703922734124629973;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin16703922734124629973;'/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/stateBased6921506388012429410.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 12:28:28] [INFO ] Flatten gal took : 22 ms
[2022-05-19 12:28:28] [INFO ] Flatten gal took : 22 ms
[2022-05-19 12:28:28] [INFO ] Time to serialize gal into /tmp/LTL18273513365049627372.gal : 3 ms
[2022-05-19 12:28:28] [INFO ] Time to serialize properties into /tmp/LTL17091624681047711032.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/LTL18273513365049627372.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17091624681047711032.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/LTL1827351...268
Read 1 LTL properties
Checking formula 0 : !(((F(X(F(G(X(((F("((p2789==0)||(p1894==1))"))||("(p634==0)"))||("(p274==1)")))))))||(G("((p1978==0)&&(p1062==1))"))))
Formula 0 simplified : !(FXFGX("(p274==1)" | "(p634==0)" | F"((p2789==0)||(p1894==1))") | G"((p1978==0)&&(p1062==1))")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...1530
Computing Next relation with stutter on 1.60065e+49 deadlock states
Detected timeout of ITS tools.
[2022-05-19 12:28:43] [INFO ] Flatten gal took : 22 ms
[2022-05-19 12:28:43] [INFO ] Applying decomposition
[2022-05-19 12:28:43] [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/graph3366371105483059318.txt' '-o' '/tmp/graph3366371105483059318.bin' '-w' '/tmp/graph3366371105483059318.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3366371105483059318.bin' '-l' '-1' '-v' '-w' '/tmp/graph3366371105483059318.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:28:43] [INFO ] Decomposing Gal with order
[2022-05-19 12:28:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:28:43] [INFO ] Removed a total of 842 redundant transitions.
[2022-05-19 12:28:43] [INFO ] Flatten gal took : 52 ms
[2022-05-19 12:28:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 348 labels/synchronizations in 11 ms.
[2022-05-19 12:28:43] [INFO ] Time to serialize gal into /tmp/LTL3720017861314581342.gal : 21 ms
[2022-05-19 12:28:43] [INFO ] Time to serialize properties into /tmp/LTL16971655878731389830.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/LTL3720017861314581342.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16971655878731389830.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/LTL3720017...246
Read 1 LTL properties
Checking formula 0 : !(((F(X(F(G(X(((F("((i22.u315.p2789==0)||(i14.u213.p1894==1))"))||("(i4.i1.i0.u71.p634==0)"))||("(i2.u30.p274==1)")))))))||(G("((i16.u...194
Formula 0 simplified : !(FXFGX("(i2.u30.p274==1)" | "(i4.i1.i0.u71.p634==0)" | F"((i22.u315.p2789==0)||(i14.u213.p1894==1))") | G"((i16.u223.p1978==0)&&(i7...173
Reverse transition relation is NOT exact ! Due to transitions i0.t483_t170_t173, i0.t482_t166_t173, i0.t0, i0.u1.t485, i1.i0.t1, i1.i0.t488_t177_t181, i1.i...2285
Computing Next relation with stutter on 1.60065e+49 deadlock states
25 unique states visited
25 strongly connected components in search stack
26 transitions explored
25 items max in DFS search stack
1331 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,13.3941,515856,1,0,1.03768e+06,382,5338,3.01642e+06,493,2126,720615
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Detected timeout of ITS tools.
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-04 finished in 118040 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G((!p0 U p1))))&&F(p0)))'
Support contains 4 out of 2368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2361 transition count 2161
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2361 transition count 2161
Applied a total of 14 rules in 209 ms. Remains 2361 /2368 variables (removed 7) and now considering 2161/2168 (removed 7) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:28:58] [INFO ] Computed 361 place invariants in 11 ms
[2022-05-19 12:28:59] [INFO ] Implicit Places using invariants in 623 ms returned []
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:28:59] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:29:01] [INFO ] Implicit Places using invariants and state equation in 2049 ms returned []
Implicit Place search using SMT with State Equation took 2693 ms to find 0 implicit places.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:29:01] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:29:02] [INFO ] Dead Transitions using invariants and state equation in 1143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2368 places, 2161/2168 transitions.
Finished structural reductions, in 1 iterations. Remains : 2361/2368 places, 2161/2168 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s1858 0) (EQ s1467 1)), p1:(OR (EQ s977 0) (EQ s717 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 617 steps with 0 reset in 9 ms.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-05 finished in 4228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))&&p1)))'
Support contains 5 out of 2368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2365 transition count 2165
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2365 transition count 2165
Applied a total of 6 rules in 209 ms. Remains 2365 /2368 variables (removed 3) and now considering 2165/2168 (removed 3) transitions.
// Phase 1: matrix 2165 rows 2365 cols
[2022-05-19 12:29:02] [INFO ] Computed 361 place invariants in 11 ms
[2022-05-19 12:29:03] [INFO ] Implicit Places using invariants in 602 ms returned []
// Phase 1: matrix 2165 rows 2365 cols
[2022-05-19 12:29:03] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:29:05] [INFO ] Implicit Places using invariants and state equation in 1999 ms returned []
Implicit Place search using SMT with State Equation took 2601 ms to find 0 implicit places.
// Phase 1: matrix 2165 rows 2365 cols
[2022-05-19 12:29:05] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:29:06] [INFO ] Dead Transitions using invariants and state equation in 1136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2365/2368 places, 2165/2168 transitions.
Finished structural reductions, in 1 iterations. Remains : 2365/2368 places, 2165/2168 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s2063 0) (EQ s775 1)), p0:(AND (OR (EQ s376 0) (EQ s1172 1)) (OR (EQ s1233 0) (EQ s1233 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 572 ms.
Product exploration explored 100000 steps with 0 reset in 775 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 p1 p0), (X p1), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 155400 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 155400 steps, saw 96520 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2165 rows 2365 cols
[2022-05-19 12:29:11] [INFO ] Computed 361 place invariants in 15 ms
[2022-05-19 12:29:11] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:29:11] [INFO ] [Nat]Absence check using 361 positive place invariants in 115 ms returned sat
[2022-05-19 12:29:13] [INFO ] After 1009ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:29:13] [INFO ] Deduced a trap composed of 20 places in 468 ms of which 2 ms to minimize.
[2022-05-19 12:29:14] [INFO ] Deduced a trap composed of 27 places in 465 ms of which 2 ms to minimize.
[2022-05-19 12:29:14] [INFO ] Deduced a trap composed of 22 places in 446 ms of which 1 ms to minimize.
[2022-05-19 12:29:15] [INFO ] Deduced a trap composed of 18 places in 437 ms of which 2 ms to minimize.
[2022-05-19 12:29:15] [INFO ] Deduced a trap composed of 29 places in 445 ms of which 4 ms to minimize.
[2022-05-19 12:29:16] [INFO ] Deduced a trap composed of 22 places in 448 ms of which 1 ms to minimize.
[2022-05-19 12:29:16] [INFO ] Deduced a trap composed of 22 places in 426 ms of which 1 ms to minimize.
[2022-05-19 12:29:17] [INFO ] Deduced a trap composed of 25 places in 418 ms of which 2 ms to minimize.
[2022-05-19 12:29:17] [INFO ] Deduced a trap composed of 20 places in 400 ms of which 1 ms to minimize.
[2022-05-19 12:29:18] [INFO ] Deduced a trap composed of 23 places in 397 ms of which 1 ms to minimize.
[2022-05-19 12:29:18] [INFO ] Deduced a trap composed of 30 places in 376 ms of which 1 ms to minimize.
[2022-05-19 12:29:19] [INFO ] Deduced a trap composed of 22 places in 377 ms of which 1 ms to minimize.
[2022-05-19 12:29:19] [INFO ] Deduced a trap composed of 24 places in 376 ms of which 1 ms to minimize.
[2022-05-19 12:29:19] [INFO ] Deduced a trap composed of 35 places in 372 ms of which 1 ms to minimize.
[2022-05-19 12:29:20] [INFO ] Deduced a trap composed of 23 places in 370 ms of which 1 ms to minimize.
[2022-05-19 12:29:20] [INFO ] Deduced a trap composed of 32 places in 357 ms of which 1 ms to minimize.
[2022-05-19 12:29:21] [INFO ] Deduced a trap composed of 29 places in 352 ms of which 1 ms to minimize.
[2022-05-19 12:29:21] [INFO ] Deduced a trap composed of 32 places in 343 ms of which 1 ms to minimize.
[2022-05-19 12:29:22] [INFO ] Deduced a trap composed of 20 places in 376 ms of which 2 ms to minimize.
[2022-05-19 12:29:22] [INFO ] Deduced a trap composed of 29 places in 344 ms of which 1 ms to minimize.
[2022-05-19 12:29:22] [INFO ] Deduced a trap composed of 21 places in 339 ms of which 1 ms to minimize.
[2022-05-19 12:29:23] [INFO ] Deduced a trap composed of 36 places in 318 ms of which 1 ms to minimize.
[2022-05-19 12:29:23] [INFO ] Deduced a trap composed of 27 places in 319 ms of which 0 ms to minimize.
[2022-05-19 12:29:24] [INFO ] Deduced a trap composed of 29 places in 313 ms of which 1 ms to minimize.
[2022-05-19 12:29:24] [INFO ] Deduced a trap composed of 35 places in 308 ms of which 1 ms to minimize.
[2022-05-19 12:29:24] [INFO ] Deduced a trap composed of 17 places in 302 ms of which 1 ms to minimize.
[2022-05-19 12:29:25] [INFO ] Deduced a trap composed of 36 places in 298 ms of which 1 ms to minimize.
[2022-05-19 12:29:25] [INFO ] Deduced a trap composed of 39 places in 279 ms of which 1 ms to minimize.
[2022-05-19 12:29:25] [INFO ] Deduced a trap composed of 26 places in 279 ms of which 1 ms to minimize.
[2022-05-19 12:29:26] [INFO ] Deduced a trap composed of 41 places in 273 ms of which 1 ms to minimize.
[2022-05-19 12:29:26] [INFO ] Deduced a trap composed of 53 places in 255 ms of which 1 ms to minimize.
[2022-05-19 12:29:26] [INFO ] Deduced a trap composed of 44 places in 254 ms of which 1 ms to minimize.
[2022-05-19 12:29:27] [INFO ] Deduced a trap composed of 37 places in 250 ms of which 0 ms to minimize.
[2022-05-19 12:29:27] [INFO ] Deduced a trap composed of 42 places in 254 ms of which 1 ms to minimize.
[2022-05-19 12:29:27] [INFO ] Deduced a trap composed of 36 places in 254 ms of which 1 ms to minimize.
[2022-05-19 12:29:28] [INFO ] Deduced a trap composed of 40 places in 244 ms of which 0 ms to minimize.
[2022-05-19 12:29:28] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 0 ms to minimize.
[2022-05-19 12:29:28] [INFO ] Deduced a trap composed of 40 places in 229 ms of which 0 ms to minimize.
[2022-05-19 12:29:29] [INFO ] Deduced a trap composed of 38 places in 229 ms of which 0 ms to minimize.
[2022-05-19 12:29:29] [INFO ] Deduced a trap composed of 34 places in 228 ms of which 1 ms to minimize.
[2022-05-19 12:29:29] [INFO ] Deduced a trap composed of 38 places in 225 ms of which 1 ms to minimize.
[2022-05-19 12:29:30] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 0 ms to minimize.
[2022-05-19 12:29:30] [INFO ] Deduced a trap composed of 40 places in 234 ms of which 0 ms to minimize.
[2022-05-19 12:29:30] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 0 ms to minimize.
[2022-05-19 12:29:30] [INFO ] Deduced a trap composed of 44 places in 215 ms of which 1 ms to minimize.
[2022-05-19 12:29:31] [INFO ] Deduced a trap composed of 54 places in 211 ms of which 0 ms to minimize.
[2022-05-19 12:29:31] [INFO ] Deduced a trap composed of 42 places in 215 ms of which 1 ms to minimize.
[2022-05-19 12:29:31] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 1 ms to minimize.
[2022-05-19 12:29:32] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 0 ms to minimize.
[2022-05-19 12:29:32] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 1 ms to minimize.
[2022-05-19 12:29:32] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 0 ms to minimize.
[2022-05-19 12:29:32] [INFO ] Deduced a trap composed of 48 places in 193 ms of which 1 ms to minimize.
[2022-05-19 12:29:33] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 1 ms to minimize.
[2022-05-19 12:29:33] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 0 ms to minimize.
[2022-05-19 12:29:33] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 0 ms to minimize.
[2022-05-19 12:29:33] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 0 ms to minimize.
[2022-05-19 12:29:34] [INFO ] Deduced a trap composed of 53 places in 167 ms of which 1 ms to minimize.
[2022-05-19 12:29:34] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 1 ms to minimize.
[2022-05-19 12:29:34] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 1 ms to minimize.
[2022-05-19 12:29:34] [INFO ] Deduced a trap composed of 51 places in 163 ms of which 0 ms to minimize.
[2022-05-19 12:29:35] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 1 ms to minimize.
[2022-05-19 12:29:35] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 1 ms to minimize.
[2022-05-19 12:29:35] [INFO ] Deduced a trap composed of 51 places in 159 ms of which 1 ms to minimize.
[2022-05-19 12:29:35] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 1 ms to minimize.
[2022-05-19 12:29:35] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 1 ms to minimize.
[2022-05-19 12:29:36] [INFO ] Deduced a trap composed of 55 places in 145 ms of which 0 ms to minimize.
[2022-05-19 12:29:36] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 1 ms to minimize.
[2022-05-19 12:29:36] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 0 ms to minimize.
[2022-05-19 12:29:36] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 1 ms to minimize.
[2022-05-19 12:29:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 12:29:36] [INFO ] After 25105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 2365 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2365/2365 places, 2165/2165 transitions.
Drop transitions removed 478 transitions
Trivial Post-agglo rules discarded 478 transitions
Performed 478 trivial Post agglomeration. Transition count delta: 478
Iterating post reduction 0 with 478 rules applied. Total rules applied 478 place count 2365 transition count 1687
Reduce places removed 478 places and 0 transitions.
Iterating post reduction 1 with 478 rules applied. Total rules applied 956 place count 1887 transition count 1687
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 956 place count 1887 transition count 1368
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 1594 place count 1568 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1595 place count 1567 transition count 1367
Iterating global reduction 2 with 1 rules applied. Total rules applied 1596 place count 1567 transition count 1367
Performed 683 Post agglomeration using F-continuation condition.Transition count delta: 683
Deduced a syphon composed of 683 places in 0 ms
Reduce places removed 683 places and 0 transitions.
Iterating global reduction 2 with 1366 rules applied. Total rules applied 2962 place count 884 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2963 place count 884 transition count 683
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 2965 place count 883 transition count 682
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
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 3167 place count 782 transition count 749
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
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 3201 place count 765 transition count 760
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3202 place count 765 transition count 759
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3203 place count 765 transition count 758
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3204 place count 764 transition count 758
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3244 place count 764 transition count 758
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3245 place count 763 transition count 757
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3247 place count 761 transition count 757
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3247 place count 761 transition count 756
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3249 place count 760 transition count 756
Applied a total of 3249 rules in 298 ms. Remains 760 /2365 variables (removed 1605) and now considering 756/2165 (removed 1409) transitions.
Finished structural reductions, in 1 iterations. Remains : 760/2365 places, 756/2165 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 261031 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 261031 steps, saw 166628 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 756 rows 760 cols
[2022-05-19 12:29:40] [INFO ] Computed 359 place invariants in 3 ms
[2022-05-19 12:29:40] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:29:40] [INFO ] [Nat]Absence check using 359 positive place invariants in 42 ms returned sat
[2022-05-19 12:29:40] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:29:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:29:40] [INFO ] After 32ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:29:40] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-05-19 12:29:40] [INFO ] After 490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 760 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 760/760 places, 756/756 transitions.
Applied a total of 0 rules in 13 ms. Remains 760 /760 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 760/760 places, 756/756 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 760/760 places, 756/756 transitions.
Applied a total of 0 rules in 10 ms. Remains 760 /760 variables (removed 0) and now considering 756/756 (removed 0) transitions.
// Phase 1: matrix 756 rows 760 cols
[2022-05-19 12:29:40] [INFO ] Computed 359 place invariants in 1 ms
[2022-05-19 12:29:41] [INFO ] Implicit Places using invariants in 345 ms returned [749]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 346 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 759/760 places, 756/756 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 758 transition count 755
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 758 transition count 755
Applied a total of 2 rules in 30 ms. Remains 758 /759 variables (removed 1) and now considering 755/756 (removed 1) transitions.
// Phase 1: matrix 755 rows 758 cols
[2022-05-19 12:29:41] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:29:41] [INFO ] Implicit Places using invariants in 357 ms returned []
// Phase 1: matrix 755 rows 758 cols
[2022-05-19 12:29:41] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:29:42] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 1050 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 758/760 places, 755/756 transitions.
Finished structural reductions, in 2 iterations. Remains : 758/760 places, 755/756 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 259400 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 259400 steps, saw 165744 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 755 rows 758 cols
[2022-05-19 12:29:45] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:29:45] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:29:45] [INFO ] [Nat]Absence check using 358 positive place invariants in 43 ms returned sat
[2022-05-19 12:29:45] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:29:45] [INFO ] After 309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-19 12:29:45] [INFO ] After 491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 758 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 758/758 places, 755/755 transitions.
Applied a total of 0 rules in 10 ms. Remains 758 /758 variables (removed 0) and now considering 755/755 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 758/758 places, 755/755 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 758/758 places, 755/755 transitions.
Applied a total of 0 rules in 10 ms. Remains 758 /758 variables (removed 0) and now considering 755/755 (removed 0) transitions.
// Phase 1: matrix 755 rows 758 cols
[2022-05-19 12:29:45] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:29:46] [INFO ] Implicit Places using invariants in 360 ms returned []
// Phase 1: matrix 755 rows 758 cols
[2022-05-19 12:29:46] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:29:46] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
[2022-05-19 12:29:46] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 755 rows 758 cols
[2022-05-19 12:29:46] [INFO ] Computed 358 place invariants in 10 ms
[2022-05-19 12:29:47] [INFO ] Dead Transitions using invariants and state equation in 334 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 758/758 places, 755/755 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 758 transition count 755
Applied a total of 78 rules in 19 ms. Remains 758 /758 variables (removed 0) and now considering 755/755 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 755 rows 758 cols
[2022-05-19 12:29:47] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:29:47] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:29:47] [INFO ] [Nat]Absence check using 358 positive place invariants in 42 ms returned sat
[2022-05-19 12:29:47] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:29:47] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-19 12:29:47] [INFO ] After 78ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:29:47] [INFO ] After 136ms 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-19 12:29:48] [INFO ] After 561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:29:48] [INFO ] Flatten gal took : 23 ms
[2022-05-19 12:29:48] [INFO ] Flatten gal took : 22 ms
[2022-05-19 12:29:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13909483991465147923.gal : 3 ms
[2022-05-19 12:29:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6194506076521806446.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3594327625184221297;'/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/ReachabilityCardinality13909483991465147923.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6194506076521806446.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/ReachabilityCardinality6194506076521806446.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 70
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :70 after 136
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :136 after 273
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :273 after 4955
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4955 after 63804
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :63804 after 7.35684e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.35684e+06 after 5.4628e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.4628e+07 after 3.63195e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.63195e+10 after 9.87037e+15
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 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,1.45545e+19,1.43135,46632,2,7366,18,151249,6,0,3751,295201,0
Total reachable state count : 14554546754298136502
Verifying 1 reachability properties.
Reachability property apf0 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
apf0,3.43296e+16,1.4347,46632,2,3289,18,151249,7,0,3761,295201,0
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 2365 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2365/2365 places, 2165/2165 transitions.
Applied a total of 0 rules in 124 ms. Remains 2365 /2365 variables (removed 0) and now considering 2165/2165 (removed 0) transitions.
// Phase 1: matrix 2165 rows 2365 cols
[2022-05-19 12:29:50] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:29:50] [INFO ] Implicit Places using invariants in 603 ms returned []
// Phase 1: matrix 2165 rows 2365 cols
[2022-05-19 12:29:50] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:29:52] [INFO ] Implicit Places using invariants and state equation in 2022 ms returned []
Implicit Place search using SMT with State Equation took 2630 ms to find 0 implicit places.
// Phase 1: matrix 2165 rows 2365 cols
[2022-05-19 12:29:52] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:29:53] [INFO ] Dead Transitions using invariants and state equation in 1140 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2365/2365 places, 2165/2165 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 154333 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154333 steps, saw 95934 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2165 rows 2365 cols
[2022-05-19 12:29:57] [INFO ] Computed 361 place invariants in 12 ms
[2022-05-19 12:29:57] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:29:57] [INFO ] [Nat]Absence check using 361 positive place invariants in 117 ms returned sat
[2022-05-19 12:29:58] [INFO ] After 984ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:29:59] [INFO ] Deduced a trap composed of 20 places in 459 ms of which 2 ms to minimize.
[2022-05-19 12:29:59] [INFO ] Deduced a trap composed of 27 places in 452 ms of which 1 ms to minimize.
[2022-05-19 12:30:00] [INFO ] Deduced a trap composed of 22 places in 449 ms of which 1 ms to minimize.
[2022-05-19 12:30:00] [INFO ] Deduced a trap composed of 18 places in 440 ms of which 2 ms to minimize.
[2022-05-19 12:30:01] [INFO ] Deduced a trap composed of 29 places in 433 ms of which 1 ms to minimize.
[2022-05-19 12:30:01] [INFO ] Deduced a trap composed of 22 places in 434 ms of which 1 ms to minimize.
[2022-05-19 12:30:02] [INFO ] Deduced a trap composed of 22 places in 427 ms of which 1 ms to minimize.
[2022-05-19 12:30:02] [INFO ] Deduced a trap composed of 25 places in 431 ms of which 2 ms to minimize.
[2022-05-19 12:30:03] [INFO ] Deduced a trap composed of 20 places in 424 ms of which 1 ms to minimize.
[2022-05-19 12:30:03] [INFO ] Deduced a trap composed of 23 places in 403 ms of which 1 ms to minimize.
[2022-05-19 12:30:04] [INFO ] Deduced a trap composed of 30 places in 383 ms of which 1 ms to minimize.
[2022-05-19 12:30:04] [INFO ] Deduced a trap composed of 22 places in 380 ms of which 1 ms to minimize.
[2022-05-19 12:30:05] [INFO ] Deduced a trap composed of 24 places in 368 ms of which 1 ms to minimize.
[2022-05-19 12:30:05] [INFO ] Deduced a trap composed of 35 places in 409 ms of which 1 ms to minimize.
[2022-05-19 12:30:06] [INFO ] Deduced a trap composed of 23 places in 367 ms of which 5 ms to minimize.
[2022-05-19 12:30:06] [INFO ] Deduced a trap composed of 32 places in 359 ms of which 1 ms to minimize.
[2022-05-19 12:30:06] [INFO ] Deduced a trap composed of 29 places in 361 ms of which 1 ms to minimize.
[2022-05-19 12:30:07] [INFO ] Deduced a trap composed of 32 places in 353 ms of which 1 ms to minimize.
[2022-05-19 12:30:07] [INFO ] Deduced a trap composed of 20 places in 346 ms of which 1 ms to minimize.
[2022-05-19 12:30:08] [INFO ] Deduced a trap composed of 29 places in 344 ms of which 1 ms to minimize.
[2022-05-19 12:30:08] [INFO ] Deduced a trap composed of 21 places in 346 ms of which 0 ms to minimize.
[2022-05-19 12:30:09] [INFO ] Deduced a trap composed of 36 places in 335 ms of which 1 ms to minimize.
[2022-05-19 12:30:09] [INFO ] Deduced a trap composed of 27 places in 320 ms of which 1 ms to minimize.
[2022-05-19 12:30:09] [INFO ] Deduced a trap composed of 29 places in 316 ms of which 0 ms to minimize.
[2022-05-19 12:30:10] [INFO ] Deduced a trap composed of 35 places in 325 ms of which 1 ms to minimize.
[2022-05-19 12:30:10] [INFO ] Deduced a trap composed of 17 places in 296 ms of which 1 ms to minimize.
[2022-05-19 12:30:10] [INFO ] Deduced a trap composed of 36 places in 297 ms of which 1 ms to minimize.
[2022-05-19 12:30:11] [INFO ] Deduced a trap composed of 39 places in 291 ms of which 0 ms to minimize.
[2022-05-19 12:30:11] [INFO ] Deduced a trap composed of 26 places in 271 ms of which 2 ms to minimize.
[2022-05-19 12:30:12] [INFO ] Deduced a trap composed of 41 places in 262 ms of which 1 ms to minimize.
[2022-05-19 12:30:12] [INFO ] Deduced a trap composed of 53 places in 275 ms of which 0 ms to minimize.
[2022-05-19 12:30:12] [INFO ] Deduced a trap composed of 44 places in 263 ms of which 1 ms to minimize.
[2022-05-19 12:30:13] [INFO ] Deduced a trap composed of 37 places in 251 ms of which 1 ms to minimize.
[2022-05-19 12:30:13] [INFO ] Deduced a trap composed of 42 places in 260 ms of which 1 ms to minimize.
[2022-05-19 12:30:13] [INFO ] Deduced a trap composed of 36 places in 245 ms of which 1 ms to minimize.
[2022-05-19 12:30:13] [INFO ] Deduced a trap composed of 40 places in 250 ms of which 1 ms to minimize.
[2022-05-19 12:30:14] [INFO ] Deduced a trap composed of 38 places in 244 ms of which 1 ms to minimize.
[2022-05-19 12:30:14] [INFO ] Deduced a trap composed of 40 places in 239 ms of which 0 ms to minimize.
[2022-05-19 12:30:14] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 1 ms to minimize.
[2022-05-19 12:30:15] [INFO ] Deduced a trap composed of 34 places in 233 ms of which 0 ms to minimize.
[2022-05-19 12:30:15] [INFO ] Deduced a trap composed of 38 places in 232 ms of which 1 ms to minimize.
[2022-05-19 12:30:15] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 1 ms to minimize.
[2022-05-19 12:30:16] [INFO ] Deduced a trap composed of 40 places in 226 ms of which 0 ms to minimize.
[2022-05-19 12:30:16] [INFO ] Deduced a trap composed of 39 places in 218 ms of which 1 ms to minimize.
[2022-05-19 12:30:16] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 1 ms to minimize.
[2022-05-19 12:30:17] [INFO ] Deduced a trap composed of 54 places in 214 ms of which 1 ms to minimize.
[2022-05-19 12:30:17] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 0 ms to minimize.
[2022-05-19 12:30:17] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 1 ms to minimize.
[2022-05-19 12:30:17] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 1 ms to minimize.
[2022-05-19 12:30:18] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 1 ms to minimize.
[2022-05-19 12:30:18] [INFO ] Deduced a trap composed of 42 places in 185 ms of which 1 ms to minimize.
[2022-05-19 12:30:18] [INFO ] Deduced a trap composed of 48 places in 184 ms of which 1 ms to minimize.
[2022-05-19 12:30:18] [INFO ] Deduced a trap composed of 48 places in 170 ms of which 1 ms to minimize.
[2022-05-19 12:30:19] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 0 ms to minimize.
[2022-05-19 12:30:19] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 1 ms to minimize.
[2022-05-19 12:30:19] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 0 ms to minimize.
[2022-05-19 12:30:19] [INFO ] Deduced a trap composed of 53 places in 178 ms of which 1 ms to minimize.
[2022-05-19 12:30:20] [INFO ] Deduced a trap composed of 48 places in 185 ms of which 1 ms to minimize.
[2022-05-19 12:30:20] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 1 ms to minimize.
[2022-05-19 12:30:20] [INFO ] Deduced a trap composed of 51 places in 163 ms of which 1 ms to minimize.
[2022-05-19 12:30:20] [INFO ] Deduced a trap composed of 49 places in 156 ms of which 0 ms to minimize.
[2022-05-19 12:30:21] [INFO ] Deduced a trap composed of 47 places in 158 ms of which 0 ms to minimize.
[2022-05-19 12:30:21] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 1 ms to minimize.
[2022-05-19 12:30:21] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 1 ms to minimize.
[2022-05-19 12:30:21] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 1 ms to minimize.
[2022-05-19 12:30:21] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 1 ms to minimize.
[2022-05-19 12:30:22] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 1 ms to minimize.
[2022-05-19 12:30:22] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 0 ms to minimize.
[2022-05-19 12:30:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 12:30:22] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 25 ms.
Support contains 3 out of 2365 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2365/2365 places, 2165/2165 transitions.
Drop transitions removed 478 transitions
Trivial Post-agglo rules discarded 478 transitions
Performed 478 trivial Post agglomeration. Transition count delta: 478
Iterating post reduction 0 with 478 rules applied. Total rules applied 478 place count 2365 transition count 1687
Reduce places removed 478 places and 0 transitions.
Iterating post reduction 1 with 478 rules applied. Total rules applied 956 place count 1887 transition count 1687
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 956 place count 1887 transition count 1368
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 1594 place count 1568 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1595 place count 1567 transition count 1367
Iterating global reduction 2 with 1 rules applied. Total rules applied 1596 place count 1567 transition count 1367
Performed 683 Post agglomeration using F-continuation condition.Transition count delta: 683
Deduced a syphon composed of 683 places in 1 ms
Reduce places removed 683 places and 0 transitions.
Iterating global reduction 2 with 1366 rules applied. Total rules applied 2962 place count 884 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2963 place count 884 transition count 683
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 2965 place count 883 transition count 682
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
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 3167 place count 782 transition count 749
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
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 3201 place count 765 transition count 760
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3202 place count 765 transition count 759
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3203 place count 765 transition count 758
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3204 place count 764 transition count 758
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3244 place count 764 transition count 758
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3245 place count 763 transition count 757
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3247 place count 761 transition count 757
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3247 place count 761 transition count 756
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3249 place count 760 transition count 756
Applied a total of 3249 rules in 301 ms. Remains 760 /2365 variables (removed 1605) and now considering 756/2165 (removed 1409) transitions.
Finished structural reductions, in 1 iterations. Remains : 760/2365 places, 756/2165 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 250669 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 250669 steps, saw 159784 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 756 rows 760 cols
[2022-05-19 12:30:25] [INFO ] Computed 359 place invariants in 3 ms
[2022-05-19 12:30:25] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:30:26] [INFO ] [Nat]Absence check using 359 positive place invariants in 41 ms returned sat
[2022-05-19 12:30:26] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:30:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:30:26] [INFO ] After 31ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:30:26] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-19 12:30:26] [INFO ] After 490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 760 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 760/760 places, 756/756 transitions.
Applied a total of 0 rules in 16 ms. Remains 760 /760 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 760/760 places, 756/756 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 760/760 places, 756/756 transitions.
Applied a total of 0 rules in 12 ms. Remains 760 /760 variables (removed 0) and now considering 756/756 (removed 0) transitions.
// Phase 1: matrix 756 rows 760 cols
[2022-05-19 12:30:26] [INFO ] Computed 359 place invariants in 2 ms
[2022-05-19 12:30:26] [INFO ] Implicit Places using invariants in 364 ms returned [749]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 365 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 759/760 places, 756/756 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 758 transition count 755
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 758 transition count 755
Applied a total of 2 rules in 21 ms. Remains 758 /759 variables (removed 1) and now considering 755/756 (removed 1) transitions.
// Phase 1: matrix 755 rows 758 cols
[2022-05-19 12:30:26] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:30:27] [INFO ] Implicit Places using invariants in 365 ms returned []
// Phase 1: matrix 755 rows 758 cols
[2022-05-19 12:30:27] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:30:27] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 1045 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 758/760 places, 755/756 transitions.
Finished structural reductions, in 2 iterations. Remains : 758/760 places, 755/756 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 254691 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 254691 steps, saw 162705 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 755 rows 758 cols
[2022-05-19 12:30:30] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:30:31] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:30:31] [INFO ] [Nat]Absence check using 358 positive place invariants in 43 ms returned sat
[2022-05-19 12:30:31] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:30:31] [INFO ] After 298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-19 12:30:31] [INFO ] After 477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 758 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 758/758 places, 755/755 transitions.
Applied a total of 0 rules in 10 ms. Remains 758 /758 variables (removed 0) and now considering 755/755 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 758/758 places, 755/755 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 758/758 places, 755/755 transitions.
Applied a total of 0 rules in 40 ms. Remains 758 /758 variables (removed 0) and now considering 755/755 (removed 0) transitions.
// Phase 1: matrix 755 rows 758 cols
[2022-05-19 12:30:31] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:30:31] [INFO ] Implicit Places using invariants in 361 ms returned []
// Phase 1: matrix 755 rows 758 cols
[2022-05-19 12:30:31] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:30:32] [INFO ] Implicit Places using invariants and state equation in 708 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
[2022-05-19 12:30:32] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 755 rows 758 cols
[2022-05-19 12:30:32] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:30:33] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 758/758 places, 755/755 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 758 transition count 755
Applied a total of 78 rules in 25 ms. Remains 758 /758 variables (removed 0) and now considering 755/755 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 755 rows 758 cols
[2022-05-19 12:30:33] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:30:33] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:30:33] [INFO ] [Nat]Absence check using 358 positive place invariants in 41 ms returned sat
[2022-05-19 12:30:33] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:30:33] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-19 12:30:33] [INFO ] After 81ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:30:33] [INFO ] After 139ms 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-19 12:30:33] [INFO ] After 569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:30:33] [INFO ] Flatten gal took : 28 ms
[2022-05-19 12:30:33] [INFO ] Flatten gal took : 25 ms
[2022-05-19 12:30:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12887085344518070424.gal : 4 ms
[2022-05-19 12:30:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2290931470565279714.prop : 34 ms
Invoking ITS tools like this :cd /tmp/redAtoms13685499794701571744;'/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/ReachabilityCardinality12887085344518070424.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2290931470565279714.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/ReachabilityCardinality2290931470565279714.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 70
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :70 after 136
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :136 after 273
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :273 after 4955
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4955 after 63804
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :63804 after 7.35684e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.35684e+06 after 5.4628e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.4628e+07 after 3.63195e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.63195e+10 after 9.87037e+15
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 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,1.45545e+19,1.42769,46632,2,7366,18,151249,6,0,3751,295193,0
Total reachable state count : 14554546754298136502
Verifying 1 reachability properties.
Reachability property apf0 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
apf0,3.43296e+16,1.43109,46632,2,3289,18,151249,7,0,3761,295193,0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 610 ms.
Product exploration explored 100000 steps with 0 reset in 781 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 2365 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2365/2365 places, 2165/2165 transitions.
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 478 rules applied. Total rules applied 478 place count 2365 transition count 2165
Performed 162 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 162 Pre rules applied. Total rules applied 478 place count 2365 transition count 2289
Deduced a syphon composed of 640 places in 3 ms
Iterating global reduction 1 with 162 rules applied. Total rules applied 640 place count 2365 transition count 2289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 641 place count 2364 transition count 2288
Deduced a syphon composed of 640 places in 3 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 642 place count 2364 transition count 2288
Performed 800 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1440 places in 2 ms
Iterating global reduction 1 with 800 rules applied. Total rules applied 1442 place count 2364 transition count 2288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1443 place count 2364 transition count 2287
Renaming transitions due to excessive name length > 1024 char.
Discarding 319 places :
Symmetric choice reduction at 2 with 319 rule applications. Total rules 1762 place count 2045 transition count 1968
Deduced a syphon composed of 1121 places in 2 ms
Iterating global reduction 2 with 319 rules applied. Total rules applied 2081 place count 2045 transition count 1968
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1122 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2082 place count 2045 transition count 1968
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2084 place count 2043 transition count 1966
Deduced a syphon composed of 1120 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2086 place count 2043 transition count 1966
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -535
Deduced a syphon composed of 1221 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2187 place count 2043 transition count 2501
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 2289 place count 1941 transition count 2297
Deduced a syphon composed of 1119 places in 2 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 2391 place count 1941 transition count 2297
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -307
Deduced a syphon composed of 1176 places in 2 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2448 place count 1941 transition count 2604
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 2505 place count 1884 transition count 2490
Deduced a syphon composed of 1119 places in 2 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2562 place count 1884 transition count 2490
Deduced a syphon composed of 1119 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2571 place count 1884 transition count 2481
Deduced a syphon composed of 1119 places in 2 ms
Applied a total of 2571 rules in 1601 ms. Remains 1884 /2365 variables (removed 481) and now considering 2481/2165 (removed -316) transitions.
[2022-05-19 12:30:39] [INFO ] Redundant transitions in 41 ms returned []
// Phase 1: matrix 2481 rows 1884 cols
[2022-05-19 12:30:39] [INFO ] Computed 361 place invariants in 15 ms
[2022-05-19 12:30:40] [INFO ] Dead Transitions using invariants and state equation in 1283 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1884/2365 places, 2481/2165 transitions.
Finished structural reductions, in 1 iterations. Remains : 1884/2365 places, 2481/2165 transitions.
Product exploration explored 100000 steps with 0 reset in 793 ms.
Product exploration explored 100000 steps with 0 reset in 864 ms.
Built C files in :
/tmp/ltsmin1996260419069141405
[2022-05-19 12:30:42] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1996260419069141405
Running compilation step : cd /tmp/ltsmin1996260419069141405;'/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/ltsmin1996260419069141405;'/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/ltsmin1996260419069141405;'/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 3 out of 2365 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2365/2365 places, 2165/2165 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2364 transition count 2164
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2364 transition count 2164
Applied a total of 2 rules in 241 ms. Remains 2364 /2365 variables (removed 1) and now considering 2164/2165 (removed 1) transitions.
// Phase 1: matrix 2164 rows 2364 cols
[2022-05-19 12:30:45] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:30:46] [INFO ] Implicit Places using invariants in 894 ms returned []
// Phase 1: matrix 2164 rows 2364 cols
[2022-05-19 12:30:46] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 12:30:48] [INFO ] Implicit Places using invariants and state equation in 2046 ms returned []
Implicit Place search using SMT with State Equation took 2943 ms to find 0 implicit places.
// Phase 1: matrix 2164 rows 2364 cols
[2022-05-19 12:30:48] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:30:49] [INFO ] Dead Transitions using invariants and state equation in 1135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2364/2365 places, 2164/2165 transitions.
Finished structural reductions, in 1 iterations. Remains : 2364/2365 places, 2164/2165 transitions.
Built C files in :
/tmp/ltsmin4561893110570847809
[2022-05-19 12:30:49] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4561893110570847809
Running compilation step : cd /tmp/ltsmin4561893110570847809;'/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/ltsmin4561893110570847809;'/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/ltsmin4561893110570847809;'/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-19 12:30:52] [INFO ] Flatten gal took : 48 ms
[2022-05-19 12:30:52] [INFO ] Flatten gal took : 49 ms
[2022-05-19 12:30:52] [INFO ] Time to serialize gal into /tmp/LTL12684642256277108529.gal : 5 ms
[2022-05-19 12:30:52] [INFO ] Time to serialize properties into /tmp/LTL989655370349819886.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/LTL12684642256277108529.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL989655370349819886.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/LTL1268464...266
Read 1 LTL properties
Checking formula 0 : !((X((G(X("(((p436==0)||(p1379==1))&&((p1450==0)||(p1450==1)))")))&&("((p2439==0)||(p909==1))"))))
Formula 0 simplified : !X("((p2439==0)||(p909==1))" & GX"(((p436==0)||(p1379==1))&&((p1450==0)||(p1450==1)))")
Detected timeout of ITS tools.
[2022-05-19 12:31:07] [INFO ] Flatten gal took : 46 ms
[2022-05-19 12:31:07] [INFO ] Applying decomposition
[2022-05-19 12:31:07] [INFO ] Flatten gal took : 45 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/graph6274369933686928207.txt' '-o' '/tmp/graph6274369933686928207.bin' '-w' '/tmp/graph6274369933686928207.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6274369933686928207.bin' '-l' '-1' '-v' '-w' '/tmp/graph6274369933686928207.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:31:07] [INFO ] Decomposing Gal with order
[2022-05-19 12:31:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:31:08] [INFO ] Removed a total of 394 redundant transitions.
[2022-05-19 12:31:08] [INFO ] Flatten gal took : 87 ms
[2022-05-19 12:31:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-19 12:31:08] [INFO ] Time to serialize gal into /tmp/LTL17803047368050178749.gal : 12 ms
[2022-05-19 12:31:08] [INFO ] Time to serialize properties into /tmp/LTL16128524359098759578.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/LTL17803047368050178749.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16128524359098759578.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/LTL1780304...247
Read 1 LTL properties
Checking formula 0 : !((X((G(X("(((i5.u142.p436==0)||(i18.i2.i2.u438.p1379==1))&&((i19.u460.p1450==0)||(i19.u460.p1450==1)))")))&&("((i33.u772.p2439==0)||(...178
Formula 0 simplified : !X("((i33.u772.p2439==0)||(i12.u289.p909==1))" & GX"(((i5.u142.p436==0)||(i18.i2.i2.u438.p1379==1))&&((i19.u460.p1450==0)||(i19.u460...169
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1768156294814474636
[2022-05-19 12:31:23] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1768156294814474636
Running compilation step : cd /tmp/ltsmin1768156294814474636;'/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/ltsmin1768156294814474636;'/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/ltsmin1768156294814474636;'/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 ShieldIIPt-PT-040B-LTLCardinality-08 finished in 143734 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)&&p0))))'
Support contains 4 out of 2368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2363 transition count 2163
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2363 transition count 2163
Applied a total of 10 rules in 235 ms. Remains 2363 /2368 variables (removed 5) and now considering 2163/2168 (removed 5) transitions.
// Phase 1: matrix 2163 rows 2363 cols
[2022-05-19 12:31:26] [INFO ] Computed 361 place invariants in 11 ms
[2022-05-19 12:31:27] [INFO ] Implicit Places using invariants in 657 ms returned []
// Phase 1: matrix 2163 rows 2363 cols
[2022-05-19 12:31:27] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:31:29] [INFO ] Implicit Places using invariants and state equation in 1985 ms returned []
Implicit Place search using SMT with State Equation took 2645 ms to find 0 implicit places.
// Phase 1: matrix 2163 rows 2363 cols
[2022-05-19 12:31:29] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:31:30] [INFO ] Dead Transitions using invariants and state equation in 1136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2363/2368 places, 2163/2168 transitions.
Finished structural reductions, in 1 iterations. Remains : 2363/2368 places, 2163/2168 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1078 0) (EQ s1326 1)), p1:(OR (EQ s822 0) (EQ s1115 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 20 reset in 560 ms.
Stack based approach found an accepted trace after 8340 steps with 15 reset with depth 2448 and stack size 2448 in 42 ms.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-11 finished in 4733 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((X(p0)&&p0))&&G(F(G(F(G(p1))))))))'
Support contains 3 out of 2368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2361 transition count 2161
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2361 transition count 2161
Applied a total of 14 rules in 206 ms. Remains 2361 /2368 variables (removed 7) and now considering 2161/2168 (removed 7) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:31:31] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 12:31:31] [INFO ] Implicit Places using invariants in 595 ms returned []
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:31:31] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:31:33] [INFO ] Implicit Places using invariants and state equation in 2026 ms returned []
Implicit Place search using SMT with State Equation took 2623 ms to find 0 implicit places.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:31:33] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 12:31:35] [INFO ] Dead Transitions using invariants and state equation in 1135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2368 places, 2161/2168 transitions.
Finished structural reductions, in 1 iterations. Remains : 2361/2368 places, 2161/2168 transitions.
Stuttering acceptance computed with spot in 1310 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s2130 1)), p1:(EQ s271 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 556 ms.
Product exploration explored 100000 steps with 0 reset in 764 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 p0 p1), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:31:38] [INFO ] Computed 361 place invariants in 6 ms
[2022-05-19 12:31:38] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:31:38] [INFO ] [Nat]Absence check using 361 positive place invariants in 114 ms returned sat
[2022-05-19 12:31:39] [INFO ] After 954ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:31:40] [INFO ] Deduced a trap composed of 19 places in 449 ms of which 1 ms to minimize.
[2022-05-19 12:31:40] [INFO ] Deduced a trap composed of 21 places in 458 ms of which 1 ms to minimize.
[2022-05-19 12:31:41] [INFO ] Deduced a trap composed of 16 places in 433 ms of which 1 ms to minimize.
[2022-05-19 12:31:41] [INFO ] Deduced a trap composed of 26 places in 425 ms of which 1 ms to minimize.
[2022-05-19 12:31:42] [INFO ] Deduced a trap composed of 18 places in 423 ms of which 1 ms to minimize.
[2022-05-19 12:31:42] [INFO ] Deduced a trap composed of 31 places in 402 ms of which 1 ms to minimize.
[2022-05-19 12:31:43] [INFO ] Deduced a trap composed of 25 places in 397 ms of which 1 ms to minimize.
[2022-05-19 12:31:43] [INFO ] Deduced a trap composed of 30 places in 404 ms of which 1 ms to minimize.
[2022-05-19 12:31:44] [INFO ] Deduced a trap composed of 23 places in 398 ms of which 1 ms to minimize.
[2022-05-19 12:31:44] [INFO ] Deduced a trap composed of 22 places in 397 ms of which 1 ms to minimize.
[2022-05-19 12:31:44] [INFO ] Deduced a trap composed of 23 places in 397 ms of which 1 ms to minimize.
[2022-05-19 12:31:45] [INFO ] Deduced a trap composed of 28 places in 388 ms of which 1 ms to minimize.
[2022-05-19 12:31:45] [INFO ] Deduced a trap composed of 33 places in 385 ms of which 1 ms to minimize.
[2022-05-19 12:31:46] [INFO ] Deduced a trap composed of 31 places in 387 ms of which 2 ms to minimize.
[2022-05-19 12:31:46] [INFO ] Deduced a trap composed of 28 places in 369 ms of which 2 ms to minimize.
[2022-05-19 12:31:47] [INFO ] Deduced a trap composed of 31 places in 383 ms of which 1 ms to minimize.
[2022-05-19 12:31:47] [INFO ] Deduced a trap composed of 28 places in 363 ms of which 1 ms to minimize.
[2022-05-19 12:31:48] [INFO ] Deduced a trap composed of 19 places in 354 ms of which 1 ms to minimize.
[2022-05-19 12:31:48] [INFO ] Deduced a trap composed of 21 places in 351 ms of which 1 ms to minimize.
[2022-05-19 12:31:48] [INFO ] Deduced a trap composed of 24 places in 331 ms of which 1 ms to minimize.
[2022-05-19 12:31:49] [INFO ] Deduced a trap composed of 40 places in 333 ms of which 1 ms to minimize.
[2022-05-19 12:31:49] [INFO ] Deduced a trap composed of 32 places in 340 ms of which 1 ms to minimize.
[2022-05-19 12:31:50] [INFO ] Deduced a trap composed of 23 places in 330 ms of which 1 ms to minimize.
[2022-05-19 12:31:50] [INFO ] Deduced a trap composed of 25 places in 331 ms of which 1 ms to minimize.
[2022-05-19 12:31:50] [INFO ] Deduced a trap composed of 21 places in 318 ms of which 1 ms to minimize.
[2022-05-19 12:31:51] [INFO ] Deduced a trap composed of 29 places in 310 ms of which 1 ms to minimize.
[2022-05-19 12:31:51] [INFO ] Deduced a trap composed of 33 places in 308 ms of which 1 ms to minimize.
[2022-05-19 12:31:52] [INFO ] Deduced a trap composed of 33 places in 302 ms of which 1 ms to minimize.
[2022-05-19 12:31:52] [INFO ] Deduced a trap composed of 27 places in 289 ms of which 1 ms to minimize.
[2022-05-19 12:31:52] [INFO ] Deduced a trap composed of 37 places in 292 ms of which 1 ms to minimize.
[2022-05-19 12:31:53] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 1 ms to minimize.
[2022-05-19 12:31:53] [INFO ] Deduced a trap composed of 38 places in 286 ms of which 1 ms to minimize.
[2022-05-19 12:31:53] [INFO ] Deduced a trap composed of 29 places in 284 ms of which 1 ms to minimize.
[2022-05-19 12:31:54] [INFO ] Deduced a trap composed of 39 places in 273 ms of which 0 ms to minimize.
[2022-05-19 12:31:54] [INFO ] Deduced a trap composed of 29 places in 271 ms of which 1 ms to minimize.
[2022-05-19 12:31:54] [INFO ] Deduced a trap composed of 44 places in 270 ms of which 0 ms to minimize.
[2022-05-19 12:31:55] [INFO ] Deduced a trap composed of 51 places in 271 ms of which 1 ms to minimize.
[2022-05-19 12:31:55] [INFO ] Deduced a trap composed of 43 places in 267 ms of which 0 ms to minimize.
[2022-05-19 12:31:55] [INFO ] Deduced a trap composed of 43 places in 259 ms of which 1 ms to minimize.
[2022-05-19 12:31:56] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 1 ms to minimize.
[2022-05-19 12:31:56] [INFO ] Deduced a trap composed of 38 places in 264 ms of which 1 ms to minimize.
[2022-05-19 12:31:56] [INFO ] Deduced a trap composed of 37 places in 262 ms of which 1 ms to minimize.
[2022-05-19 12:31:57] [INFO ] Deduced a trap composed of 39 places in 258 ms of which 1 ms to minimize.
[2022-05-19 12:31:57] [INFO ] Deduced a trap composed of 38 places in 239 ms of which 1 ms to minimize.
[2022-05-19 12:31:57] [INFO ] Deduced a trap composed of 37 places in 238 ms of which 1 ms to minimize.
[2022-05-19 12:31:58] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 1 ms to minimize.
[2022-05-19 12:31:58] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 1 ms to minimize.
[2022-05-19 12:31:58] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 0 ms to minimize.
[2022-05-19 12:31:59] [INFO ] Deduced a trap composed of 56 places in 218 ms of which 1 ms to minimize.
[2022-05-19 12:31:59] [INFO ] Deduced a trap composed of 47 places in 211 ms of which 0 ms to minimize.
[2022-05-19 12:31:59] [INFO ] Deduced a trap composed of 53 places in 213 ms of which 0 ms to minimize.
[2022-05-19 12:31:59] [INFO ] Deduced a trap composed of 46 places in 210 ms of which 0 ms to minimize.
[2022-05-19 12:32:00] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 1 ms to minimize.
[2022-05-19 12:32:00] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 1 ms to minimize.
[2022-05-19 12:32:00] [INFO ] Deduced a trap composed of 48 places in 194 ms of which 3 ms to minimize.
[2022-05-19 12:32:00] [INFO ] Deduced a trap composed of 55 places in 187 ms of which 1 ms to minimize.
[2022-05-19 12:32:01] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 0 ms to minimize.
[2022-05-19 12:32:01] [INFO ] Deduced a trap composed of 51 places in 185 ms of which 0 ms to minimize.
[2022-05-19 12:32:01] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 1 ms to minimize.
[2022-05-19 12:32:01] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 1 ms to minimize.
[2022-05-19 12:32:02] [INFO ] Deduced a trap composed of 51 places in 176 ms of which 0 ms to minimize.
[2022-05-19 12:32:02] [INFO ] Deduced a trap composed of 53 places in 168 ms of which 0 ms to minimize.
[2022-05-19 12:32:02] [INFO ] Deduced a trap composed of 49 places in 165 ms of which 1 ms to minimize.
[2022-05-19 12:32:02] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 1 ms to minimize.
[2022-05-19 12:32:03] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 0 ms to minimize.
[2022-05-19 12:32:03] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 1 ms to minimize.
[2022-05-19 12:32:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 12:32:03] [INFO ] After 25087ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 2361 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Drop transitions removed 478 transitions
Trivial Post-agglo rules discarded 478 transitions
Performed 478 trivial Post agglomeration. Transition count delta: 478
Iterating post reduction 0 with 478 rules applied. Total rules applied 478 place count 2361 transition count 1683
Reduce places removed 478 places and 0 transitions.
Iterating post reduction 1 with 478 rules applied. Total rules applied 956 place count 1883 transition count 1683
Performed 321 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 321 Pre rules applied. Total rules applied 956 place count 1883 transition count 1362
Deduced a syphon composed of 321 places in 2 ms
Reduce places removed 321 places and 0 transitions.
Iterating global reduction 2 with 642 rules applied. Total rules applied 1598 place count 1562 transition count 1362
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 1 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 2 with 1360 rules applied. Total rules applied 2958 place count 882 transition count 682
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2959 place count 882 transition count 681
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 2961 place count 881 transition count 680
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 3163 place count 780 transition count 746
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
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 3197 place count 763 transition count 757
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3198 place count 763 transition count 756
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 3238 place count 763 transition count 756
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3239 place count 762 transition count 755
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3241 place count 760 transition count 755
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3241 place count 760 transition count 754
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3243 place count 759 transition count 754
Applied a total of 3243 rules in 296 ms. Remains 759 /2361 variables (removed 1602) and now considering 754/2161 (removed 1407) transitions.
Finished structural reductions, in 1 iterations. Remains : 759/2361 places, 754/2161 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 262044 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 262044 steps, saw 167294 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 759 cols
[2022-05-19 12:32:06] [INFO ] Computed 359 place invariants in 2 ms
[2022-05-19 12:32:06] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:32:06] [INFO ] [Nat]Absence check using 359 positive place invariants in 44 ms returned sat
[2022-05-19 12:32:07] [INFO ] After 237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:32:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:32:07] [INFO ] After 28ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:32:07] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-19 12:32:07] [INFO ] After 482ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 759 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 759/759 places, 754/754 transitions.
Applied a total of 0 rules in 11 ms. Remains 759 /759 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 759/759 places, 754/754 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 759/759 places, 754/754 transitions.
Applied a total of 0 rules in 10 ms. Remains 759 /759 variables (removed 0) and now considering 754/754 (removed 0) transitions.
// Phase 1: matrix 754 rows 759 cols
[2022-05-19 12:32:07] [INFO ] Computed 359 place invariants in 1 ms
[2022-05-19 12:32:07] [INFO ] Implicit Places using invariants in 383 ms returned [748]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 384 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 758/759 places, 754/754 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 757 transition count 753
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 757 transition count 753
Applied a total of 2 rules in 19 ms. Remains 757 /758 variables (removed 1) and now considering 753/754 (removed 1) transitions.
// Phase 1: matrix 753 rows 757 cols
[2022-05-19 12:32:07] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:32:08] [INFO ] Implicit Places using invariants in 372 ms returned []
// Phase 1: matrix 753 rows 757 cols
[2022-05-19 12:32:08] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:32:08] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 1033 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 757/759 places, 753/754 transitions.
Finished structural reductions, in 2 iterations. Remains : 757/759 places, 753/754 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 270293 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 270293 steps, saw 172729 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 753 rows 757 cols
[2022-05-19 12:32:11] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:32:12] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:32:12] [INFO ] [Nat]Absence check using 358 positive place invariants in 43 ms returned sat
[2022-05-19 12:32:12] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:32:12] [INFO ] After 286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-05-19 12:32:12] [INFO ] After 452ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 757/757 places, 753/753 transitions.
Applied a total of 0 rules in 10 ms. Remains 757 /757 variables (removed 0) and now considering 753/753 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 757/757 places, 753/753 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 757/757 places, 753/753 transitions.
Applied a total of 0 rules in 10 ms. Remains 757 /757 variables (removed 0) and now considering 753/753 (removed 0) transitions.
// Phase 1: matrix 753 rows 757 cols
[2022-05-19 12:32:12] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:32:12] [INFO ] Implicit Places using invariants in 344 ms returned []
// Phase 1: matrix 753 rows 757 cols
[2022-05-19 12:32:12] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:32:13] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
[2022-05-19 12:32:13] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 753 rows 757 cols
[2022-05-19 12:32:13] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:32:13] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 757/757 places, 753/753 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 757 transition count 753
Applied a total of 80 rules in 20 ms. Remains 757 /757 variables (removed 0) and now considering 753/753 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 753 rows 757 cols
[2022-05-19 12:32:13] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:32:13] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:32:14] [INFO ] [Nat]Absence check using 358 positive place invariants in 43 ms returned sat
[2022-05-19 12:32:14] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:32:14] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-19 12:32:14] [INFO ] After 81ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:32:14] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-05-19 12:32:14] [INFO ] After 543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:32:14] [INFO ] Flatten gal took : 23 ms
[2022-05-19 12:32:14] [INFO ] Flatten gal took : 22 ms
[2022-05-19 12:32:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12390262188374576460.gal : 2 ms
[2022-05-19 12:32:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6360063909746104202.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2250987747927067068;'/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/ReachabilityCardinality12390262188374576460.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6360063909746104202.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/ReachabilityCardinality6360063909746104202.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 70
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :70 after 137
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :137 after 330
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :330 after 4966
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4966 after 65809
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :65809 after 7.63222e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.63222e+06 after 5.46286e+07
Reachability property apf1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 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,7.28345e+10,0.498557,17600,2,3375,16,47981,6,0,3745,71603,0
Total reachable state count : 72834493829
Verifying 1 reachability properties.
Reachability property apf1 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
apf1,1.81597e+10,0.500617,17864,2,2379,16,47981,7,0,3748,71603,0
Knowledge obtained : [(AND p0 p1), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 534 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 2361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Applied a total of 0 rules in 110 ms. Remains 2361 /2361 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:32:15] [INFO ] Computed 361 place invariants in 13 ms
[2022-05-19 12:32:16] [INFO ] Implicit Places using invariants in 619 ms returned []
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:32:16] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 12:32:18] [INFO ] Implicit Places using invariants and state equation in 2069 ms returned []
Implicit Place search using SMT with State Equation took 2689 ms to find 0 implicit places.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:32:18] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:32:19] [INFO ] Dead Transitions using invariants and state equation in 1115 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2361/2361 places, 2161/2161 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 p0 p1), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:32:20] [INFO ] Computed 361 place invariants in 13 ms
[2022-05-19 12:32:20] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:32:20] [INFO ] [Nat]Absence check using 361 positive place invariants in 115 ms returned sat
[2022-05-19 12:32:21] [INFO ] After 965ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:32:22] [INFO ] Deduced a trap composed of 19 places in 438 ms of which 1 ms to minimize.
[2022-05-19 12:32:22] [INFO ] Deduced a trap composed of 21 places in 451 ms of which 1 ms to minimize.
[2022-05-19 12:32:23] [INFO ] Deduced a trap composed of 16 places in 438 ms of which 1 ms to minimize.
[2022-05-19 12:32:23] [INFO ] Deduced a trap composed of 26 places in 421 ms of which 1 ms to minimize.
[2022-05-19 12:32:24] [INFO ] Deduced a trap composed of 18 places in 410 ms of which 1 ms to minimize.
[2022-05-19 12:32:24] [INFO ] Deduced a trap composed of 31 places in 399 ms of which 1 ms to minimize.
[2022-05-19 12:32:25] [INFO ] Deduced a trap composed of 25 places in 402 ms of which 1 ms to minimize.
[2022-05-19 12:32:25] [INFO ] Deduced a trap composed of 30 places in 396 ms of which 1 ms to minimize.
[2022-05-19 12:32:26] [INFO ] Deduced a trap composed of 23 places in 393 ms of which 1 ms to minimize.
[2022-05-19 12:32:26] [INFO ] Deduced a trap composed of 22 places in 389 ms of which 1 ms to minimize.
[2022-05-19 12:32:27] [INFO ] Deduced a trap composed of 23 places in 394 ms of which 1 ms to minimize.
[2022-05-19 12:32:27] [INFO ] Deduced a trap composed of 28 places in 378 ms of which 1 ms to minimize.
[2022-05-19 12:32:27] [INFO ] Deduced a trap composed of 33 places in 376 ms of which 1 ms to minimize.
[2022-05-19 12:32:28] [INFO ] Deduced a trap composed of 31 places in 383 ms of which 1 ms to minimize.
[2022-05-19 12:32:28] [INFO ] Deduced a trap composed of 28 places in 372 ms of which 1 ms to minimize.
[2022-05-19 12:32:29] [INFO ] Deduced a trap composed of 31 places in 377 ms of which 1 ms to minimize.
[2022-05-19 12:32:29] [INFO ] Deduced a trap composed of 28 places in 358 ms of which 1 ms to minimize.
[2022-05-19 12:32:30] [INFO ] Deduced a trap composed of 19 places in 347 ms of which 1 ms to minimize.
[2022-05-19 12:32:30] [INFO ] Deduced a trap composed of 21 places in 354 ms of which 1 ms to minimize.
[2022-05-19 12:32:30] [INFO ] Deduced a trap composed of 24 places in 332 ms of which 1 ms to minimize.
[2022-05-19 12:32:31] [INFO ] Deduced a trap composed of 40 places in 330 ms of which 1 ms to minimize.
[2022-05-19 12:32:31] [INFO ] Deduced a trap composed of 32 places in 328 ms of which 1 ms to minimize.
[2022-05-19 12:32:32] [INFO ] Deduced a trap composed of 23 places in 326 ms of which 1 ms to minimize.
[2022-05-19 12:32:32] [INFO ] Deduced a trap composed of 25 places in 329 ms of which 1 ms to minimize.
[2022-05-19 12:32:32] [INFO ] Deduced a trap composed of 21 places in 311 ms of which 1 ms to minimize.
[2022-05-19 12:32:33] [INFO ] Deduced a trap composed of 29 places in 304 ms of which 1 ms to minimize.
[2022-05-19 12:32:33] [INFO ] Deduced a trap composed of 33 places in 309 ms of which 1 ms to minimize.
[2022-05-19 12:32:34] [INFO ] Deduced a trap composed of 33 places in 310 ms of which 1 ms to minimize.
[2022-05-19 12:32:34] [INFO ] Deduced a trap composed of 27 places in 288 ms of which 1 ms to minimize.
[2022-05-19 12:32:34] [INFO ] Deduced a trap composed of 37 places in 289 ms of which 1 ms to minimize.
[2022-05-19 12:32:35] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 1 ms to minimize.
[2022-05-19 12:32:35] [INFO ] Deduced a trap composed of 38 places in 288 ms of which 1 ms to minimize.
[2022-05-19 12:32:35] [INFO ] Deduced a trap composed of 29 places in 281 ms of which 1 ms to minimize.
[2022-05-19 12:32:36] [INFO ] Deduced a trap composed of 39 places in 276 ms of which 1 ms to minimize.
[2022-05-19 12:32:36] [INFO ] Deduced a trap composed of 29 places in 270 ms of which 1 ms to minimize.
[2022-05-19 12:32:36] [INFO ] Deduced a trap composed of 44 places in 278 ms of which 0 ms to minimize.
[2022-05-19 12:32:37] [INFO ] Deduced a trap composed of 51 places in 261 ms of which 1 ms to minimize.
[2022-05-19 12:32:37] [INFO ] Deduced a trap composed of 43 places in 265 ms of which 1 ms to minimize.
[2022-05-19 12:32:37] [INFO ] Deduced a trap composed of 43 places in 262 ms of which 1 ms to minimize.
[2022-05-19 12:32:38] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 1 ms to minimize.
[2022-05-19 12:32:38] [INFO ] Deduced a trap composed of 38 places in 248 ms of which 1 ms to minimize.
[2022-05-19 12:32:38] [INFO ] Deduced a trap composed of 37 places in 248 ms of which 0 ms to minimize.
[2022-05-19 12:32:39] [INFO ] Deduced a trap composed of 39 places in 249 ms of which 0 ms to minimize.
[2022-05-19 12:32:39] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 1 ms to minimize.
[2022-05-19 12:32:39] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 1 ms to minimize.
[2022-05-19 12:32:40] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 1 ms to minimize.
[2022-05-19 12:32:40] [INFO ] Deduced a trap composed of 48 places in 226 ms of which 0 ms to minimize.
[2022-05-19 12:32:40] [INFO ] Deduced a trap composed of 39 places in 223 ms of which 1 ms to minimize.
[2022-05-19 12:32:41] [INFO ] Deduced a trap composed of 56 places in 221 ms of which 0 ms to minimize.
[2022-05-19 12:32:41] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 1 ms to minimize.
[2022-05-19 12:32:41] [INFO ] Deduced a trap composed of 53 places in 213 ms of which 1 ms to minimize.
[2022-05-19 12:32:41] [INFO ] Deduced a trap composed of 46 places in 210 ms of which 1 ms to minimize.
[2022-05-19 12:32:42] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 1 ms to minimize.
[2022-05-19 12:32:42] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 0 ms to minimize.
[2022-05-19 12:32:42] [INFO ] Deduced a trap composed of 48 places in 191 ms of which 1 ms to minimize.
[2022-05-19 12:32:42] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 1 ms to minimize.
[2022-05-19 12:32:43] [INFO ] Deduced a trap composed of 50 places in 187 ms of which 1 ms to minimize.
[2022-05-19 12:32:43] [INFO ] Deduced a trap composed of 51 places in 187 ms of which 0 ms to minimize.
[2022-05-19 12:32:43] [INFO ] Deduced a trap composed of 48 places in 182 ms of which 1 ms to minimize.
[2022-05-19 12:32:43] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 0 ms to minimize.
[2022-05-19 12:32:44] [INFO ] Deduced a trap composed of 51 places in 171 ms of which 1 ms to minimize.
[2022-05-19 12:32:44] [INFO ] Deduced a trap composed of 53 places in 171 ms of which 1 ms to minimize.
[2022-05-19 12:32:44] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 1 ms to minimize.
[2022-05-19 12:32:44] [INFO ] Deduced a trap composed of 54 places in 163 ms of which 0 ms to minimize.
[2022-05-19 12:32:45] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 0 ms to minimize.
[2022-05-19 12:32:45] [INFO ] Deduced a trap composed of 58 places in 157 ms of which 0 ms to minimize.
[2022-05-19 12:32:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 12:32:45] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 2361 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Drop transitions removed 478 transitions
Trivial Post-agglo rules discarded 478 transitions
Performed 478 trivial Post agglomeration. Transition count delta: 478
Iterating post reduction 0 with 478 rules applied. Total rules applied 478 place count 2361 transition count 1683
Reduce places removed 478 places and 0 transitions.
Iterating post reduction 1 with 478 rules applied. Total rules applied 956 place count 1883 transition count 1683
Performed 321 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 321 Pre rules applied. Total rules applied 956 place count 1883 transition count 1362
Deduced a syphon composed of 321 places in 2 ms
Reduce places removed 321 places and 0 transitions.
Iterating global reduction 2 with 642 rules applied. Total rules applied 1598 place count 1562 transition count 1362
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 0 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 2 with 1360 rules applied. Total rules applied 2958 place count 882 transition count 682
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2959 place count 882 transition count 681
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 2961 place count 881 transition count 680
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3163 place count 780 transition count 746
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
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 3197 place count 763 transition count 757
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3198 place count 763 transition count 756
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 3238 place count 763 transition count 756
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3239 place count 762 transition count 755
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3241 place count 760 transition count 755
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3241 place count 760 transition count 754
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3243 place count 759 transition count 754
Applied a total of 3243 rules in 241 ms. Remains 759 /2361 variables (removed 1602) and now considering 754/2161 (removed 1407) transitions.
Finished structural reductions, in 1 iterations. Remains : 759/2361 places, 754/2161 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 263910 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 263910 steps, saw 168518 distinct states, run finished after 3002 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 759 cols
[2022-05-19 12:32:48] [INFO ] Computed 359 place invariants in 3 ms
[2022-05-19 12:32:48] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:32:49] [INFO ] [Nat]Absence check using 359 positive place invariants in 61 ms returned sat
[2022-05-19 12:32:49] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:32:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:32:49] [INFO ] After 24ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:32:49] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-19 12:32:49] [INFO ] After 490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 759 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 759/759 places, 754/754 transitions.
Applied a total of 0 rules in 12 ms. Remains 759 /759 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 759/759 places, 754/754 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 759/759 places, 754/754 transitions.
Applied a total of 0 rules in 10 ms. Remains 759 /759 variables (removed 0) and now considering 754/754 (removed 0) transitions.
// Phase 1: matrix 754 rows 759 cols
[2022-05-19 12:32:49] [INFO ] Computed 359 place invariants in 2 ms
[2022-05-19 12:32:49] [INFO ] Implicit Places using invariants in 361 ms returned [748]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 362 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 758/759 places, 754/754 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 757 transition count 753
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 757 transition count 753
Applied a total of 2 rules in 18 ms. Remains 757 /758 variables (removed 1) and now considering 753/754 (removed 1) transitions.
// Phase 1: matrix 753 rows 757 cols
[2022-05-19 12:32:49] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:32:50] [INFO ] Implicit Places using invariants in 358 ms returned []
// Phase 1: matrix 753 rows 757 cols
[2022-05-19 12:32:50] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:32:50] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 757/759 places, 753/754 transitions.
Finished structural reductions, in 2 iterations. Remains : 757/759 places, 753/754 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 264874 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 264874 steps, saw 169327 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 753 rows 757 cols
[2022-05-19 12:32:53] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:32:54] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:32:54] [INFO ] [Nat]Absence check using 358 positive place invariants in 44 ms returned sat
[2022-05-19 12:32:54] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:32:54] [INFO ] After 299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-19 12:32:54] [INFO ] After 462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 757/757 places, 753/753 transitions.
Applied a total of 0 rules in 10 ms. Remains 757 /757 variables (removed 0) and now considering 753/753 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 757/757 places, 753/753 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 757/757 places, 753/753 transitions.
Applied a total of 0 rules in 10 ms. Remains 757 /757 variables (removed 0) and now considering 753/753 (removed 0) transitions.
// Phase 1: matrix 753 rows 757 cols
[2022-05-19 12:32:54] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:32:54] [INFO ] Implicit Places using invariants in 363 ms returned []
// Phase 1: matrix 753 rows 757 cols
[2022-05-19 12:32:54] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:32:55] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 1033 ms to find 0 implicit places.
[2022-05-19 12:32:55] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 753 rows 757 cols
[2022-05-19 12:32:55] [INFO ] Computed 358 place invariants in 0 ms
[2022-05-19 12:32:55] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 757/757 places, 753/753 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 757 transition count 753
Applied a total of 80 rules in 20 ms. Remains 757 /757 variables (removed 0) and now considering 753/753 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 753 rows 757 cols
[2022-05-19 12:32:55] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:32:55] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:32:56] [INFO ] [Nat]Absence check using 358 positive place invariants in 43 ms returned sat
[2022-05-19 12:32:56] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:32:56] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-19 12:32:56] [INFO ] After 85ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:32:56] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-05-19 12:32:56] [INFO ] After 557ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:32:56] [INFO ] Flatten gal took : 23 ms
[2022-05-19 12:32:56] [INFO ] Flatten gal took : 23 ms
[2022-05-19 12:32:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15175790554372193256.gal : 3 ms
[2022-05-19 12:32:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7074619954845469188.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms15023518133775504449;'/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/ReachabilityCardinality15175790554372193256.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7074619954845469188.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/ReachabilityCardinality7074619954845469188.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 70
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :70 after 137
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :137 after 330
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :330 after 4966
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4966 after 65809
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :65809 after 7.63222e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.63222e+06 after 5.46286e+07
Reachability property apf1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 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,7.28345e+10,0.529595,17596,2,3375,16,47981,6,0,3745,71603,0
Total reachable state count : 72834493829
Verifying 1 reachability properties.
Reachability property apf1 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
apf1,1.81597e+10,0.531739,17860,2,2379,16,47981,7,0,3748,71603,0
Knowledge obtained : [(AND p0 p1), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 540 ms.
Product exploration explored 100000 steps with 0 reset in 733 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 2361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 478 rules applied. Total rules applied 478 place count 2361 transition count 2161
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 161 Pre rules applied. Total rules applied 478 place count 2361 transition count 2282
Deduced a syphon composed of 639 places in 3 ms
Iterating global reduction 1 with 161 rules applied. Total rules applied 639 place count 2361 transition count 2282
Performed 797 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1436 places in 2 ms
Iterating global reduction 1 with 797 rules applied. Total rules applied 1436 place count 2361 transition count 2282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1437 place count 2361 transition count 2281
Renaming transitions due to excessive name length > 1024 char.
Discarding 319 places :
Symmetric choice reduction at 2 with 319 rule applications. Total rules 1756 place count 2042 transition count 1962
Deduced a syphon composed of 1117 places in 2 ms
Iterating global reduction 2 with 319 rules applied. Total rules applied 2075 place count 2042 transition count 1962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1118 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2076 place count 2042 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2078 place count 2040 transition count 1960
Deduced a syphon composed of 1116 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2080 place count 2040 transition count 1960
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -523
Deduced a syphon composed of 1217 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2181 place count 2040 transition count 2483
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2282 place count 1939 transition count 2281
Deduced a syphon composed of 1116 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2383 place count 1939 transition count 2281
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -307
Deduced a syphon composed of 1173 places in 2 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2440 place count 1939 transition count 2588
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 2497 place count 1882 transition count 2474
Deduced a syphon composed of 1116 places in 2 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2554 place count 1882 transition count 2474
Deduced a syphon composed of 1116 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2563 place count 1882 transition count 2465
Deduced a syphon composed of 1116 places in 2 ms
Applied a total of 2563 rules in 784 ms. Remains 1882 /2361 variables (removed 479) and now considering 2465/2161 (removed -304) transitions.
[2022-05-19 12:32:59] [INFO ] Redundant transitions in 42 ms returned []
// Phase 1: matrix 2465 rows 1882 cols
[2022-05-19 12:32:59] [INFO ] Computed 361 place invariants in 20 ms
[2022-05-19 12:33:01] [INFO ] Dead Transitions using invariants and state equation in 1106 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1882/2361 places, 2465/2161 transitions.
Finished structural reductions, in 1 iterations. Remains : 1882/2361 places, 2465/2161 transitions.
Product exploration explored 100000 steps with 0 reset in 628 ms.
Product exploration explored 100000 steps with 0 reset in 783 ms.
Built C files in :
/tmp/ltsmin2925593721269311879
[2022-05-19 12:33:02] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2925593721269311879
Running compilation step : cd /tmp/ltsmin2925593721269311879;'/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/ltsmin2925593721269311879;'/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/ltsmin2925593721269311879;'/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 3 out of 2361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Applied a total of 0 rules in 108 ms. Remains 2361 /2361 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:33:05] [INFO ] Computed 361 place invariants in 11 ms
[2022-05-19 12:33:06] [INFO ] Implicit Places using invariants in 671 ms returned []
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:33:06] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:33:08] [INFO ] Implicit Places using invariants and state equation in 2106 ms returned []
Implicit Place search using SMT with State Equation took 2793 ms to find 0 implicit places.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:33:08] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:33:09] [INFO ] Dead Transitions using invariants and state equation in 1187 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2361/2361 places, 2161/2161 transitions.
Built C files in :
/tmp/ltsmin9668174790714428846
[2022-05-19 12:33:09] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9668174790714428846
Running compilation step : cd /tmp/ltsmin9668174790714428846;'/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/ltsmin9668174790714428846;'/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/ltsmin9668174790714428846;'/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-19 12:33:12] [INFO ] Flatten gal took : 61 ms
[2022-05-19 12:33:12] [INFO ] Flatten gal took : 45 ms
[2022-05-19 12:33:12] [INFO ] Time to serialize gal into /tmp/LTL15208689142951054824.gal : 5 ms
[2022-05-19 12:33:12] [INFO ] Time to serialize properties into /tmp/LTL6158021612180996657.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/LTL15208689142951054824.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6158021612180996657.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/LTL1520868...267
Read 1 LTL properties
Checking formula 0 : !((F((X((X("((p2==0)||(p2525==1))"))&&("((p2==0)||(p2525==1))")))&&(G(F(G(F(G("(p313==0)")))))))))
Formula 0 simplified : !F(X("((p2==0)||(p2525==1))" & X"((p2==0)||(p2525==1))") & GFGFG"(p313==0)")
Detected timeout of ITS tools.
[2022-05-19 12:33:27] [INFO ] Flatten gal took : 46 ms
[2022-05-19 12:33:27] [INFO ] Applying decomposition
[2022-05-19 12:33:27] [INFO ] Flatten gal took : 50 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/graph16215905491188090406.txt' '-o' '/tmp/graph16215905491188090406.bin' '-w' '/tmp/graph16215905491188090406.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16215905491188090406.bin' '-l' '-1' '-v' '-w' '/tmp/graph16215905491188090406.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:33:28] [INFO ] Decomposing Gal with order
[2022-05-19 12:33:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:33:28] [INFO ] Removed a total of 402 redundant transitions.
[2022-05-19 12:33:28] [INFO ] Flatten gal took : 86 ms
[2022-05-19 12:33:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-19 12:33:28] [INFO ] Time to serialize gal into /tmp/LTL3543430303490705718.gal : 11 ms
[2022-05-19 12:33:28] [INFO ] Time to serialize properties into /tmp/LTL15278440931538949955.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/LTL3543430303490705718.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15278440931538949955.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/LTL3543430...246
Read 1 LTL properties
Checking formula 0 : !((F((X((X("((i36.u1.p2==0)||(i35.u789.p2525==1))"))&&("((i36.u1.p2==0)||(i35.u789.p2525==1))")))&&(G(F(G(F(G("(i5.u106.p313==0)")))))...159
Formula 0 simplified : !F(X("((i36.u1.p2==0)||(i35.u789.p2525==1))" & X"((i36.u1.p2==0)||(i35.u789.p2525==1))") & GFGFG"(i5.u106.p313==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9690853631032234506
[2022-05-19 12:33:43] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9690853631032234506
Running compilation step : cd /tmp/ltsmin9690853631032234506;'/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/ltsmin9690853631032234506;'/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/ltsmin9690853631032234506;'/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 ShieldIIPt-PT-040B-LTLCardinality-12 finished in 135372 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 2368 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2367 transition count 1688
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1888 transition count 1688
Performed 316 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 316 Pre rules applied. Total rules applied 958 place count 1888 transition count 1372
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 1590 place count 1572 transition count 1372
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1596 place count 1566 transition count 1366
Iterating global reduction 2 with 6 rules applied. Total rules applied 1602 place count 1566 transition count 1366
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1602 place count 1566 transition count 1361
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1612 place count 1561 transition count 1361
Performed 674 Post agglomeration using F-continuation condition.Transition count delta: 674
Deduced a syphon composed of 674 places in 1 ms
Reduce places removed 674 places and 0 transitions.
Iterating global reduction 2 with 1348 rules applied. Total rules applied 2960 place count 887 transition count 687
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2961 place count 887 transition count 686
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 2963 place count 886 transition count 685
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 3165 place count 785 transition count 751
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
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 3201 place count 767 transition count 764
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3203 place count 765 transition count 762
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3204 place count 764 transition count 762
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3204 place count 764 transition count 761
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3206 place count 763 transition count 761
Applied a total of 3206 rules in 369 ms. Remains 763 /2368 variables (removed 1605) and now considering 761/2168 (removed 1407) transitions.
// Phase 1: matrix 761 rows 763 cols
[2022-05-19 12:33:46] [INFO ] Computed 360 place invariants in 1 ms
[2022-05-19 12:33:47] [INFO ] Implicit Places using invariants in 447 ms returned [749]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 463 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 762/2368 places, 761/2168 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 761 transition count 760
Applied a total of 2 rules in 20 ms. Remains 761 /762 variables (removed 1) and now considering 760/761 (removed 1) transitions.
// Phase 1: matrix 760 rows 761 cols
[2022-05-19 12:33:47] [INFO ] Computed 359 place invariants in 2 ms
[2022-05-19 12:33:47] [INFO ] Implicit Places using invariants in 385 ms returned []
// Phase 1: matrix 760 rows 761 cols
[2022-05-19 12:33:47] [INFO ] Computed 359 place invariants in 1 ms
[2022-05-19 12:33:48] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 761/2368 places, 760/2168 transitions.
Finished structural reductions, in 2 iterations. Remains : 761/2368 places, 760/2168 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s383 0) (EQ s752 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12271 reset in 618 ms.
Product exploration explored 100000 steps with 12406 reset in 730 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 761 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 761/761 places, 760/760 transitions.
Applied a total of 0 rules in 11 ms. Remains 761 /761 variables (removed 0) and now considering 760/760 (removed 0) transitions.
// Phase 1: matrix 760 rows 761 cols
[2022-05-19 12:33:50] [INFO ] Computed 359 place invariants in 3 ms
[2022-05-19 12:33:50] [INFO ] Implicit Places using invariants in 359 ms returned []
// Phase 1: matrix 760 rows 761 cols
[2022-05-19 12:33:50] [INFO ] Computed 359 place invariants in 1 ms
[2022-05-19 12:33:51] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 1064 ms to find 0 implicit places.
[2022-05-19 12:33:51] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 760 rows 761 cols
[2022-05-19 12:33:51] [INFO ] Computed 359 place invariants in 1 ms
[2022-05-19 12:33:51] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 761/761 places, 760/760 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12304 reset in 603 ms.
Product exploration explored 100000 steps with 12320 reset in 734 ms.
Built C files in :
/tmp/ltsmin6325616409831100374
[2022-05-19 12:33:53] [INFO ] Computing symmetric may disable matrix : 760 transitions.
[2022-05-19 12:33:53] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:33:53] [INFO ] Computing symmetric may enable matrix : 760 transitions.
[2022-05-19 12:33:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:33:53] [INFO ] Computing Do-Not-Accords matrix : 760 transitions.
[2022-05-19 12:33:53] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:33:53] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6325616409831100374
Running compilation step : cd /tmp/ltsmin6325616409831100374;'/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 1947 ms.
Running link step : cd /tmp/ltsmin6325616409831100374;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin6325616409831100374;'/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/stateBased15897061001112137803.hoa' '--buchi-type=spotba'
LTSmin run took 5248 ms.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-13 finished in 14417 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&F(X(p0))))'
Support contains 2 out of 2368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2361 transition count 2161
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2361 transition count 2161
Applied a total of 14 rules in 221 ms. Remains 2361 /2368 variables (removed 7) and now considering 2161/2168 (removed 7) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:34:01] [INFO ] Computed 361 place invariants in 12 ms
[2022-05-19 12:34:01] [INFO ] Implicit Places using invariants in 635 ms returned []
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:34:01] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:34:03] [INFO ] Implicit Places using invariants and state equation in 2118 ms returned []
Implicit Place search using SMT with State Equation took 2753 ms to find 0 implicit places.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:34:03] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:34:04] [INFO ] Dead Transitions using invariants and state equation in 1147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2368 places, 2161/2168 transitions.
Finished structural reductions, in 1 iterations. Remains : 2361/2368 places, 2161/2168 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s81 0) (EQ s1648 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1397 ms.
Product exploration explored 100000 steps with 50000 reset in 1389 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 54 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-15 finished in 7073 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))&&p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((X(p0)&&p0))&&G(F(G(F(G(p1))))))))'
Found a CL insensitive property : ShieldIIPt-PT-040B-LTLCardinality-12
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 2368 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 478 transitions
Trivial Post-agglo rules discarded 478 transitions
Performed 478 trivial Post agglomeration. Transition count delta: 478
Iterating post reduction 0 with 478 rules applied. Total rules applied 478 place count 2367 transition count 1689
Reduce places removed 478 places and 0 transitions.
Iterating post reduction 1 with 478 rules applied. Total rules applied 956 place count 1889 transition count 1689
Performed 316 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 316 Pre rules applied. Total rules applied 956 place count 1889 transition count 1373
Deduced a syphon composed of 316 places in 1 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 2 with 632 rules applied. Total rules applied 1588 place count 1573 transition count 1373
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1594 place count 1567 transition count 1367
Iterating global reduction 2 with 6 rules applied. Total rules applied 1600 place count 1567 transition count 1367
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1600 place count 1567 transition count 1362
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1610 place count 1562 transition count 1362
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 2964 place count 885 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2965 place count 885 transition count 684
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 2967 place count 884 transition count 683
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 3169 place count 783 transition count 749
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
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 3203 place count 766 transition count 760
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3204 place count 765 transition count 759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3206 place count 763 transition count 759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3206 place count 763 transition count 758
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 3208 place count 762 transition count 758
Applied a total of 3208 rules in 311 ms. Remains 762 /2368 variables (removed 1606) and now considering 758/2168 (removed 1410) transitions.
// Phase 1: matrix 758 rows 762 cols
[2022-05-19 12:34:08] [INFO ] Computed 359 place invariants in 2 ms
[2022-05-19 12:34:08] [INFO ] Implicit Places using invariants in 366 ms returned [751]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 369 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 761/2368 places, 758/2168 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 760 transition count 757
Applied a total of 2 rules in 20 ms. Remains 760 /761 variables (removed 1) and now considering 757/758 (removed 1) transitions.
// Phase 1: matrix 757 rows 760 cols
[2022-05-19 12:34:08] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:34:09] [INFO ] Implicit Places using invariants in 364 ms returned []
// Phase 1: matrix 757 rows 760 cols
[2022-05-19 12:34:09] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:34:09] [INFO ] State equation strengthened by 345 read => feed constraints.
[2022-05-19 12:34:12] [INFO ] Implicit Places using invariants and state equation in 3115 ms returned []
Implicit Place search using SMT with State Equation took 3479 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 760/2368 places, 757/2168 transitions.
Finished structural reductions, in 2 iterations. Remains : 760/2368 places, 757/2168 transitions.
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s690 1)), p1:(EQ s81 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-12 finished in 4405 ms.
CL/SL decision was in the wrong direction : CL + false
[2022-05-19 12:34:12] [INFO ] Flatten gal took : 47 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1226008330653635324
[2022-05-19 12:34:12] [INFO ] Too many transitions (2168) to apply POR reductions. Disabling POR matrices.
[2022-05-19 12:34:12] [INFO ] Applying decomposition
[2022-05-19 12:34:12] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1226008330653635324
Running compilation step : cd /tmp/ltsmin1226008330653635324;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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-19 12:34:12] [INFO ] Flatten gal took : 47 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/graph730796428441481467.txt' '-o' '/tmp/graph730796428441481467.bin' '-w' '/tmp/graph730796428441481467.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph730796428441481467.bin' '-l' '-1' '-v' '-w' '/tmp/graph730796428441481467.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:34:12] [INFO ] Decomposing Gal with order
[2022-05-19 12:34:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:34:12] [INFO ] Removed a total of 396 redundant transitions.
[2022-05-19 12:34:12] [INFO ] Flatten gal took : 83 ms
[2022-05-19 12:34:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-19 12:34:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality1188842018785864626.gal : 11 ms
[2022-05-19 12:34:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality1966688393873483412.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/LTLCardinality1188842018785864626.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1966688393873483412.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/LTLCardina...267
Read 2 LTL properties
Checking formula 0 : !((X((G(X("(((i7.u145.p436==0)||(i19.u437.p1379==1))&&((i20.u459.p1450==0)||(i20.u459.p1450==1)))")))&&("((i33.u771.p2439==0)||(i13.u2...172
Formula 0 simplified : !X("((i33.u771.p2439==0)||(i13.u289.p909==1))" & GX"(((i7.u145.p436==0)||(i19.u437.p1379==1))&&((i20.u459.p1450==0)||(i20.u459.p1450...163
Compilation finished in 4282 ms.
Running link step : cd /tmp/ltsmin1226008330653635324;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1226008330653635324;'/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(([](X((LTLAPp0==true)))&&(LTLAPp1==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.027: LTL layer: formula: X(([](X((LTLAPp0==true)))&&(LTLAPp1==true)))
pins2lts-mc-linux64( 4/ 8), 0.027: "X(([](X((LTLAPp0==true)))&&(LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.036: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.107: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.508: DFS-FIFO for weak LTL, using special progress label 2173
pins2lts-mc-linux64( 0/ 8), 0.508: There are 2174 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.508: State length is 2369, there are 2174 groups
pins2lts-mc-linux64( 0/ 8), 0.508: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.508: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.508: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.508: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 1.119: ~1 levels ~960 states ~5872 transitions
pins2lts-mc-linux64( 3/ 8), 1.335: ~1 levels ~1920 states ~10432 transitions
pins2lts-mc-linux64( 3/ 8), 1.752: ~1 levels ~3840 states ~23616 transitions
pins2lts-mc-linux64( 3/ 8), 2.537: ~1 levels ~7680 states ~49864 transitions
pins2lts-mc-linux64( 3/ 8), 4.362: ~1 levels ~15360 states ~108520 transitions
pins2lts-mc-linux64( 5/ 8), 7.509: ~1 levels ~30720 states ~258408 transitions
pins2lts-mc-linux64( 5/ 8), 13.741: ~1 levels ~61440 states ~550624 transitions
pins2lts-mc-linux64( 3/ 8), 25.917: ~1 levels ~122880 states ~1073392 transitions
pins2lts-mc-linux64( 3/ 8), 50.622: ~1 levels ~245760 states ~2230552 transitions
pins2lts-mc-linux64( 3/ 8), 98.497: ~1 levels ~491520 states ~4710512 transitions
pins2lts-mc-linux64( 3/ 8), 195.432: ~1 levels ~983040 states ~9928088 transitions
pins2lts-mc-linux64( 3/ 8), 392.532: ~1 levels ~1966080 states ~21287744 transitions
pins2lts-mc-linux64( 3/ 8), 791.203: ~1 levels ~3932160 states ~44868240 transitions
pins2lts-mc-linux64( 4/ 8), 1334.567: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1334.632:
pins2lts-mc-linux64( 0/ 8), 1334.633: mean standard work distribution: 5.1% (states) 6.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 1334.635:
pins2lts-mc-linux64( 0/ 8), 1334.635: Explored 6275442 states 76663222 transitions, fanout: 12.216
pins2lts-mc-linux64( 0/ 8), 1334.635: Total exploration time 1334.110 sec (1334.030 sec minimum, 1334.075 sec on average)
pins2lts-mc-linux64( 0/ 8), 1334.635: States per second: 4704, Transitions per second: 57464
pins2lts-mc-linux64( 0/ 8), 1334.635:
pins2lts-mc-linux64( 0/ 8), 1334.635: Progress states detected: 15396136
pins2lts-mc-linux64( 0/ 8), 1334.635: Redundant explorations: -59.2403
pins2lts-mc-linux64( 0/ 8), 1334.635:
pins2lts-mc-linux64( 0/ 8), 1334.635: Queue width: 8B, total height: 15433010, memory: 117.74MB
pins2lts-mc-linux64( 0/ 8), 1334.635: Tree memory: 373.5MB, 25.4 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 1334.635: Tree fill ratio (roots/leafs): 11.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1334.637: Stored 2335 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1334.646: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1334.647: Est. total memory use: 491.2MB (~1141.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1226008330653635324;'/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(([](X((LTLAPp0==true)))&&(LTLAPp1==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1226008330653635324;'/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(([](X((LTLAPp0==true)))&&(LTLAPp1==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)
Detected timeout of ITS tools.
[2022-05-19 12:57:12] [INFO ] Applying decomposition
[2022-05-19 12:57:13] [INFO ] Flatten gal took : 280 ms
[2022-05-19 12:57:13] [INFO ] Decomposing Gal with order
[2022-05-19 12:57:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:57:14] [INFO ] Removed a total of 118 redundant transitions.
[2022-05-19 12:57:14] [INFO ] Flatten gal took : 444 ms
[2022-05-19 12:57:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 57 ms.
[2022-05-19 12:57:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality15501396324459262104.gal : 68 ms
[2022-05-19 12:57:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality17961227171608500392.ltl : 6 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/LTLCardinality15501396324459262104.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17961227171608500392.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/LTLCardina...269
Read 2 LTL properties
Checking formula 0 : !((X((G(X("(((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.i0.i0.i0.i1.i0.u141.p436==0...578
Formula 0 simplified : !X("((i0.i0.i0.i0.i0.i1.i0.u634.p2439==0)||(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.i...569
Detected timeout of ITS tools.
[2022-05-19 13:20:19] [INFO ] Flatten gal took : 233 ms
[2022-05-19 13:20:20] [INFO ] Input system was already deterministic with 2168 transitions.
[2022-05-19 13:20:21] [INFO ] Transformed 2368 places.
[2022-05-19 13:20:21] [INFO ] Transformed 2168 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 13:20:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality1868762517009399036.gal : 33 ms
[2022-05-19 13:20:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality11781359145673117208.ltl : 5 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/LTLCardinality1868762517009399036.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11781359145673117208.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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/LTLCardina...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G(X("(((p436==0)||(p1379==1))&&((p1450==0)||(p1450==1)))")))&&("((p2439==0)||(p909==1))"))))
Formula 0 simplified : !X("((p2439==0)||(p909==1))" & GX"(((p436==0)||(p1379==1))&&((p1450==0)||(p1450==1)))")
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -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="ShieldIIPt-PT-040B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-040B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025000315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-040B.tgz
mv ShieldIIPt-PT-040B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;