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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.7K Apr 29 13:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 13:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 13:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 13:38 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.5K May 9 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 955K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653033265586

Running Version 202205111006
[2022-05-20 07:54:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 07:54:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 07:54:27] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2022-05-20 07:54:27] [INFO ] Transformed 3903 places.
[2022-05-20 07:54:27] [INFO ] Transformed 3553 transitions.
[2022-05-20 07:54:27] [INFO ] Found NUPN structural information;
[2022-05-20 07:54:27] [INFO ] Parsed PT model containing 3903 places and 3553 transitions in 490 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPt-PT-050B-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 3903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Discarding 542 places :
Symmetric choice reduction at 0 with 542 rule applications. Total rules 542 place count 3361 transition count 3011
Iterating global reduction 0 with 542 rules applied. Total rules applied 1084 place count 3361 transition count 3011
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1085 place count 3360 transition count 3010
Iterating global reduction 0 with 1 rules applied. Total rules applied 1086 place count 3360 transition count 3010
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1087 place count 3359 transition count 3009
Iterating global reduction 0 with 1 rules applied. Total rules applied 1088 place count 3359 transition count 3009
Applied a total of 1088 rules in 1529 ms. Remains 3359 /3903 variables (removed 544) and now considering 3009/3553 (removed 544) transitions.
// Phase 1: matrix 3009 rows 3359 cols
[2022-05-20 07:54:29] [INFO ] Computed 551 place invariants in 50 ms
[2022-05-20 07:54:30] [INFO ] Implicit Places using invariants in 1102 ms returned []
// Phase 1: matrix 3009 rows 3359 cols
[2022-05-20 07:54:30] [INFO ] Computed 551 place invariants in 14 ms
[2022-05-20 07:54:33] [INFO ] Implicit Places using invariants and state equation in 3382 ms returned []
Implicit Place search using SMT with State Equation took 4572 ms to find 0 implicit places.
// Phase 1: matrix 3009 rows 3359 cols
[2022-05-20 07:54:33] [INFO ] Computed 551 place invariants in 15 ms
[2022-05-20 07:54:35] [INFO ] Dead Transitions using invariants and state equation in 2295 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3359/3903 places, 3009/3553 transitions.
Finished structural reductions, in 1 iterations. Remains : 3359/3903 places, 3009/3553 transitions.
Support contains 41 out of 3359 places after structural reductions.
[2022-05-20 07:54:36] [INFO ] Flatten gal took : 203 ms
[2022-05-20 07:54:36] [INFO ] Flatten gal took : 130 ms
[2022-05-20 07:54:36] [INFO ] Input system was already deterministic with 3009 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 922 ms. (steps per millisecond=10 ) properties (out of 32) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 3009 rows 3359 cols
[2022-05-20 07:54:37] [INFO ] Computed 551 place invariants in 9 ms
[2022-05-20 07:54:39] [INFO ] [Real]Absence check using 551 positive place invariants in 209 ms returned sat
[2022-05-20 07:54:40] [INFO ] After 2445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2022-05-20 07:54:41] [INFO ] [Nat]Absence check using 551 positive place invariants in 220 ms returned sat
[2022-05-20 07:54:46] [INFO ] After 3677ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2022-05-20 07:54:47] [INFO ] Deduced a trap composed of 17 places in 865 ms of which 8 ms to minimize.
[2022-05-20 07:54:48] [INFO ] Deduced a trap composed of 28 places in 837 ms of which 9 ms to minimize.
[2022-05-20 07:54:49] [INFO ] Deduced a trap composed of 18 places in 801 ms of which 5 ms to minimize.
[2022-05-20 07:54:50] [INFO ] Deduced a trap composed of 20 places in 829 ms of which 4 ms to minimize.
[2022-05-20 07:54:51] [INFO ] Deduced a trap composed of 20 places in 811 ms of which 3 ms to minimize.
[2022-05-20 07:54:52] [INFO ] Deduced a trap composed of 19 places in 820 ms of which 2 ms to minimize.
[2022-05-20 07:54:53] [INFO ] Deduced a trap composed of 25 places in 798 ms of which 3 ms to minimize.
[2022-05-20 07:54:54] [INFO ] Deduced a trap composed of 27 places in 804 ms of which 2 ms to minimize.
[2022-05-20 07:54:54] [INFO ] Deduced a trap composed of 23 places in 738 ms of which 2 ms to minimize.
[2022-05-20 07:54:55] [INFO ] Deduced a trap composed of 23 places in 780 ms of which 2 ms to minimize.
[2022-05-20 07:54:56] [INFO ] Deduced a trap composed of 29 places in 768 ms of which 2 ms to minimize.
[2022-05-20 07:54:57] [INFO ] Deduced a trap composed of 26 places in 722 ms of which 1 ms to minimize.
[2022-05-20 07:54:58] [INFO ] Deduced a trap composed of 24 places in 766 ms of which 2 ms to minimize.
[2022-05-20 07:54:59] [INFO ] Deduced a trap composed of 28 places in 765 ms of which 2 ms to minimize.
[2022-05-20 07:55:00] [INFO ] Deduced a trap composed of 24 places in 748 ms of which 2 ms to minimize.
[2022-05-20 07:55:00] [INFO ] Deduced a trap composed of 29 places in 725 ms of which 1 ms to minimize.
[2022-05-20 07:55:01] [INFO ] Deduced a trap composed of 27 places in 695 ms of which 2 ms to minimize.
[2022-05-20 07:55:02] [INFO ] Deduced a trap composed of 24 places in 700 ms of which 2 ms to minimize.
[2022-05-20 07:55:03] [INFO ] Deduced a trap composed of 28 places in 675 ms of which 1 ms to minimize.
[2022-05-20 07:55:04] [INFO ] Deduced a trap composed of 26 places in 667 ms of which 1 ms to minimize.
[2022-05-20 07:55:04] [INFO ] Deduced a trap composed of 20 places in 675 ms of which 2 ms to minimize.
[2022-05-20 07:55:05] [INFO ] Deduced a trap composed of 35 places in 684 ms of which 2 ms to minimize.
[2022-05-20 07:55:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 07:55:05] [INFO ] After 25197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:19
Parikh walk visited 0 properties in 3214 ms.
Support contains 29 out of 3359 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Drop transitions removed 686 transitions
Trivial Post-agglo rules discarded 686 transitions
Performed 686 trivial Post agglomeration. Transition count delta: 686
Iterating post reduction 0 with 686 rules applied. Total rules applied 686 place count 3359 transition count 2323
Reduce places removed 686 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 690 rules applied. Total rules applied 1376 place count 2673 transition count 2319
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1380 place count 2669 transition count 2319
Performed 393 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 393 Pre rules applied. Total rules applied 1380 place count 2669 transition count 1926
Deduced a syphon composed of 393 places in 3 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 3 with 786 rules applied. Total rules applied 2166 place count 2276 transition count 1926
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 2169 place count 2273 transition count 1923
Iterating global reduction 3 with 3 rules applied. Total rules applied 2172 place count 2273 transition count 1923
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 2172 place count 2273 transition count 1921
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2176 place count 2271 transition count 1921
Performed 843 Post agglomeration using F-continuation condition.Transition count delta: 843
Deduced a syphon composed of 843 places in 4 ms
Reduce places removed 843 places and 0 transitions.
Iterating global reduction 3 with 1686 rules applied. Total rules applied 3862 place count 1428 transition count 1078
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3863 place count 1428 transition count 1077
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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3865 place count 1427 transition count 1076
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4067 place count 1326 transition count 1076
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 4151 place count 1284 transition count 1076
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4152 place count 1284 transition count 1075
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4153 place count 1283 transition count 1075
Partial Free-agglomeration rule applied 144 times.
Drop transitions removed 144 transitions
Iterating global reduction 5 with 144 rules applied. Total rules applied 4297 place count 1283 transition count 1075
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 4298 place count 1283 transition count 1075
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4299 place count 1282 transition count 1074
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4300 place count 1281 transition count 1074
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 4300 place count 1281 transition count 1072
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 4304 place count 1279 transition count 1072
Applied a total of 4304 rules in 916 ms. Remains 1279 /3359 variables (removed 2080) and now considering 1072/3009 (removed 1937) transitions.
Finished structural reductions, in 1 iterations. Remains : 1279/3359 places, 1072/3009 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 71830 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{14=1}
Probabilistic random walk after 71830 steps, saw 47515 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :1
Running SMT prover for 17 properties.
// Phase 1: matrix 1072 rows 1279 cols
[2022-05-20 07:55:13] [INFO ] Computed 550 place invariants in 9 ms
[2022-05-20 07:55:14] [INFO ] [Real]Absence check using 550 positive place invariants in 85 ms returned sat
[2022-05-20 07:55:14] [INFO ] After 895ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2022-05-20 07:55:14] [INFO ] [Nat]Absence check using 550 positive place invariants in 85 ms returned sat
[2022-05-20 07:55:16] [INFO ] After 1141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2022-05-20 07:55:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 07:55:17] [INFO ] After 725ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2022-05-20 07:55:17] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 0 ms to minimize.
[2022-05-20 07:55:17] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2022-05-20 07:55:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 314 ms
[2022-05-20 07:55:18] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 0 ms to minimize.
[2022-05-20 07:55:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2022-05-20 07:55:18] [INFO ] After 2409ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 711 ms.
[2022-05-20 07:55:19] [INFO ] After 5222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 487 ms.
Support contains 26 out of 1279 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1279/1279 places, 1072/1072 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1279 transition count 1071
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1278 transition count 1071
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1278 transition count 1070
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1277 transition count 1070
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1276 transition count 1069
Applied a total of 6 rules in 65 ms. Remains 1276 /1279 variables (removed 3) and now considering 1069/1072 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 1276/1279 places, 1069/1072 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 75125 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75125 steps, saw 49435 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 1069 rows 1276 cols
[2022-05-20 07:55:23] [INFO ] Computed 550 place invariants in 3 ms
[2022-05-20 07:55:24] [INFO ] [Real]Absence check using 550 positive place invariants in 80 ms returned sat
[2022-05-20 07:55:25] [INFO ] After 1647ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-20 07:55:25] [INFO ] [Nat]Absence check using 550 positive place invariants in 75 ms returned sat
[2022-05-20 07:55:27] [INFO ] After 1076ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2022-05-20 07:55:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 07:55:27] [INFO ] After 695ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2022-05-20 07:55:29] [INFO ] After 1844ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 692 ms.
[2022-05-20 07:55:29] [INFO ] After 4510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 437 ms.
Support contains 25 out of 1276 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1276/1276 places, 1069/1069 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1275 transition count 1068
Applied a total of 2 rules in 54 ms. Remains 1275 /1276 variables (removed 1) and now considering 1068/1069 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1275/1276 places, 1068/1069 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 73249 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73249 steps, saw 48177 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 1068 rows 1275 cols
[2022-05-20 07:55:33] [INFO ] Computed 550 place invariants in 6 ms
[2022-05-20 07:55:34] [INFO ] [Real]Absence check using 550 positive place invariants in 84 ms returned sat
[2022-05-20 07:55:35] [INFO ] After 1699ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-20 07:55:36] [INFO ] [Nat]Absence check using 550 positive place invariants in 84 ms returned sat
[2022-05-20 07:55:37] [INFO ] After 1073ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2022-05-20 07:55:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 07:55:38] [INFO ] After 685ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2022-05-20 07:55:38] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2022-05-20 07:55:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-05-20 07:55:39] [INFO ] After 2015ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 697 ms.
[2022-05-20 07:55:40] [INFO ] After 4663ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 412 ms.
Support contains 25 out of 1275 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1275/1275 places, 1068/1068 transitions.
Applied a total of 0 rules in 29 ms. Remains 1275 /1275 variables (removed 0) and now considering 1068/1068 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1275/1275 places, 1068/1068 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1275/1275 places, 1068/1068 transitions.
Applied a total of 0 rules in 30 ms. Remains 1275 /1275 variables (removed 0) and now considering 1068/1068 (removed 0) transitions.
// Phase 1: matrix 1068 rows 1275 cols
[2022-05-20 07:55:40] [INFO ] Computed 550 place invariants in 6 ms
[2022-05-20 07:55:41] [INFO ] Implicit Places using invariants in 634 ms returned [1258, 1262]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 636 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1273/1275 places, 1068/1068 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1271 transition count 1066
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1271 transition count 1066
Applied a total of 4 rules in 49 ms. Remains 1271 /1273 variables (removed 2) and now considering 1066/1068 (removed 2) transitions.
// Phase 1: matrix 1066 rows 1271 cols
[2022-05-20 07:55:41] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 07:55:42] [INFO ] Implicit Places using invariants in 671 ms returned []
// Phase 1: matrix 1066 rows 1271 cols
[2022-05-20 07:55:42] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:55:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 07:55:43] [INFO ] Implicit Places using invariants and state equation in 1389 ms returned []
Implicit Place search using SMT with State Equation took 2061 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1271/1275 places, 1066/1068 transitions.
Finished structural reductions, in 2 iterations. Remains : 1271/1275 places, 1066/1068 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 1066 rows 1271 cols
[2022-05-20 07:55:45] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:55:45] [INFO ] [Real]Absence check using 548 positive place invariants in 78 ms returned sat
[2022-05-20 07:55:46] [INFO ] After 1484ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-05-20 07:55:47] [INFO ] [Nat]Absence check using 548 positive place invariants in 86 ms returned sat
[2022-05-20 07:55:48] [INFO ] After 1006ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-05-20 07:55:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 07:55:48] [INFO ] After 602ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2022-05-20 07:55:50] [INFO ] After 1644ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 612 ms.
[2022-05-20 07:55:50] [INFO ] After 4031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 251 ms.
Support contains 22 out of 1271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1271/1271 places, 1066/1066 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1271 transition count 1065
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1270 transition count 1065
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1270 transition count 1064
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1269 transition count 1064
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1268 transition count 1064
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 1268 transition count 1064
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 1267 transition count 1063
Applied a total of 8 rules in 108 ms. Remains 1267 /1271 variables (removed 4) and now considering 1063/1066 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 1267/1271 places, 1063/1066 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 77510 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77510 steps, saw 52227 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 1063 rows 1267 cols
[2022-05-20 07:55:55] [INFO ] Computed 548 place invariants in 9 ms
[2022-05-20 07:55:56] [INFO ] [Real]Absence check using 548 positive place invariants in 86 ms returned sat
[2022-05-20 07:55:57] [INFO ] After 1545ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-05-20 07:55:57] [INFO ] [Nat]Absence check using 548 positive place invariants in 84 ms returned sat
[2022-05-20 07:55:58] [INFO ] After 955ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-05-20 07:55:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 07:55:59] [INFO ] After 606ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2022-05-20 07:55:59] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
[2022-05-20 07:55:59] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2022-05-20 07:55:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2022-05-20 07:56:00] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2022-05-20 07:56:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2022-05-20 07:56:00] [INFO ] After 2006ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 611 ms.
[2022-05-20 07:56:01] [INFO ] After 4357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 310 ms.
Support contains 22 out of 1267 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1267/1267 places, 1063/1063 transitions.
Applied a total of 0 rules in 27 ms. Remains 1267 /1267 variables (removed 0) and now considering 1063/1063 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1267/1267 places, 1063/1063 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1267/1267 places, 1063/1063 transitions.
Applied a total of 0 rules in 26 ms. Remains 1267 /1267 variables (removed 0) and now considering 1063/1063 (removed 0) transitions.
// Phase 1: matrix 1063 rows 1267 cols
[2022-05-20 07:56:01] [INFO ] Computed 548 place invariants in 7 ms
[2022-05-20 07:56:02] [INFO ] Implicit Places using invariants in 683 ms returned []
// Phase 1: matrix 1063 rows 1267 cols
[2022-05-20 07:56:02] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:56:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 07:56:03] [INFO ] Implicit Places using invariants and state equation in 1366 ms returned []
Implicit Place search using SMT with State Equation took 2051 ms to find 0 implicit places.
[2022-05-20 07:56:03] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 1063 rows 1267 cols
[2022-05-20 07:56:03] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 07:56:04] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1267/1267 places, 1063/1063 transitions.
Partial Free-agglomeration rule applied 279 times.
Drop transitions removed 279 transitions
Iterating global reduction 0 with 279 rules applied. Total rules applied 279 place count 1267 transition count 1063
Applied a total of 279 rules in 85 ms. Remains 1267 /1267 variables (removed 0) and now considering 1063/1063 (removed 0) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 1063 rows 1267 cols
[2022-05-20 07:56:04] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 07:56:05] [INFO ] [Real]Absence check using 548 positive place invariants in 79 ms returned sat
[2022-05-20 07:56:06] [INFO ] After 1464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-05-20 07:56:06] [INFO ] [Nat]Absence check using 548 positive place invariants in 84 ms returned sat
[2022-05-20 07:56:07] [INFO ] After 997ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-05-20 07:56:07] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-05-20 07:56:08] [INFO ] After 898ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2022-05-20 07:56:09] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 0 ms to minimize.
[2022-05-20 07:56:09] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 1 ms to minimize.
[2022-05-20 07:56:09] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 0 ms to minimize.
[2022-05-20 07:56:09] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 0 ms to minimize.
[2022-05-20 07:56:10] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 1 ms to minimize.
[2022-05-20 07:56:10] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 1 ms to minimize.
[2022-05-20 07:56:10] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 0 ms to minimize.
[2022-05-20 07:56:10] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 1 ms to minimize.
[2022-05-20 07:56:10] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 1 ms to minimize.
[2022-05-20 07:56:11] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 0 ms to minimize.
[2022-05-20 07:56:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2516 ms
[2022-05-20 07:56:11] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 1 ms to minimize.
[2022-05-20 07:56:12] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 1 ms to minimize.
[2022-05-20 07:56:12] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 1 ms to minimize.
[2022-05-20 07:56:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 778 ms
[2022-05-20 07:56:13] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 0 ms to minimize.
[2022-05-20 07:56:13] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 0 ms to minimize.
[2022-05-20 07:56:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 514 ms
[2022-05-20 07:56:13] [INFO ] After 5787ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 786 ms.
[2022-05-20 07:56:14] [INFO ] After 8376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
[2022-05-20 07:56:14] [INFO ] Flatten gal took : 55 ms
[2022-05-20 07:56:14] [INFO ] Flatten gal took : 49 ms
[2022-05-20 07:56:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10768710154075608120.gal : 27 ms
[2022-05-20 07:56:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4137898270221145461.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16900773210763297962;'/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/ReachabilityCardinality10768710154075608120.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4137898270221145461.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/ReachabilityCardinality4137898270221145461.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :8 after 16
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :16 after 48
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :48 after 1144
Reachability property AtomicPropp28 is true.
Reachability property AtomicPropp25 is true.
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :1144 after 1370
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :1370 after 6558
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :6558 after 51745
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :51745 after 1.06959e+06
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :1.06959e+06 after 7.93688e+07
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :7.93688e+07 after 5.38971e+08
Reachability property AtomicPropp12 is true.
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :5.38971e+08 after 1.5991e+12
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :1.5991e+12 after 5.97607e+12
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :5.97607e+12 after 1.36149e+16
SDD proceeding with computation,11 properties remain. new max is 32768
SDD size :1.36149e+16 after 8.13768e+19
Reachability property AtomicPropp20 is true.
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :8.13768e+19 after 1.9005e+27
SDD proceeding with computation,10 properties remain. new max is 65536
SDD size :1.9005e+27 after 2.93017e+33
Detected timeout of ITS tools.
[2022-05-20 07:56:29] [INFO ] Flatten gal took : 45 ms
[2022-05-20 07:56:29] [INFO ] Applying decomposition
[2022-05-20 07:56:29] [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/graph4786585957649327485.txt' '-o' '/tmp/graph4786585957649327485.bin' '-w' '/tmp/graph4786585957649327485.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4786585957649327485.bin' '-l' '-1' '-v' '-w' '/tmp/graph4786585957649327485.weights' '-q' '0' '-e' '0.001'
[2022-05-20 07:56:29] [INFO ] Decomposing Gal with order
[2022-05-20 07:56:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:56:30] [INFO ] Removed a total of 264 redundant transitions.
[2022-05-20 07:56:30] [INFO ] Flatten gal took : 117 ms
[2022-05-20 07:56:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 183 labels/synchronizations in 22 ms.
[2022-05-20 07:56:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3163626127826568452.gal : 13 ms
[2022-05-20 07:56:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality892394999700976669.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16900773210763297962;'/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/ReachabilityCardinality3163626127826568452.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality892394999700976669.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...297
Loading property file /tmp/ReachabilityCardinality892394999700976669.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :1 after 2
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :2 after 16
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6591480139932514216
[2022-05-20 07:56:45] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6591480139932514216
Running compilation step : cd /tmp/ltsmin6591480139932514216;'/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 2244 ms.
Running link step : cd /tmp/ltsmin6591480139932514216;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin6591480139932514216;'/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' 'AtomicPropp0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
FORMULA ShieldPPPt-PT-050B-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 802 stabilizing places and 802 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!(F(X(p1)) U p2)||p0))))'
Support contains 4 out of 3359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3351 transition count 3001
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3351 transition count 3001
Applied a total of 16 rules in 433 ms. Remains 3351 /3359 variables (removed 8) and now considering 3001/3009 (removed 8) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:57:01] [INFO ] Computed 551 place invariants in 12 ms
[2022-05-20 07:57:02] [INFO ] Implicit Places using invariants in 1157 ms returned []
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:57:02] [INFO ] Computed 551 place invariants in 13 ms
[2022-05-20 07:57:05] [INFO ] Implicit Places using invariants and state equation in 3437 ms returned []
Implicit Place search using SMT with State Equation took 4596 ms to find 0 implicit places.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:57:05] [INFO ] Computed 551 place invariants in 13 ms
[2022-05-20 07:57:08] [INFO ] Dead Transitions using invariants and state equation in 2246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3359 places, 3001/3009 transitions.
Finished structural reductions, in 1 iterations. Remains : 3351/3359 places, 3001/3009 transitions.
Stuttering acceptance computed with spot in 665 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (OR p1 (AND (NOT p0) p2))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) p2) (AND p2 p1)), acceptance={} source=3 dest: 0}, { cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p0) p2) p1), acceptance={} source=4 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s1322 0) (EQ s1324 0)), p2:(AND (EQ s1521 1) (EQ s1561 1)), p1:(AND (EQ s1322 1) (EQ s1324 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1056 ms.
Product exploration explored 100000 steps with 0 reset in 1291 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), true, (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 394 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 144 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (OR p1 (AND (NOT p0) p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 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
Interrupted probabilistic random walk after 74901 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74901 steps, saw 59991 distinct states, run finished after 3006 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:57:15] [INFO ] Computed 551 place invariants in 11 ms
[2022-05-20 07:57:16] [INFO ] After 709ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 07:57:16] [INFO ] [Nat]Absence check using 551 positive place invariants in 217 ms returned sat
[2022-05-20 07:57:19] [INFO ] After 2444ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 07:57:20] [INFO ] Deduced a trap composed of 17 places in 709 ms of which 2 ms to minimize.
[2022-05-20 07:57:21] [INFO ] Deduced a trap composed of 24 places in 664 ms of which 2 ms to minimize.
[2022-05-20 07:57:22] [INFO ] Deduced a trap composed of 22 places in 671 ms of which 5 ms to minimize.
[2022-05-20 07:57:22] [INFO ] Deduced a trap composed of 18 places in 645 ms of which 2 ms to minimize.
[2022-05-20 07:57:23] [INFO ] Deduced a trap composed of 34 places in 647 ms of which 9 ms to minimize.
[2022-05-20 07:57:24] [INFO ] Deduced a trap composed of 29 places in 626 ms of which 2 ms to minimize.
[2022-05-20 07:57:25] [INFO ] Deduced a trap composed of 24 places in 631 ms of which 2 ms to minimize.
[2022-05-20 07:57:25] [INFO ] Deduced a trap composed of 27 places in 623 ms of which 1 ms to minimize.
[2022-05-20 07:57:26] [INFO ] Deduced a trap composed of 22 places in 601 ms of which 2 ms to minimize.
[2022-05-20 07:57:27] [INFO ] Deduced a trap composed of 28 places in 570 ms of which 2 ms to minimize.
[2022-05-20 07:57:27] [INFO ] Deduced a trap composed of 22 places in 556 ms of which 2 ms to minimize.
[2022-05-20 07:57:28] [INFO ] Deduced a trap composed of 32 places in 574 ms of which 2 ms to minimize.
[2022-05-20 07:57:29] [INFO ] Deduced a trap composed of 40 places in 563 ms of which 1 ms to minimize.
[2022-05-20 07:57:29] [INFO ] Deduced a trap composed of 34 places in 566 ms of which 1 ms to minimize.
[2022-05-20 07:57:30] [INFO ] Deduced a trap composed of 26 places in 551 ms of which 1 ms to minimize.
[2022-05-20 07:57:31] [INFO ] Deduced a trap composed of 26 places in 543 ms of which 2 ms to minimize.
[2022-05-20 07:57:31] [INFO ] Deduced a trap composed of 25 places in 528 ms of which 1 ms to minimize.
[2022-05-20 07:57:32] [INFO ] Deduced a trap composed of 28 places in 506 ms of which 1 ms to minimize.
[2022-05-20 07:57:33] [INFO ] Deduced a trap composed of 31 places in 517 ms of which 1 ms to minimize.
[2022-05-20 07:57:33] [INFO ] Deduced a trap composed of 38 places in 513 ms of which 1 ms to minimize.
[2022-05-20 07:57:34] [INFO ] Deduced a trap composed of 29 places in 494 ms of which 2 ms to minimize.
[2022-05-20 07:57:34] [INFO ] Deduced a trap composed of 32 places in 469 ms of which 2 ms to minimize.
[2022-05-20 07:57:35] [INFO ] Deduced a trap composed of 21 places in 467 ms of which 1 ms to minimize.
[2022-05-20 07:57:36] [INFO ] Deduced a trap composed of 22 places in 456 ms of which 1 ms to minimize.
[2022-05-20 07:57:36] [INFO ] Deduced a trap composed of 21 places in 449 ms of which 2 ms to minimize.
[2022-05-20 07:57:37] [INFO ] Deduced a trap composed of 30 places in 431 ms of which 1 ms to minimize.
[2022-05-20 07:57:37] [INFO ] Deduced a trap composed of 54 places in 447 ms of which 1 ms to minimize.
[2022-05-20 07:57:38] [INFO ] Deduced a trap composed of 31 places in 431 ms of which 2 ms to minimize.
[2022-05-20 07:57:38] [INFO ] Deduced a trap composed of 45 places in 438 ms of which 1 ms to minimize.
[2022-05-20 07:57:39] [INFO ] Deduced a trap composed of 42 places in 430 ms of which 1 ms to minimize.
[2022-05-20 07:57:39] [INFO ] Deduced a trap composed of 43 places in 425 ms of which 2 ms to minimize.
[2022-05-20 07:57:40] [INFO ] Deduced a trap composed of 35 places in 417 ms of which 2 ms to minimize.
[2022-05-20 07:57:40] [INFO ] Deduced a trap composed of 33 places in 429 ms of which 1 ms to minimize.
[2022-05-20 07:57:41] [INFO ] Deduced a trap composed of 42 places in 425 ms of which 2 ms to minimize.
[2022-05-20 07:57:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 07:57:41] [INFO ] After 25415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 648 ms.
Support contains 4 out of 3351 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 3351 transition count 2302
Reduce places removed 699 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 700 rules applied. Total rules applied 1399 place count 2652 transition count 2301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1400 place count 2651 transition count 2301
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 1400 place count 2651 transition count 1902
Deduced a syphon composed of 399 places in 3 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 2198 place count 2252 transition count 1902
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 1 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 3 with 1698 rules applied. Total rules applied 3896 place count 1403 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3897 place count 1403 transition count 1052
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 3899 place count 1402 transition count 1051
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4101 place count 1301 transition count 1051
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4197 place count 1253 transition count 1051
Partial Free-agglomeration rule applied 148 times.
Drop transitions removed 148 transitions
Iterating global reduction 4 with 148 rules applied. Total rules applied 4345 place count 1253 transition count 1051
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4346 place count 1252 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4347 place count 1251 transition count 1050
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4347 place count 1251 transition count 1048
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4351 place count 1249 transition count 1048
Applied a total of 4351 rules in 513 ms. Remains 1249 /3351 variables (removed 2102) and now considering 1048/3001 (removed 1953) transitions.
Finished structural reductions, in 1 iterations. Remains : 1249/3351 places, 1048/3001 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 90562 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90562 steps, saw 75359 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1048 rows 1249 cols
[2022-05-20 07:57:46] [INFO ] Computed 550 place invariants in 1 ms
[2022-05-20 07:57:47] [INFO ] [Real]Absence check using 550 positive place invariants in 85 ms returned sat
[2022-05-20 07:57:47] [INFO ] After 421ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 07:57:47] [INFO ] [Nat]Absence check using 550 positive place invariants in 83 ms returned sat
[2022-05-20 07:57:48] [INFO ] After 732ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 07:57:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 07:57:48] [INFO ] After 348ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-20 07:57:49] [INFO ] After 945ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 355 ms.
[2022-05-20 07:57:49] [INFO ] After 2608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 174 ms.
Support contains 4 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1249/1249 places, 1048/1048 transitions.
Applied a total of 0 rules in 26 ms. Remains 1249 /1249 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1249/1249 places, 1048/1048 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1249/1249 places, 1048/1048 transitions.
Applied a total of 0 rules in 25 ms. Remains 1249 /1249 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
// Phase 1: matrix 1048 rows 1249 cols
[2022-05-20 07:57:49] [INFO ] Computed 550 place invariants in 4 ms
[2022-05-20 07:57:50] [INFO ] Implicit Places using invariants in 684 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 690 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1247/1249 places, 1048/1048 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1245 transition count 1046
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 45 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 07:57:50] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:57:51] [INFO ] Implicit Places using invariants in 677 ms returned []
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 07:57:51] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:57:52] [INFO ] Implicit Places using invariants and state equation in 1340 ms returned []
Implicit Place search using SMT with State Equation took 2022 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1245/1249 places, 1046/1048 transitions.
Finished structural reductions, in 2 iterations. Remains : 1245/1249 places, 1046/1048 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 90902 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90902 steps, saw 75282 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 07:57:56] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:57:57] [INFO ] [Real]Absence check using 548 positive place invariants in 83 ms returned sat
[2022-05-20 07:57:57] [INFO ] After 395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 07:57:57] [INFO ] [Nat]Absence check using 548 positive place invariants in 78 ms returned sat
[2022-05-20 07:57:58] [INFO ] After 693ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 07:57:58] [INFO ] After 1276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 348 ms.
[2022-05-20 07:57:59] [INFO ] After 2130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 161 ms.
Support contains 4 out of 1245 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 36 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1046/1046 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 25 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 07:57:59] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 07:58:00] [INFO ] Implicit Places using invariants in 660 ms returned []
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 07:58:00] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:58:01] [INFO ] Implicit Places using invariants and state equation in 1310 ms returned []
Implicit Place search using SMT with State Equation took 1973 ms to find 0 implicit places.
[2022-05-20 07:58:01] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 07:58:01] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 07:58:01] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1046/1046 transitions.
Partial Free-agglomeration rule applied 292 times.
Drop transitions removed 292 transitions
Iterating global reduction 0 with 292 rules applied. Total rules applied 292 place count 1245 transition count 1046
Applied a total of 292 rules in 56 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 07:58:02] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 07:58:02] [INFO ] [Real]Absence check using 548 positive place invariants in 80 ms returned sat
[2022-05-20 07:58:02] [INFO ] After 383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 07:58:02] [INFO ] [Nat]Absence check using 548 positive place invariants in 78 ms returned sat
[2022-05-20 07:58:03] [INFO ] After 728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 07:58:03] [INFO ] State equation strengthened by 289 read => feed constraints.
[2022-05-20 07:58:04] [INFO ] After 544ms SMT Verify possible using 289 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-20 07:58:04] [INFO ] Deduced a trap composed of 5 places in 229 ms of which 0 ms to minimize.
[2022-05-20 07:58:04] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 0 ms to minimize.
[2022-05-20 07:58:05] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 1 ms to minimize.
[2022-05-20 07:58:05] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 0 ms to minimize.
[2022-05-20 07:58:05] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 4 ms to minimize.
[2022-05-20 07:58:05] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 0 ms to minimize.
[2022-05-20 07:58:06] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 1 ms to minimize.
[2022-05-20 07:58:06] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 1 ms to minimize.
[2022-05-20 07:58:06] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
[2022-05-20 07:58:07] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 1 ms to minimize.
[2022-05-20 07:58:07] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 1 ms to minimize.
[2022-05-20 07:58:07] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 0 ms to minimize.
[2022-05-20 07:58:07] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 1 ms to minimize.
[2022-05-20 07:58:08] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 0 ms to minimize.
[2022-05-20 07:58:08] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 1 ms to minimize.
[2022-05-20 07:58:08] [INFO ] Deduced a trap composed of 5 places in 231 ms of which 1 ms to minimize.
[2022-05-20 07:58:08] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 0 ms to minimize.
[2022-05-20 07:58:09] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 0 ms to minimize.
[2022-05-20 07:58:09] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5068 ms
[2022-05-20 07:58:10] [INFO ] After 6364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 535 ms.
[2022-05-20 07:58:10] [INFO ] After 8134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2022-05-20 07:58:10] [INFO ] Flatten gal took : 46 ms
[2022-05-20 07:58:10] [INFO ] Flatten gal took : 44 ms
[2022-05-20 07:58:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12112668416442528573.gal : 6 ms
[2022-05-20 07:58:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14023590446942211370.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms6090769315767499058;'/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/ReachabilityCardinality12112668416442528573.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14023590446942211370.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality14023590446942211370.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 12
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :12 after 30
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :30 after 64
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :64 after 121
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :121 after 169
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :169 after 666
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :666 after 12384
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :12384 after 951713
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :951713 after 7.89712e+07
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :7.89712e+07 after 3.82604e+08
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :3.82604e+08 after 5.69953e+11
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :5.69953e+11 after 9.21521e+14
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :9.21521e+14 after 8.80112e+18
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :8.80112e+18 after 6.84183e+22
SDD proceeding with computation,8 properties remain. new max is 131072
SDD size :6.84183e+22 after 3.69385e+29
Detected timeout of ITS tools.
[2022-05-20 07:58:25] [INFO ] Flatten gal took : 39 ms
[2022-05-20 07:58:25] [INFO ] Applying decomposition
[2022-05-20 07:58:25] [INFO ] Flatten gal took : 39 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/graph5727123159578529087.txt' '-o' '/tmp/graph5727123159578529087.bin' '-w' '/tmp/graph5727123159578529087.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5727123159578529087.bin' '-l' '-1' '-v' '-w' '/tmp/graph5727123159578529087.weights' '-q' '0' '-e' '0.001'
[2022-05-20 07:58:25] [INFO ] Decomposing Gal with order
[2022-05-20 07:58:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:58:26] [INFO ] Removed a total of 256 redundant transitions.
[2022-05-20 07:58:26] [INFO ] Flatten gal took : 89 ms
[2022-05-20 07:58:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 190 labels/synchronizations in 7 ms.
[2022-05-20 07:58:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9052759997103923867.gal : 7 ms
[2022-05-20 07:58:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10744083057715156248.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6090769315767499058;'/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/ReachabilityCardinality9052759997103923867.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10744083057715156248.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/ReachabilityCardinality10744083057715156248.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :1 after 2
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12839199410277397987
[2022-05-20 07:58:41] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12839199410277397987
Running compilation step : cd /tmp/ltsmin12839199410277397987;'/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 2022 ms.
Running link step : cd /tmp/ltsmin12839199410277397987;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12839199410277397987;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), true, (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 351 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 162 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (OR p1 (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 170 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (OR p1 (AND (NOT p0) p2))]
Support contains 4 out of 3351 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Applied a total of 0 rules in 219 ms. Remains 3351 /3351 variables (removed 0) and now considering 3001/3001 (removed 0) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:58:57] [INFO ] Computed 551 place invariants in 18 ms
[2022-05-20 07:58:58] [INFO ] Implicit Places using invariants in 1081 ms returned []
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:58:58] [INFO ] Computed 551 place invariants in 14 ms
[2022-05-20 07:59:01] [INFO ] Implicit Places using invariants and state equation in 3334 ms returned []
Implicit Place search using SMT with State Equation took 4417 ms to find 0 implicit places.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:59:01] [INFO ] Computed 551 place invariants in 9 ms
[2022-05-20 07:59:03] [INFO ] Dead Transitions using invariants and state equation in 2177 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3351/3351 places, 3001/3001 transitions.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (OR (AND p2 p1) (AND p2 (NOT p0))))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 439 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 178 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (OR p1 (AND (NOT p0) p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 80445 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80445 steps, saw 62989 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:59:08] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 07:59:08] [INFO ] [Real]Absence check using 551 positive place invariants in 210 ms returned sat
[2022-05-20 07:59:09] [INFO ] After 1036ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 07:59:09] [INFO ] [Nat]Absence check using 551 positive place invariants in 214 ms returned sat
[2022-05-20 07:59:12] [INFO ] After 2405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 07:59:13] [INFO ] Deduced a trap composed of 17 places in 674 ms of which 2 ms to minimize.
[2022-05-20 07:59:14] [INFO ] Deduced a trap composed of 24 places in 641 ms of which 1 ms to minimize.
[2022-05-20 07:59:15] [INFO ] Deduced a trap composed of 22 places in 610 ms of which 1 ms to minimize.
[2022-05-20 07:59:15] [INFO ] Deduced a trap composed of 18 places in 640 ms of which 1 ms to minimize.
[2022-05-20 07:59:16] [INFO ] Deduced a trap composed of 34 places in 638 ms of which 2 ms to minimize.
[2022-05-20 07:59:17] [INFO ] Deduced a trap composed of 29 places in 624 ms of which 2 ms to minimize.
[2022-05-20 07:59:17] [INFO ] Deduced a trap composed of 24 places in 613 ms of which 2 ms to minimize.
[2022-05-20 07:59:18] [INFO ] Deduced a trap composed of 27 places in 587 ms of which 1 ms to minimize.
[2022-05-20 07:59:19] [INFO ] Deduced a trap composed of 22 places in 576 ms of which 2 ms to minimize.
[2022-05-20 07:59:20] [INFO ] Deduced a trap composed of 28 places in 561 ms of which 2 ms to minimize.
[2022-05-20 07:59:20] [INFO ] Deduced a trap composed of 22 places in 562 ms of which 2 ms to minimize.
[2022-05-20 07:59:21] [INFO ] Deduced a trap composed of 32 places in 539 ms of which 2 ms to minimize.
[2022-05-20 07:59:21] [INFO ] Deduced a trap composed of 40 places in 561 ms of which 2 ms to minimize.
[2022-05-20 07:59:22] [INFO ] Deduced a trap composed of 28 places in 566 ms of which 2 ms to minimize.
[2022-05-20 07:59:23] [INFO ] Deduced a trap composed of 26 places in 546 ms of which 2 ms to minimize.
[2022-05-20 07:59:23] [INFO ] Deduced a trap composed of 34 places in 549 ms of which 1 ms to minimize.
[2022-05-20 07:59:24] [INFO ] Deduced a trap composed of 27 places in 544 ms of which 1 ms to minimize.
[2022-05-20 07:59:25] [INFO ] Deduced a trap composed of 21 places in 510 ms of which 2 ms to minimize.
[2022-05-20 07:59:25] [INFO ] Deduced a trap composed of 21 places in 497 ms of which 1 ms to minimize.
[2022-05-20 07:59:26] [INFO ] Deduced a trap composed of 22 places in 509 ms of which 1 ms to minimize.
[2022-05-20 07:59:27] [INFO ] Deduced a trap composed of 30 places in 477 ms of which 1 ms to minimize.
[2022-05-20 07:59:27] [INFO ] Deduced a trap composed of 26 places in 470 ms of which 1 ms to minimize.
[2022-05-20 07:59:28] [INFO ] Deduced a trap composed of 44 places in 445 ms of which 2 ms to minimize.
[2022-05-20 07:59:28] [INFO ] Deduced a trap composed of 40 places in 458 ms of which 1 ms to minimize.
[2022-05-20 07:59:29] [INFO ] Deduced a trap composed of 25 places in 455 ms of which 1 ms to minimize.
[2022-05-20 07:59:29] [INFO ] Deduced a trap composed of 41 places in 437 ms of which 1 ms to minimize.
[2022-05-20 07:59:30] [INFO ] Deduced a trap composed of 49 places in 453 ms of which 1 ms to minimize.
[2022-05-20 07:59:31] [INFO ] Deduced a trap composed of 48 places in 440 ms of which 1 ms to minimize.
[2022-05-20 07:59:31] [INFO ] Deduced a trap composed of 41 places in 412 ms of which 2 ms to minimize.
[2022-05-20 07:59:32] [INFO ] Deduced a trap composed of 41 places in 402 ms of which 1 ms to minimize.
[2022-05-20 07:59:32] [INFO ] Deduced a trap composed of 32 places in 393 ms of which 1 ms to minimize.
[2022-05-20 07:59:33] [INFO ] Deduced a trap composed of 37 places in 398 ms of which 1 ms to minimize.
[2022-05-20 07:59:33] [INFO ] Deduced a trap composed of 43 places in 397 ms of which 1 ms to minimize.
[2022-05-20 07:59:34] [INFO ] Deduced a trap composed of 30 places in 374 ms of which 1 ms to minimize.
[2022-05-20 07:59:36] [INFO ] Deduced a trap composed of 15 places in 1955 ms of which 10 ms to minimize.
[2022-05-20 07:59:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 07:59:36] [INFO ] After 26966ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 752 ms.
Support contains 4 out of 3351 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 3351 transition count 2302
Reduce places removed 699 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 700 rules applied. Total rules applied 1399 place count 2652 transition count 2301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1400 place count 2651 transition count 2301
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 1400 place count 2651 transition count 1902
Deduced a syphon composed of 399 places in 3 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 2198 place count 2252 transition count 1902
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 1 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 3 with 1698 rules applied. Total rules applied 3896 place count 1403 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3897 place count 1403 transition count 1052
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 3899 place count 1402 transition count 1051
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4101 place count 1301 transition count 1051
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4197 place count 1253 transition count 1051
Partial Free-agglomeration rule applied 148 times.
Drop transitions removed 148 transitions
Iterating global reduction 4 with 148 rules applied. Total rules applied 4345 place count 1253 transition count 1051
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4346 place count 1252 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4347 place count 1251 transition count 1050
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4347 place count 1251 transition count 1048
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4351 place count 1249 transition count 1048
Applied a total of 4351 rules in 480 ms. Remains 1249 /3351 variables (removed 2102) and now considering 1048/3001 (removed 1953) transitions.
Finished structural reductions, in 1 iterations. Remains : 1249/3351 places, 1048/3001 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 80116 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80116 steps, saw 66760 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1048 rows 1249 cols
[2022-05-20 07:59:41] [INFO ] Computed 550 place invariants in 2 ms
[2022-05-20 07:59:41] [INFO ] [Real]Absence check using 550 positive place invariants in 84 ms returned sat
[2022-05-20 07:59:41] [INFO ] After 402ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 07:59:42] [INFO ] [Nat]Absence check using 550 positive place invariants in 80 ms returned sat
[2022-05-20 07:59:42] [INFO ] After 698ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 07:59:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 07:59:43] [INFO ] After 335ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-20 07:59:43] [INFO ] After 936ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 328 ms.
[2022-05-20 07:59:44] [INFO ] After 2480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 182 ms.
Support contains 4 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1249/1249 places, 1048/1048 transitions.
Applied a total of 0 rules in 22 ms. Remains 1249 /1249 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1249/1249 places, 1048/1048 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1249/1249 places, 1048/1048 transitions.
Applied a total of 0 rules in 53 ms. Remains 1249 /1249 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
// Phase 1: matrix 1048 rows 1249 cols
[2022-05-20 07:59:44] [INFO ] Computed 550 place invariants in 2 ms
[2022-05-20 07:59:45] [INFO ] Implicit Places using invariants in 665 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 678 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1247/1249 places, 1048/1048 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1245 transition count 1046
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 42 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 07:59:45] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:59:45] [INFO ] Implicit Places using invariants in 698 ms returned []
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 07:59:45] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:59:47] [INFO ] Implicit Places using invariants and state equation in 1286 ms returned []
Implicit Place search using SMT with State Equation took 2012 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1245/1249 places, 1046/1048 transitions.
Finished structural reductions, in 2 iterations. Remains : 1245/1249 places, 1046/1048 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 458 ms. (steps per millisecond=21 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 60000 steps, run timeout after 3003 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 60000 steps, saw 49411 distinct states, run finished after 3003 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 07:59:51] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 07:59:52] [INFO ] [Real]Absence check using 548 positive place invariants in 72 ms returned sat
[2022-05-20 07:59:52] [INFO ] After 456ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 07:59:52] [INFO ] [Nat]Absence check using 548 positive place invariants in 77 ms returned sat
[2022-05-20 07:59:53] [INFO ] After 705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 07:59:53] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 3 ms to minimize.
[2022-05-20 07:59:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2022-05-20 07:59:54] [INFO ] After 1598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 333 ms.
[2022-05-20 07:59:54] [INFO ] After 2434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 276 ms.
Support contains 4 out of 1245 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 25 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1046/1046 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 22 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 07:59:54] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 07:59:55] [INFO ] Implicit Places using invariants in 677 ms returned []
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 07:59:55] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 07:59:56] [INFO ] Implicit Places using invariants and state equation in 1315 ms returned []
Implicit Place search using SMT with State Equation took 2017 ms to find 0 implicit places.
[2022-05-20 07:59:57] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 07:59:57] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:59:57] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1046/1046 transitions.
Partial Free-agglomeration rule applied 292 times.
Drop transitions removed 292 transitions
Iterating global reduction 0 with 292 rules applied. Total rules applied 292 place count 1245 transition count 1046
Applied a total of 292 rules in 53 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 07:59:57] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 07:59:58] [INFO ] [Real]Absence check using 548 positive place invariants in 76 ms returned sat
[2022-05-20 07:59:58] [INFO ] After 386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 07:59:58] [INFO ] [Nat]Absence check using 548 positive place invariants in 74 ms returned sat
[2022-05-20 07:59:59] [INFO ] After 711ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 07:59:59] [INFO ] State equation strengthened by 289 read => feed constraints.
[2022-05-20 07:59:59] [INFO ] After 585ms SMT Verify possible using 289 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-20 08:00:00] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 0 ms to minimize.
[2022-05-20 08:00:00] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 1 ms to minimize.
[2022-05-20 08:00:00] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 1 ms to minimize.
[2022-05-20 08:00:01] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 0 ms to minimize.
[2022-05-20 08:00:01] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 1 ms to minimize.
[2022-05-20 08:00:01] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 0 ms to minimize.
[2022-05-20 08:00:01] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 1 ms to minimize.
[2022-05-20 08:00:02] [INFO ] Deduced a trap composed of 7 places in 212 ms of which 1 ms to minimize.
[2022-05-20 08:00:02] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 0 ms to minimize.
[2022-05-20 08:00:02] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 1 ms to minimize.
[2022-05-20 08:00:03] [INFO ] Deduced a trap composed of 7 places in 246 ms of which 0 ms to minimize.
[2022-05-20 08:00:03] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 1 ms to minimize.
[2022-05-20 08:00:03] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 1 ms to minimize.
[2022-05-20 08:00:03] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 1 ms to minimize.
[2022-05-20 08:00:04] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 1 ms to minimize.
[2022-05-20 08:00:04] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 0 ms to minimize.
[2022-05-20 08:00:04] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 0 ms to minimize.
[2022-05-20 08:00:05] [INFO ] Deduced a trap composed of 7 places in 268 ms of which 0 ms to minimize.
[2022-05-20 08:00:05] [INFO ] Deduced a trap composed of 5 places in 229 ms of which 1 ms to minimize.
[2022-05-20 08:00:05] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 0 ms to minimize.
[2022-05-20 08:00:05] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5924 ms
[2022-05-20 08:00:06] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 0 ms to minimize.
[2022-05-20 08:00:06] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 1 ms to minimize.
[2022-05-20 08:00:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 652 ms
[2022-05-20 08:00:07] [INFO ] After 7852ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 514 ms.
[2022-05-20 08:00:07] [INFO ] After 9586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2022-05-20 08:00:07] [INFO ] Flatten gal took : 39 ms
[2022-05-20 08:00:07] [INFO ] Flatten gal took : 38 ms
[2022-05-20 08:00:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3446539570779949830.gal : 4 ms
[2022-05-20 08:00:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality416903101964817261.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3269871117706366776;'/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/ReachabilityCardinality3446539570779949830.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality416903101964817261.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...318
Loading property file /tmp/ReachabilityCardinality416903101964817261.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 12
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :12 after 30
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :30 after 64
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :64 after 121
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :121 after 169
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :169 after 666
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :666 after 12384
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :12384 after 951713
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :951713 after 7.89712e+07
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :7.89712e+07 after 3.82604e+08
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :3.82604e+08 after 5.69953e+11
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :5.69953e+11 after 9.21521e+14
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :9.21521e+14 after 8.80112e+18
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :8.80112e+18 after 6.84183e+22
SDD proceeding with computation,8 properties remain. new max is 131072
SDD size :6.84183e+22 after 3.69385e+29
Detected timeout of ITS tools.
[2022-05-20 08:00:22] [INFO ] Flatten gal took : 39 ms
[2022-05-20 08:00:22] [INFO ] Applying decomposition
[2022-05-20 08:00:22] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9502325702036983399.txt' '-o' '/tmp/graph9502325702036983399.bin' '-w' '/tmp/graph9502325702036983399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9502325702036983399.bin' '-l' '-1' '-v' '-w' '/tmp/graph9502325702036983399.weights' '-q' '0' '-e' '0.001'
[2022-05-20 08:00:23] [INFO ] Decomposing Gal with order
[2022-05-20 08:00:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:00:23] [INFO ] Removed a total of 271 redundant transitions.
[2022-05-20 08:00:23] [INFO ] Flatten gal took : 120 ms
[2022-05-20 08:00:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 208 labels/synchronizations in 22 ms.
[2022-05-20 08:00:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17383680558764778604.gal : 17 ms
[2022-05-20 08:00:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2135509031410432741.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3269871117706366776;'/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/ReachabilityCardinality17383680558764778604.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2135509031410432741.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/ReachabilityCardinality2135509031410432741.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :1 after 160
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2624097810257924226
[2022-05-20 08:00:38] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2624097810257924226
Running compilation step : cd /tmp/ltsmin2624097810257924226;'/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 2065 ms.
Running link step : cd /tmp/ltsmin2624097810257924226;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2624097810257924226;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (OR (AND p2 p1) (AND p2 (NOT p0))))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 641 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 179 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (OR p1 (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 146 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (OR p1 (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 146 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (OR p1 (AND (NOT p0) p2))]
Product exploration explored 100000 steps with 0 reset in 886 ms.
Product exploration explored 100000 steps with 0 reset in 1150 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 151 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (OR p1 (AND (NOT p0) p2))]
Support contains 4 out of 3351 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Performed 700 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3351 transition count 3001
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 249 Pre rules applied. Total rules applied 700 place count 3351 transition count 3200
Deduced a syphon composed of 949 places in 5 ms
Iterating global reduction 1 with 249 rules applied. Total rules applied 949 place count 3351 transition count 3200
Performed 949 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1898 places in 6 ms
Iterating global reduction 1 with 949 rules applied. Total rules applied 1898 place count 3351 transition count 3200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1899 place count 3351 transition count 3199
Renaming transitions due to excessive name length > 1024 char.
Discarding 352 places :
Symmetric choice reduction at 2 with 352 rule applications. Total rules 2251 place count 2999 transition count 2847
Deduced a syphon composed of 1546 places in 5 ms
Iterating global reduction 2 with 352 rules applied. Total rules applied 2603 place count 2999 transition count 2847
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1547 places in 7 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2604 place count 2999 transition count 2847
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2606 place count 2997 transition count 2845
Deduced a syphon composed of 1545 places in 5 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2608 place count 2997 transition count 2845
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -428
Deduced a syphon composed of 1646 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2709 place count 2997 transition count 3273
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2810 place count 2896 transition count 3071
Deduced a syphon composed of 1545 places in 4 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2911 place count 2896 transition count 3071
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -415
Deduced a syphon composed of 1643 places in 4 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 3009 place count 2896 transition count 3486
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 3107 place count 2798 transition count 3290
Deduced a syphon composed of 1545 places in 3 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 3205 place count 2798 transition count 3290
Deduced a syphon composed of 1545 places in 3 ms
Applied a total of 3205 rules in 3714 ms. Remains 2798 /3351 variables (removed 553) and now considering 3290/3001 (removed -289) transitions.
[2022-05-20 08:01:00] [INFO ] Redundant transitions in 101 ms returned []
// Phase 1: matrix 3290 rows 2798 cols
[2022-05-20 08:01:00] [INFO ] Computed 551 place invariants in 26 ms
[2022-05-20 08:01:03] [INFO ] Dead Transitions using invariants and state equation in 2268 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2798/3351 places, 3290/3001 transitions.
Finished structural reductions, in 1 iterations. Remains : 2798/3351 places, 3290/3001 transitions.
Product exploration explored 100000 steps with 0 reset in 962 ms.
Product exploration explored 100000 steps with 0 reset in 1237 ms.
Built C files in :
/tmp/ltsmin8468030620883278020
[2022-05-20 08:01:05] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8468030620883278020
Running compilation step : cd /tmp/ltsmin8468030620883278020;'/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/ltsmin8468030620883278020;'/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/ltsmin8468030620883278020;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 3351 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Applied a total of 0 rules in 211 ms. Remains 3351 /3351 variables (removed 0) and now considering 3001/3001 (removed 0) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 08:01:08] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 08:01:10] [INFO ] Implicit Places using invariants in 2255 ms returned []
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 08:01:10] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 08:01:14] [INFO ] Implicit Places using invariants and state equation in 4009 ms returned []
Implicit Place search using SMT with State Equation took 6311 ms to find 0 implicit places.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 08:01:14] [INFO ] Computed 551 place invariants in 9 ms
[2022-05-20 08:01:16] [INFO ] Dead Transitions using invariants and state equation in 2008 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3351/3351 places, 3001/3001 transitions.
Built C files in :
/tmp/ltsmin3876828176944335149
[2022-05-20 08:01:16] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3876828176944335149
Running compilation step : cd /tmp/ltsmin3876828176944335149;'/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/ltsmin3876828176944335149;'/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/ltsmin3876828176944335149;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 08:01:20] [INFO ] Flatten gal took : 129 ms
[2022-05-20 08:01:20] [INFO ] Flatten gal took : 107 ms
[2022-05-20 08:01:20] [INFO ] Time to serialize gal into /tmp/LTL12799405013584917772.gal : 33 ms
[2022-05-20 08:01:20] [INFO ] Time to serialize properties into /tmp/LTL8369597049788694779.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/LTL12799405013584917772.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8369597049788694779.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/LTL1279940...267
Read 1 LTL properties
Checking formula 0 : !((X(G(((!((F(X("((p1531==1)&&(p1533==1))")))U("((p1763==1)&&(p1810==1))")))||("(p1531==0)"))||("(p1533==0)")))))
Formula 0 simplified : !XG("(p1531==0)" | "(p1533==0)" | !(FX"((p1531==1)&&(p1533==1))" U "((p1763==1)&&(p1810==1))"))
Detected timeout of ITS tools.
[2022-05-20 08:01:35] [INFO ] Flatten gal took : 65 ms
[2022-05-20 08:01:35] [INFO ] Applying decomposition
[2022-05-20 08:01:35] [INFO ] Flatten gal took : 66 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/graph7731171810862980131.txt' '-o' '/tmp/graph7731171810862980131.bin' '-w' '/tmp/graph7731171810862980131.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7731171810862980131.bin' '-l' '-1' '-v' '-w' '/tmp/graph7731171810862980131.weights' '-q' '0' '-e' '0.001'
[2022-05-20 08:01:35] [INFO ] Decomposing Gal with order
[2022-05-20 08:01:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:01:36] [INFO ] Removed a total of 497 redundant transitions.
[2022-05-20 08:01:36] [INFO ] Flatten gal took : 210 ms
[2022-05-20 08:01:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2022-05-20 08:01:36] [INFO ] Time to serialize gal into /tmp/LTL15635167352672028385.gal : 48 ms
[2022-05-20 08:01:36] [INFO ] Time to serialize properties into /tmp/LTL7153987818164464631.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/LTL15635167352672028385.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7153987818164464631.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/LTL1563516...246
Read 1 LTL properties
Checking formula 0 : !((X(G(((!((F(X("((i20.u470.p1531==1)&&(i20.u470.p1533==1))")))U("((i23.u540.p1763==1)&&(i23.u554.p1810==1))")))||("(i20.u470.p1531==0...188
Formula 0 simplified : !XG("(i20.u470.p1531==0)" | "(i20.u470.p1533==0)" | !(FX"((i20.u470.p1531==1)&&(i20.u470.p1533==1))" U "((i23.u540.p1763==1)&&(i23.u...172
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6834094690792066245
[2022-05-20 08:01:51] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6834094690792066245
Running compilation step : cd /tmp/ltsmin6834094690792066245;'/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/ltsmin6834094690792066245;'/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/ltsmin6834094690792066245;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPt-PT-050B-LTLFireability-01 finished in 293954 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 3359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3351 transition count 3001
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3351 transition count 3001
Applied a total of 16 rules in 528 ms. Remains 3351 /3359 variables (removed 8) and now considering 3001/3009 (removed 8) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 08:01:55] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 08:01:57] [INFO ] Implicit Places using invariants in 2346 ms returned []
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 08:01:57] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 08:02:01] [INFO ] Implicit Places using invariants and state equation in 3830 ms returned []
Implicit Place search using SMT with State Equation took 6206 ms to find 0 implicit places.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 08:02:01] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 08:02:03] [INFO ] Dead Transitions using invariants and state equation in 1961 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3359 places, 3001/3009 transitions.
Finished structural reductions, in 1 iterations. Remains : 3351/3359 places, 3001/3009 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2200 1) (EQ s2249 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 0 reset in 843 ms.
Stack based approach found an accepted trace after 8103 steps with 0 reset with depth 8104 and stack size 8104 in 85 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-02 finished in 9757 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 3359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 704 transitions
Trivial Post-agglo rules discarded 704 transitions
Performed 704 trivial Post agglomeration. Transition count delta: 704
Iterating post reduction 0 with 704 rules applied. Total rules applied 704 place count 3358 transition count 2304
Reduce places removed 704 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 705 rules applied. Total rules applied 1409 place count 2654 transition count 2303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1410 place count 2653 transition count 2303
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 395 Pre rules applied. Total rules applied 1410 place count 2653 transition count 1908
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 3 with 790 rules applied. Total rules applied 2200 place count 2258 transition count 1908
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2206 place count 2252 transition count 1902
Iterating global reduction 3 with 6 rules applied. Total rules applied 2212 place count 2252 transition count 1902
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 2212 place count 2252 transition count 1898
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 2220 place count 2248 transition count 1898
Performed 844 Post agglomeration using F-continuation condition.Transition count delta: 844
Deduced a syphon composed of 844 places in 2 ms
Reduce places removed 844 places and 0 transitions.
Iterating global reduction 3 with 1688 rules applied. Total rules applied 3908 place count 1404 transition count 1054
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3909 place count 1404 transition count 1053
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 3911 place count 1403 transition count 1052
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4113 place count 1302 transition count 1052
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4209 place count 1254 transition count 1052
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4211 place count 1252 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4212 place count 1251 transition count 1050
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4212 place count 1251 transition count 1048
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4216 place count 1249 transition count 1048
Applied a total of 4216 rules in 812 ms. Remains 1249 /3359 variables (removed 2110) and now considering 1048/3009 (removed 1961) transitions.
// Phase 1: matrix 1048 rows 1249 cols
[2022-05-20 08:02:05] [INFO ] Computed 550 place invariants in 2 ms
[2022-05-20 08:02:06] [INFO ] Implicit Places using invariants in 668 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 679 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1247/3359 places, 1048/3009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 94 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:02:06] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 08:02:07] [INFO ] Implicit Places using invariants in 936 ms returned []
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:02:07] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 08:02:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-20 08:02:08] [INFO ] Implicit Places using invariants and state equation in 1316 ms returned []
Implicit Place search using SMT with State Equation took 2272 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1245/3359 places, 1046/3009 transitions.
Finished structural reductions, in 2 iterations. Remains : 1245/3359 places, 1046/3009 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1199 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 827 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-03 finished in 4869 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||p1))&&F(X(p2))))'
Support contains 4 out of 3359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3351 transition count 3001
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3351 transition count 3001
Applied a total of 16 rules in 409 ms. Remains 3351 /3359 variables (removed 8) and now considering 3001/3009 (removed 8) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 08:02:09] [INFO ] Computed 551 place invariants in 14 ms
[2022-05-20 08:02:10] [INFO ] Implicit Places using invariants in 1077 ms returned []
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 08:02:10] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 08:02:14] [INFO ] Implicit Places using invariants and state equation in 3322 ms returned []
Implicit Place search using SMT with State Equation took 4411 ms to find 0 implicit places.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 08:02:14] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 08:02:16] [INFO ] Dead Transitions using invariants and state equation in 2028 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3359 places, 3001/3009 transitions.
Finished structural reductions, in 1 iterations. Remains : 3351/3359 places, 3001/3009 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p2), true]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s841 1) (EQ s3182 1)), p0:(EQ s3182 1), p2:(AND (EQ s872 1) (EQ s1955 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 850 ms.
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-04 finished in 7883 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(G((p0||(F(F(p1))&&p2))))))))'
Support contains 3 out of 3359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 704 transitions
Trivial Post-agglo rules discarded 704 transitions
Performed 704 trivial Post agglomeration. Transition count delta: 704
Iterating post reduction 0 with 704 rules applied. Total rules applied 704 place count 3358 transition count 2304
Reduce places removed 704 places and 0 transitions.
Iterating post reduction 1 with 704 rules applied. Total rules applied 1408 place count 2654 transition count 2304
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 396 Pre rules applied. Total rules applied 1408 place count 2654 transition count 1908
Deduced a syphon composed of 396 places in 3 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 2 with 792 rules applied. Total rules applied 2200 place count 2258 transition count 1908
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 2206 place count 2252 transition count 1902
Iterating global reduction 2 with 6 rules applied. Total rules applied 2212 place count 2252 transition count 1902
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2212 place count 2252 transition count 1898
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2220 place count 2248 transition count 1898
Performed 841 Post agglomeration using F-continuation condition.Transition count delta: 841
Deduced a syphon composed of 841 places in 1 ms
Reduce places removed 841 places and 0 transitions.
Iterating global reduction 2 with 1682 rules applied. Total rules applied 3902 place count 1407 transition count 1057
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3903 place count 1407 transition count 1056
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 3905 place count 1406 transition count 1055
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4107 place count 1305 transition count 1055
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4203 place count 1257 transition count 1055
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4205 place count 1255 transition count 1053
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4206 place count 1254 transition count 1053
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4206 place count 1254 transition count 1051
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4210 place count 1252 transition count 1051
Applied a total of 4210 rules in 562 ms. Remains 1252 /3359 variables (removed 2107) and now considering 1051/3009 (removed 1958) transitions.
// Phase 1: matrix 1051 rows 1252 cols
[2022-05-20 08:02:17] [INFO ] Computed 550 place invariants in 3 ms
[2022-05-20 08:02:18] [INFO ] Implicit Places using invariants in 684 ms returned [1235, 1239]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 699 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/3359 places, 1051/3009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 1049
Applied a total of 4 rules in 42 ms. Remains 1248 /1250 variables (removed 2) and now considering 1049/1051 (removed 2) transitions.
// Phase 1: matrix 1049 rows 1248 cols
[2022-05-20 08:02:18] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 08:02:19] [INFO ] Implicit Places using invariants in 638 ms returned []
// Phase 1: matrix 1049 rows 1248 cols
[2022-05-20 08:02:19] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 08:02:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-20 08:02:20] [INFO ] Implicit Places using invariants and state equation in 1310 ms returned []
Implicit Place search using SMT with State Equation took 1991 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1248/3359 places, 1049/3009 transitions.
Finished structural reductions, in 2 iterations. Remains : 1248/3359 places, 1049/3009 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s906 1), p0:(EQ s455 1), p1:(EQ s727 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 850 ms.
Stack based approach found an accepted trace after 20 steps with 2 reset with depth 3 and stack size 3 in 1 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-05 finished in 4243 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((p0 U p1)))))'
Support contains 2 out of 3359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 703 transitions
Trivial Post-agglo rules discarded 703 transitions
Performed 703 trivial Post agglomeration. Transition count delta: 703
Iterating post reduction 0 with 703 rules applied. Total rules applied 703 place count 3358 transition count 2305
Reduce places removed 703 places and 0 transitions.
Iterating post reduction 1 with 703 rules applied. Total rules applied 1406 place count 2655 transition count 2305
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 394 Pre rules applied. Total rules applied 1406 place count 2655 transition count 1911
Deduced a syphon composed of 394 places in 3 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 2 with 788 rules applied. Total rules applied 2194 place count 2261 transition count 1911
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 2200 place count 2255 transition count 1905
Iterating global reduction 2 with 6 rules applied. Total rules applied 2206 place count 2255 transition count 1905
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2206 place count 2255 transition count 1901
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2214 place count 2251 transition count 1901
Performed 847 Post agglomeration using F-continuation condition.Transition count delta: 847
Deduced a syphon composed of 847 places in 2 ms
Reduce places removed 847 places and 0 transitions.
Iterating global reduction 2 with 1694 rules applied. Total rules applied 3908 place count 1404 transition count 1054
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3909 place count 1404 transition count 1053
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 3911 place count 1403 transition count 1052
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4113 place count 1302 transition count 1052
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 4205 place count 1256 transition count 1052
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4207 place count 1254 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4208 place count 1253 transition count 1050
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4208 place count 1253 transition count 1048
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4212 place count 1251 transition count 1048
Applied a total of 4212 rules in 505 ms. Remains 1251 /3359 variables (removed 2108) and now considering 1048/3009 (removed 1961) transitions.
// Phase 1: matrix 1048 rows 1251 cols
[2022-05-20 08:02:21] [INFO ] Computed 550 place invariants in 2 ms
[2022-05-20 08:02:22] [INFO ] Implicit Places using invariants in 774 ms returned [1234, 1238]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 775 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1249/3359 places, 1048/3009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1247 transition count 1046
Applied a total of 4 rules in 43 ms. Remains 1247 /1249 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1247 cols
[2022-05-20 08:02:22] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 08:02:23] [INFO ] Implicit Places using invariants in 641 ms returned []
// Phase 1: matrix 1046 rows 1247 cols
[2022-05-20 08:02:23] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 08:02:24] [INFO ] Implicit Places using invariants and state equation in 1411 ms returned []
Implicit Place search using SMT with State Equation took 2085 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1247/3359 places, 1046/3009 transitions.
Finished structural reductions, in 2 iterations. Remains : 1247/3359 places, 1046/3009 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s103 1), p0:(EQ s1053 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 859 ms.
Stack based approach found an accepted trace after 514 steps with 0 reset with depth 515 and stack size 515 in 5 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-07 finished in 4378 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0 U F((G(p1)||p0))))||F(p1)))'
Support contains 2 out of 3359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 704 transitions
Trivial Post-agglo rules discarded 704 transitions
Performed 704 trivial Post agglomeration. Transition count delta: 704
Iterating post reduction 0 with 704 rules applied. Total rules applied 704 place count 3358 transition count 2304
Reduce places removed 704 places and 0 transitions.
Iterating post reduction 1 with 704 rules applied. Total rules applied 1408 place count 2654 transition count 2304
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1408 place count 2654 transition count 1909
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 2198 place count 2259 transition count 1909
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2203 place count 2254 transition count 1904
Iterating global reduction 2 with 5 rules applied. Total rules applied 2208 place count 2254 transition count 1904
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2208 place count 2254 transition count 1901
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 2214 place count 2251 transition count 1901
Performed 847 Post agglomeration using F-continuation condition.Transition count delta: 847
Deduced a syphon composed of 847 places in 2 ms
Reduce places removed 847 places and 0 transitions.
Iterating global reduction 2 with 1694 rules applied. Total rules applied 3908 place count 1404 transition count 1054
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3909 place count 1404 transition count 1053
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 3911 place count 1403 transition count 1052
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4113 place count 1302 transition count 1052
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 4207 place count 1255 transition count 1052
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4209 place count 1253 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4210 place count 1252 transition count 1050
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4210 place count 1252 transition count 1048
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4214 place count 1250 transition count 1048
Applied a total of 4214 rules in 627 ms. Remains 1250 /3359 variables (removed 2109) and now considering 1048/3009 (removed 1961) transitions.
// Phase 1: matrix 1048 rows 1250 cols
[2022-05-20 08:02:26] [INFO ] Computed 550 place invariants in 1 ms
[2022-05-20 08:02:27] [INFO ] Implicit Places using invariants in 701 ms returned [1233, 1237]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 712 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1248/3359 places, 1048/3009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1246 transition count 1046
Applied a total of 4 rules in 42 ms. Remains 1246 /1248 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1246 cols
[2022-05-20 08:02:27] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 08:02:27] [INFO ] Implicit Places using invariants in 653 ms returned []
// Phase 1: matrix 1046 rows 1246 cols
[2022-05-20 08:02:27] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 08:02:29] [INFO ] Implicit Places using invariants and state equation in 1262 ms returned []
Implicit Place search using SMT with State Equation took 1941 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/3359 places, 1046/3009 transitions.
Finished structural reductions, in 2 iterations. Remains : 1246/3359 places, 1046/3009 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s519 1), p0:(EQ s1225 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2552 reset in 825 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-08 finished in 4210 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||G(X(X(p1))))))'
Support contains 2 out of 3359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3352 transition count 3002
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3352 transition count 3002
Applied a total of 14 rules in 394 ms. Remains 3352 /3359 variables (removed 7) and now considering 3002/3009 (removed 7) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2022-05-20 08:02:30] [INFO ] Computed 551 place invariants in 12 ms
[2022-05-20 08:02:31] [INFO ] Implicit Places using invariants in 1091 ms returned []
// Phase 1: matrix 3002 rows 3352 cols
[2022-05-20 08:02:31] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 08:02:34] [INFO ] Implicit Places using invariants and state equation in 3212 ms returned []
Implicit Place search using SMT with State Equation took 4326 ms to find 0 implicit places.
// Phase 1: matrix 3002 rows 3352 cols
[2022-05-20 08:02:34] [INFO ] Computed 551 place invariants in 9 ms
[2022-05-20 08:02:36] [INFO ] Dead Transitions using invariants and state equation in 2025 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3352/3359 places, 3002/3009 transitions.
Finished structural reductions, in 1 iterations. Remains : 3352/3359 places, 3002/3009 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s2202 1), p0:(EQ s2486 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 318 reset in 435 ms.
Product exploration explored 100000 steps with 322 reset in 475 ms.
Computed a total of 799 stabilizing places and 799 stable transitions
Computed a total of 799 stabilizing places and 799 stable transitions
Detected a total of 799/3352 stabilizing places and 799/3002 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :1
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
Running SMT prover for 1 properties.
// Phase 1: matrix 3002 rows 3352 cols
[2022-05-20 08:02:38] [INFO ] Computed 551 place invariants in 15 ms
[2022-05-20 08:02:38] [INFO ] [Real]Absence check using 551 positive place invariants in 202 ms returned sat
[2022-05-20 08:02:40] [INFO ] After 2154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:02:40] [INFO ] [Nat]Absence check using 551 positive place invariants in 200 ms returned sat
[2022-05-20 08:02:42] [INFO ] After 1585ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:02:43] [INFO ] Deduced a trap composed of 42 places in 746 ms of which 2 ms to minimize.
[2022-05-20 08:02:44] [INFO ] Deduced a trap composed of 17 places in 768 ms of which 1 ms to minimize.
[2022-05-20 08:02:45] [INFO ] Deduced a trap composed of 19 places in 733 ms of which 1 ms to minimize.
[2022-05-20 08:02:45] [INFO ] Deduced a trap composed of 30 places in 750 ms of which 1 ms to minimize.
[2022-05-20 08:02:46] [INFO ] Deduced a trap composed of 29 places in 720 ms of which 1 ms to minimize.
[2022-05-20 08:02:47] [INFO ] Deduced a trap composed of 36 places in 740 ms of which 1 ms to minimize.
[2022-05-20 08:02:48] [INFO ] Deduced a trap composed of 30 places in 725 ms of which 2 ms to minimize.
[2022-05-20 08:02:49] [INFO ] Deduced a trap composed of 21 places in 745 ms of which 2 ms to minimize.
[2022-05-20 08:02:50] [INFO ] Deduced a trap composed of 26 places in 752 ms of which 2 ms to minimize.
[2022-05-20 08:02:50] [INFO ] Deduced a trap composed of 30 places in 704 ms of which 2 ms to minimize.
[2022-05-20 08:02:51] [INFO ] Deduced a trap composed of 16 places in 717 ms of which 2 ms to minimize.
[2022-05-20 08:02:52] [INFO ] Deduced a trap composed of 23 places in 681 ms of which 1 ms to minimize.
[2022-05-20 08:02:53] [INFO ] Deduced a trap composed of 26 places in 688 ms of which 1 ms to minimize.
[2022-05-20 08:02:54] [INFO ] Deduced a trap composed of 25 places in 691 ms of which 1 ms to minimize.
[2022-05-20 08:02:54] [INFO ] Deduced a trap composed of 27 places in 686 ms of which 1 ms to minimize.
[2022-05-20 08:02:55] [INFO ] Deduced a trap composed of 19 places in 662 ms of which 1 ms to minimize.
[2022-05-20 08:02:56] [INFO ] Deduced a trap composed of 18 places in 667 ms of which 2 ms to minimize.
[2022-05-20 08:02:57] [INFO ] Deduced a trap composed of 24 places in 640 ms of which 1 ms to minimize.
[2022-05-20 08:02:57] [INFO ] Deduced a trap composed of 32 places in 625 ms of which 1 ms to minimize.
[2022-05-20 08:02:58] [INFO ] Deduced a trap composed of 16 places in 627 ms of which 1 ms to minimize.
[2022-05-20 08:02:59] [INFO ] Deduced a trap composed of 25 places in 586 ms of which 1 ms to minimize.
[2022-05-20 08:02:59] [INFO ] Deduced a trap composed of 28 places in 603 ms of which 1 ms to minimize.
[2022-05-20 08:03:00] [INFO ] Deduced a trap composed of 28 places in 582 ms of which 2 ms to minimize.
[2022-05-20 08:03:01] [INFO ] Deduced a trap composed of 39 places in 587 ms of which 2 ms to minimize.
[2022-05-20 08:03:02] [INFO ] Deduced a trap composed of 27 places in 573 ms of which 2 ms to minimize.
[2022-05-20 08:03:02] [INFO ] Deduced a trap composed of 43 places in 566 ms of which 1 ms to minimize.
[2022-05-20 08:03:03] [INFO ] Deduced a trap composed of 42 places in 538 ms of which 2 ms to minimize.
[2022-05-20 08:03:04] [INFO ] Deduced a trap composed of 43 places in 559 ms of which 2 ms to minimize.
[2022-05-20 08:03:04] [INFO ] Deduced a trap composed of 50 places in 528 ms of which 1 ms to minimize.
[2022-05-20 08:03:05] [INFO ] Deduced a trap composed of 60 places in 519 ms of which 1 ms to minimize.
[2022-05-20 08:03:05] [INFO ] Deduced a trap composed of 32 places in 510 ms of which 1 ms to minimize.
[2022-05-20 08:03:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 08:03:05] [INFO ] After 25552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 31 ms.
Support contains 2 out of 3352 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3352/3352 places, 3002/3002 transitions.
Drop transitions removed 697 transitions
Trivial Post-agglo rules discarded 697 transitions
Performed 697 trivial Post agglomeration. Transition count delta: 697
Iterating post reduction 0 with 697 rules applied. Total rules applied 697 place count 3352 transition count 2305
Reduce places removed 697 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 698 rules applied. Total rules applied 1395 place count 2655 transition count 2304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1396 place count 2654 transition count 2304
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 1396 place count 2654 transition count 1904
Deduced a syphon composed of 400 places in 2 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 2196 place count 2254 transition count 1904
Performed 850 Post agglomeration using F-continuation condition.Transition count delta: 850
Deduced a syphon composed of 850 places in 1 ms
Reduce places removed 850 places and 0 transitions.
Iterating global reduction 3 with 1700 rules applied. Total rules applied 3896 place count 1404 transition count 1054
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3897 place count 1404 transition count 1053
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 3899 place count 1403 transition count 1052
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4101 place count 1302 transition count 1052
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 4195 place count 1255 transition count 1052
Partial Free-agglomeration rule applied 149 times.
Drop transitions removed 149 transitions
Iterating global reduction 4 with 149 rules applied. Total rules applied 4344 place count 1255 transition count 1052
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4345 place count 1254 transition count 1051
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4346 place count 1253 transition count 1051
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4346 place count 1253 transition count 1049
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4350 place count 1251 transition count 1049
Applied a total of 4350 rules in 517 ms. Remains 1251 /3352 variables (removed 2101) and now considering 1049/3002 (removed 1953) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/3352 places, 1049/3002 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 179073 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 179073 steps, saw 149419 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1049 rows 1251 cols
[2022-05-20 08:03:09] [INFO ] Computed 550 place invariants in 4 ms
[2022-05-20 08:03:09] [INFO ] [Real]Absence check using 550 positive place invariants in 79 ms returned sat
[2022-05-20 08:03:09] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:03:10] [INFO ] [Nat]Absence check using 550 positive place invariants in 76 ms returned sat
[2022-05-20 08:03:10] [INFO ] After 400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:03:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 08:03:10] [INFO ] After 40ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 08:03:10] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 1 ms to minimize.
[2022-05-20 08:03:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2022-05-20 08:03:10] [INFO ] After 248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-05-20 08:03:10] [INFO ] After 901ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 1251 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1251/1251 places, 1049/1049 transitions.
Applied a total of 0 rules in 45 ms. Remains 1251 /1251 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1251 places, 1049/1049 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1251/1251 places, 1049/1049 transitions.
Applied a total of 0 rules in 22 ms. Remains 1251 /1251 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
// Phase 1: matrix 1049 rows 1251 cols
[2022-05-20 08:03:10] [INFO ] Computed 550 place invariants in 3 ms
[2022-05-20 08:03:11] [INFO ] Implicit Places using invariants in 669 ms returned [1234, 1238]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 688 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1249/1251 places, 1049/1049 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1247 transition count 1047
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1247 transition count 1047
Applied a total of 4 rules in 60 ms. Remains 1247 /1249 variables (removed 2) and now considering 1047/1049 (removed 2) transitions.
// Phase 1: matrix 1047 rows 1247 cols
[2022-05-20 08:03:11] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 08:03:12] [INFO ] Implicit Places using invariants in 639 ms returned []
// Phase 1: matrix 1047 rows 1247 cols
[2022-05-20 08:03:12] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 08:03:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 08:03:13] [INFO ] Implicit Places using invariants and state equation in 1282 ms returned []
Implicit Place search using SMT with State Equation took 1954 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1247/1251 places, 1047/1049 transitions.
Finished structural reductions, in 2 iterations. Remains : 1247/1251 places, 1047/1049 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 170937 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 170937 steps, saw 141289 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1047 rows 1247 cols
[2022-05-20 08:03:16] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 08:03:16] [INFO ] [Real]Absence check using 548 positive place invariants in 76 ms returned sat
[2022-05-20 08:03:16] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:03:17] [INFO ] [Nat]Absence check using 548 positive place invariants in 76 ms returned sat
[2022-05-20 08:03:17] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:03:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 08:03:17] [INFO ] After 40ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 08:03:17] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-05-20 08:03:17] [INFO ] After 772ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 2 out of 1247 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1247/1247 places, 1047/1047 transitions.
Applied a total of 0 rules in 22 ms. Remains 1247 /1247 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1247/1247 places, 1047/1047 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1247/1247 places, 1047/1047 transitions.
Applied a total of 0 rules in 22 ms. Remains 1247 /1247 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
// Phase 1: matrix 1047 rows 1247 cols
[2022-05-20 08:03:17] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 08:03:18] [INFO ] Implicit Places using invariants in 652 ms returned []
// Phase 1: matrix 1047 rows 1247 cols
[2022-05-20 08:03:18] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 08:03:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 08:03:19] [INFO ] Implicit Places using invariants and state equation in 1324 ms returned []
Implicit Place search using SMT with State Equation took 2008 ms to find 0 implicit places.
[2022-05-20 08:03:19] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 1047 rows 1247 cols
[2022-05-20 08:03:19] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 08:03:20] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1247/1247 places, 1047/1047 transitions.
Partial Free-agglomeration rule applied 294 times.
Drop transitions removed 294 transitions
Iterating global reduction 0 with 294 rules applied. Total rules applied 294 place count 1247 transition count 1047
Applied a total of 294 rules in 54 ms. Remains 1247 /1247 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1047 rows 1247 cols
[2022-05-20 08:03:20] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 08:03:20] [INFO ] [Real]Absence check using 548 positive place invariants in 76 ms returned sat
[2022-05-20 08:03:20] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:03:20] [INFO ] [Nat]Absence check using 548 positive place invariants in 75 ms returned sat
[2022-05-20 08:03:21] [INFO ] After 407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:03:21] [INFO ] State equation strengthened by 292 read => feed constraints.
[2022-05-20 08:03:21] [INFO ] After 107ms SMT Verify possible using 292 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 08:03:21] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 1 ms to minimize.
[2022-05-20 08:03:22] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 1 ms to minimize.
[2022-05-20 08:03:22] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 0 ms to minimize.
[2022-05-20 08:03:22] [INFO ] Deduced a trap composed of 7 places in 262 ms of which 1 ms to minimize.
[2022-05-20 08:03:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1296 ms
[2022-05-20 08:03:22] [INFO ] After 1467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2022-05-20 08:03:22] [INFO ] After 2169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 08:03:22] [INFO ] Flatten gal took : 33 ms
[2022-05-20 08:03:22] [INFO ] Flatten gal took : 33 ms
[2022-05-20 08:03:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14445581024147574946.gal : 4 ms
[2022-05-20 08:03:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7226220706344101972.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13306383947256825954;'/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/ReachabilityCardinality14445581024147574946.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7226220706344101972.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/ReachabilityCardinality7226220706344101972.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 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 45
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :45 after 86
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :86 after 119
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :119 after 167
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :167 after 664
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :664 after 12382
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :12382 after 951647
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :951647 after 7.92832e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7.92832e+07 after 4.13651e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.13651e+08 after 1.02257e+12
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.02257e+12 after 9.21523e+14
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :9.21523e+14 after 8.80114e+18
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :8.80114e+18 after 7.0061e+22
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :7.0061e+22 after 3.69365e+29
Detected timeout of ITS tools.
[2022-05-20 08:03:38] [INFO ] Flatten gal took : 44 ms
[2022-05-20 08:03:38] [INFO ] Applying decomposition
[2022-05-20 08:03:38] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8196962278274158310.txt' '-o' '/tmp/graph8196962278274158310.bin' '-w' '/tmp/graph8196962278274158310.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8196962278274158310.bin' '-l' '-1' '-v' '-w' '/tmp/graph8196962278274158310.weights' '-q' '0' '-e' '0.001'
[2022-05-20 08:03:38] [INFO ] Decomposing Gal with order
[2022-05-20 08:03:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:03:38] [INFO ] Removed a total of 239 redundant transitions.
[2022-05-20 08:03:38] [INFO ] Flatten gal took : 81 ms
[2022-05-20 08:03:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 10 ms.
[2022-05-20 08:03:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12965643852139465405.gal : 30 ms
[2022-05-20 08:03:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12436784603762947618.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13306383947256825954;'/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/ReachabilityCardinality12965643852139465405.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12436784603762947618.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/ReachabilityCardinality12436784603762947618.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 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 1
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3925665511292489235
[2022-05-20 08:03:53] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3925665511292489235
Running compilation step : cd /tmp/ltsmin3925665511292489235;'/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 1975 ms.
Running link step : cd /tmp/ltsmin3925665511292489235;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3925665511292489235;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 204 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 3002 rows 3352 cols
[2022-05-20 08:04:09] [INFO ] Computed 551 place invariants in 12 ms
[2022-05-20 08:04:12] [INFO ] [Real]Absence check using 551 positive place invariants in 1307 ms returned sat
[2022-05-20 08:04:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:04:24] [INFO ] [Real]Absence check using state equation in 11589 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 2 out of 3352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3352/3352 places, 3002/3002 transitions.
Applied a total of 0 rules in 208 ms. Remains 3352 /3352 variables (removed 0) and now considering 3002/3002 (removed 0) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2022-05-20 08:04:24] [INFO ] Computed 551 place invariants in 17 ms
[2022-05-20 08:04:25] [INFO ] Implicit Places using invariants in 1103 ms returned []
// Phase 1: matrix 3002 rows 3352 cols
[2022-05-20 08:04:25] [INFO ] Computed 551 place invariants in 16 ms
[2022-05-20 08:04:28] [INFO ] Implicit Places using invariants and state equation in 3313 ms returned []
Implicit Place search using SMT with State Equation took 4433 ms to find 0 implicit places.
// Phase 1: matrix 3002 rows 3352 cols
[2022-05-20 08:04:28] [INFO ] Computed 551 place invariants in 13 ms
[2022-05-20 08:04:30] [INFO ] Dead Transitions using invariants and state equation in 2104 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3352/3352 places, 3002/3002 transitions.
Computed a total of 799 stabilizing places and 799 stable transitions
Computed a total of 799 stabilizing places and 799 stable transitions
Detected a total of 799/3352 stabilizing places and 799/3002 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 192 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3002 rows 3352 cols
[2022-05-20 08:04:31] [INFO ] Computed 551 place invariants in 13 ms
[2022-05-20 08:04:31] [INFO ] [Real]Absence check using 551 positive place invariants in 223 ms returned sat
[2022-05-20 08:04:33] [INFO ] After 2238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:04:34] [INFO ] [Nat]Absence check using 551 positive place invariants in 209 ms returned sat
[2022-05-20 08:04:35] [INFO ] After 1662ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:04:36] [INFO ] Deduced a trap composed of 42 places in 763 ms of which 2 ms to minimize.
[2022-05-20 08:04:37] [INFO ] Deduced a trap composed of 17 places in 762 ms of which 1 ms to minimize.
[2022-05-20 08:04:38] [INFO ] Deduced a trap composed of 19 places in 758 ms of which 2 ms to minimize.
[2022-05-20 08:04:39] [INFO ] Deduced a trap composed of 30 places in 731 ms of which 2 ms to minimize.
[2022-05-20 08:04:40] [INFO ] Deduced a trap composed of 29 places in 729 ms of which 2 ms to minimize.
[2022-05-20 08:04:40] [INFO ] Deduced a trap composed of 36 places in 757 ms of which 2 ms to minimize.
[2022-05-20 08:04:41] [INFO ] Deduced a trap composed of 30 places in 725 ms of which 1 ms to minimize.
[2022-05-20 08:04:42] [INFO ] Deduced a trap composed of 21 places in 711 ms of which 2 ms to minimize.
[2022-05-20 08:04:43] [INFO ] Deduced a trap composed of 26 places in 694 ms of which 1 ms to minimize.
[2022-05-20 08:04:44] [INFO ] Deduced a trap composed of 30 places in 699 ms of which 2 ms to minimize.
[2022-05-20 08:04:45] [INFO ] Deduced a trap composed of 16 places in 690 ms of which 2 ms to minimize.
[2022-05-20 08:04:45] [INFO ] Deduced a trap composed of 23 places in 678 ms of which 1 ms to minimize.
[2022-05-20 08:04:46] [INFO ] Deduced a trap composed of 26 places in 675 ms of which 2 ms to minimize.
[2022-05-20 08:04:47] [INFO ] Deduced a trap composed of 25 places in 656 ms of which 1 ms to minimize.
[2022-05-20 08:04:48] [INFO ] Deduced a trap composed of 27 places in 668 ms of which 2 ms to minimize.
[2022-05-20 08:04:48] [INFO ] Deduced a trap composed of 19 places in 656 ms of which 1 ms to minimize.
[2022-05-20 08:04:49] [INFO ] Deduced a trap composed of 18 places in 646 ms of which 2 ms to minimize.
[2022-05-20 08:04:50] [INFO ] Deduced a trap composed of 24 places in 638 ms of which 1 ms to minimize.
[2022-05-20 08:04:51] [INFO ] Deduced a trap composed of 32 places in 632 ms of which 1 ms to minimize.
[2022-05-20 08:04:51] [INFO ] Deduced a trap composed of 16 places in 624 ms of which 1 ms to minimize.
[2022-05-20 08:04:52] [INFO ] Deduced a trap composed of 25 places in 590 ms of which 1 ms to minimize.
[2022-05-20 08:04:53] [INFO ] Deduced a trap composed of 28 places in 573 ms of which 2 ms to minimize.
[2022-05-20 08:04:53] [INFO ] Deduced a trap composed of 28 places in 580 ms of which 1 ms to minimize.
[2022-05-20 08:04:54] [INFO ] Deduced a trap composed of 39 places in 561 ms of which 1 ms to minimize.
[2022-05-20 08:04:55] [INFO ] Deduced a trap composed of 27 places in 553 ms of which 3 ms to minimize.
[2022-05-20 08:04:55] [INFO ] Deduced a trap composed of 43 places in 550 ms of which 1 ms to minimize.
[2022-05-20 08:04:56] [INFO ] Deduced a trap composed of 42 places in 537 ms of which 1 ms to minimize.
[2022-05-20 08:04:57] [INFO ] Deduced a trap composed of 43 places in 523 ms of which 2 ms to minimize.
[2022-05-20 08:04:57] [INFO ] Deduced a trap composed of 50 places in 516 ms of which 1 ms to minimize.
[2022-05-20 08:04:58] [INFO ] Deduced a trap composed of 60 places in 506 ms of which 1 ms to minimize.
[2022-05-20 08:04:59] [INFO ] Deduced a trap composed of 32 places in 519 ms of which 2 ms to minimize.
[2022-05-20 08:04:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 08:04:59] [INFO ] After 25520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 38 ms.
Support contains 2 out of 3352 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3352/3352 places, 3002/3002 transitions.
Drop transitions removed 697 transitions
Trivial Post-agglo rules discarded 697 transitions
Performed 697 trivial Post agglomeration. Transition count delta: 697
Iterating post reduction 0 with 697 rules applied. Total rules applied 697 place count 3352 transition count 2305
Reduce places removed 697 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 698 rules applied. Total rules applied 1395 place count 2655 transition count 2304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1396 place count 2654 transition count 2304
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 1396 place count 2654 transition count 1904
Deduced a syphon composed of 400 places in 3 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 2196 place count 2254 transition count 1904
Performed 850 Post agglomeration using F-continuation condition.Transition count delta: 850
Deduced a syphon composed of 850 places in 1 ms
Reduce places removed 850 places and 0 transitions.
Iterating global reduction 3 with 1700 rules applied. Total rules applied 3896 place count 1404 transition count 1054
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3897 place count 1404 transition count 1053
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 3899 place count 1403 transition count 1052
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4101 place count 1302 transition count 1052
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 4195 place count 1255 transition count 1052
Partial Free-agglomeration rule applied 149 times.
Drop transitions removed 149 transitions
Iterating global reduction 4 with 149 rules applied. Total rules applied 4344 place count 1255 transition count 1052
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4345 place count 1254 transition count 1051
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4346 place count 1253 transition count 1051
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4346 place count 1253 transition count 1049
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4350 place count 1251 transition count 1049
Applied a total of 4350 rules in 505 ms. Remains 1251 /3352 variables (removed 2101) and now considering 1049/3002 (removed 1953) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/3352 places, 1049/3002 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 180058 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 180058 steps, saw 150223 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1049 rows 1251 cols
[2022-05-20 08:05:02] [INFO ] Computed 550 place invariants in 5 ms
[2022-05-20 08:05:03] [INFO ] [Real]Absence check using 550 positive place invariants in 94 ms returned sat
[2022-05-20 08:05:03] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:05:03] [INFO ] [Nat]Absence check using 550 positive place invariants in 75 ms returned sat
[2022-05-20 08:05:03] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:05:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 08:05:03] [INFO ] After 44ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 08:05:03] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2022-05-20 08:05:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2022-05-20 08:05:03] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2022-05-20 08:05:03] [INFO ] After 904ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 1251 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1251/1251 places, 1049/1049 transitions.
Applied a total of 0 rules in 22 ms. Remains 1251 /1251 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1251 places, 1049/1049 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1251/1251 places, 1049/1049 transitions.
Applied a total of 0 rules in 22 ms. Remains 1251 /1251 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
// Phase 1: matrix 1049 rows 1251 cols
[2022-05-20 08:05:04] [INFO ] Computed 550 place invariants in 5 ms
[2022-05-20 08:05:04] [INFO ] Implicit Places using invariants in 677 ms returned [1234, 1238]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 679 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1249/1251 places, 1049/1049 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1247 transition count 1047
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1247 transition count 1047
Applied a total of 4 rules in 42 ms. Remains 1247 /1249 variables (removed 2) and now considering 1047/1049 (removed 2) transitions.
// Phase 1: matrix 1047 rows 1247 cols
[2022-05-20 08:05:04] [INFO ] Computed 548 place invariants in 5 ms
[2022-05-20 08:05:05] [INFO ] Implicit Places using invariants in 625 ms returned []
// Phase 1: matrix 1047 rows 1247 cols
[2022-05-20 08:05:05] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 08:05:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 08:05:06] [INFO ] Implicit Places using invariants and state equation in 1358 ms returned []
Implicit Place search using SMT with State Equation took 1985 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1247/1251 places, 1047/1049 transitions.
Finished structural reductions, in 2 iterations. Remains : 1247/1251 places, 1047/1049 transitions.
Finished random walk after 9699 steps, including 2 resets, run visited all 1 properties in 89 ms. (steps per millisecond=108 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 239 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 3002 rows 3352 cols
[2022-05-20 08:05:07] [INFO ] Computed 551 place invariants in 15 ms
[2022-05-20 08:05:10] [INFO ] [Real]Absence check using 551 positive place invariants in 1245 ms returned sat
[2022-05-20 08:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:05:22] [INFO ] [Real]Absence check using state equation in 11632 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 321 reset in 399 ms.
Product exploration explored 100000 steps with 327 reset in 428 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 3352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3352/3352 places, 3002/3002 transitions.
Performed 698 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 3352 transition count 3002
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 251 Pre rules applied. Total rules applied 698 place count 3352 transition count 3201
Deduced a syphon composed of 949 places in 5 ms
Iterating global reduction 1 with 251 rules applied. Total rules applied 949 place count 3352 transition count 3201
Performed 949 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1898 places in 5 ms
Iterating global reduction 1 with 949 rules applied. Total rules applied 1898 place count 3352 transition count 3201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1899 place count 3352 transition count 3200
Renaming transitions due to excessive name length > 1024 char.
Discarding 350 places :
Symmetric choice reduction at 2 with 350 rule applications. Total rules 2249 place count 3002 transition count 2850
Deduced a syphon composed of 1548 places in 5 ms
Iterating global reduction 2 with 350 rules applied. Total rules applied 2599 place count 3002 transition count 2850
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1549 places in 5 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2600 place count 3002 transition count 2850
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2602 place count 3000 transition count 2848
Deduced a syphon composed of 1547 places in 5 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2604 place count 3000 transition count 2848
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 1648 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2705 place count 3000 transition count 3278
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2806 place count 2899 transition count 3076
Deduced a syphon composed of 1547 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2907 place count 2899 transition count 3076
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -408
Deduced a syphon composed of 1644 places in 4 ms
Iterating global reduction 2 with 97 rules applied. Total rules applied 3004 place count 2899 transition count 3484
Discarding 97 places :
Symmetric choice reduction at 2 with 97 rule applications. Total rules 3101 place count 2802 transition count 3290
Deduced a syphon composed of 1547 places in 3 ms
Iterating global reduction 2 with 97 rules applied. Total rules applied 3198 place count 2802 transition count 3290
Deduced a syphon composed of 1547 places in 4 ms
Applied a total of 3198 rules in 1560 ms. Remains 2802 /3352 variables (removed 550) and now considering 3290/3002 (removed -288) transitions.
[2022-05-20 08:05:24] [INFO ] Redundant transitions in 104 ms returned []
// Phase 1: matrix 3290 rows 2802 cols
[2022-05-20 08:05:25] [INFO ] Computed 551 place invariants in 37 ms
[2022-05-20 08:05:26] [INFO ] Dead Transitions using invariants and state equation in 1985 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2802/3352 places, 3290/3002 transitions.
Finished structural reductions, in 1 iterations. Remains : 2802/3352 places, 3290/3002 transitions.
Product exploration explored 100000 steps with 12002 reset in 3760 ms.
Stack based approach found an accepted trace after 87 steps with 9 reset with depth 5 and stack size 4 in 4 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-09 finished in 180777 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 3359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 3358 transition count 2307
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 2657 transition count 2307
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 396 Pre rules applied. Total rules applied 1402 place count 2657 transition count 1911
Deduced a syphon composed of 396 places in 4 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 2 with 792 rules applied. Total rules applied 2194 place count 2261 transition count 1911
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2199 place count 2256 transition count 1906
Iterating global reduction 2 with 5 rules applied. Total rules applied 2204 place count 2256 transition count 1906
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2204 place count 2256 transition count 1902
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2212 place count 2252 transition count 1902
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 1 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 2 with 1692 rules applied. Total rules applied 3904 place count 1406 transition count 1056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3905 place count 1406 transition count 1055
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 3907 place count 1405 transition count 1054
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4109 place count 1304 transition count 1054
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4205 place count 1256 transition count 1054
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4207 place count 1254 transition count 1052
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4208 place count 1253 transition count 1052
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4208 place count 1253 transition count 1050
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4212 place count 1251 transition count 1050
Applied a total of 4212 rules in 575 ms. Remains 1251 /3359 variables (removed 2108) and now considering 1050/3009 (removed 1959) transitions.
// Phase 1: matrix 1050 rows 1251 cols
[2022-05-20 08:05:31] [INFO ] Computed 550 place invariants in 4 ms
[2022-05-20 08:05:32] [INFO ] Implicit Places using invariants in 661 ms returned [1234, 1238]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 663 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1249/3359 places, 1050/3009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1247 transition count 1048
Applied a total of 4 rules in 47 ms. Remains 1247 /1249 variables (removed 2) and now considering 1048/1050 (removed 2) transitions.
// Phase 1: matrix 1048 rows 1247 cols
[2022-05-20 08:05:32] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 08:05:32] [INFO ] Implicit Places using invariants in 646 ms returned []
// Phase 1: matrix 1048 rows 1247 cols
[2022-05-20 08:05:32] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 08:05:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 08:05:34] [INFO ] Implicit Places using invariants and state equation in 1362 ms returned []
Implicit Place search using SMT with State Equation took 2009 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1247/3359 places, 1048/3009 transitions.
Finished structural reductions, in 2 iterations. Remains : 1247/3359 places, 1048/3009 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-10 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:(AND (NEQ s1176 1) (EQ s720 1) (EQ s736 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 0 reset in 888 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 1 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-10 finished in 4289 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0) U G(p1))||X(p2)))'
Support contains 5 out of 3359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3351 transition count 3001
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3351 transition count 3001
Applied a total of 16 rules in 412 ms. Remains 3351 /3359 variables (removed 8) and now considering 3001/3009 (removed 8) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 08:05:35] [INFO ] Computed 551 place invariants in 17 ms
[2022-05-20 08:05:36] [INFO ] Implicit Places using invariants in 1158 ms returned []
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 08:05:36] [INFO ] Computed 551 place invariants in 18 ms
[2022-05-20 08:05:40] [INFO ] Implicit Places using invariants and state equation in 3450 ms returned []
Implicit Place search using SMT with State Equation took 4610 ms to find 0 implicit places.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 08:05:40] [INFO ] Computed 551 place invariants in 17 ms
[2022-05-20 08:05:42] [INFO ] Dead Transitions using invariants and state equation in 2067 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3359 places, 3001/3009 transitions.
Finished structural reductions, in 1 iterations. Remains : 3351/3359 places, 3001/3009 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p1 p0 (NOT p2)), p0, (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s1378 1), p0:(AND (EQ s1210 1) (EQ s1259 1)), p2:(AND (EQ s2327 1) (EQ s2353 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 992 ms.
Stack based approach found an accepted trace after 1856 steps with 0 reset with depth 1857 and stack size 1857 in 21 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-12 finished in 8334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((G((X(F(p1))||p2))&&p0)))))'
Support contains 4 out of 3359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3352 transition count 3002
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3352 transition count 3002
Applied a total of 14 rules in 401 ms. Remains 3352 /3359 variables (removed 7) and now considering 3002/3009 (removed 7) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2022-05-20 08:05:43] [INFO ] Computed 551 place invariants in 14 ms
[2022-05-20 08:05:45] [INFO ] Implicit Places using invariants in 1396 ms returned []
// Phase 1: matrix 3002 rows 3352 cols
[2022-05-20 08:05:45] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 08:05:48] [INFO ] Implicit Places using invariants and state equation in 3290 ms returned []
Implicit Place search using SMT with State Equation took 4717 ms to find 0 implicit places.
// Phase 1: matrix 3002 rows 3352 cols
[2022-05-20 08:05:48] [INFO ] Computed 551 place invariants in 9 ms
[2022-05-20 08:05:50] [INFO ] Dead Transitions using invariants and state equation in 2052 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3352/3359 places, 3002/3009 transitions.
Finished structural reductions, in 1 iterations. Remains : 3352/3359 places, 3002/3009 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1467 1) (EQ s1504 1)), p2:(EQ s254 0), p1:(AND (OR (EQ s1467 0) (EQ s1504 0)) (EQ s2596 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-13 finished in 7395 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 1 out of 3359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 703 transitions
Trivial Post-agglo rules discarded 703 transitions
Performed 703 trivial Post agglomeration. Transition count delta: 703
Iterating post reduction 0 with 703 rules applied. Total rules applied 703 place count 3358 transition count 2305
Reduce places removed 703 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 704 rules applied. Total rules applied 1407 place count 2655 transition count 2304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1408 place count 2654 transition count 2304
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 395 Pre rules applied. Total rules applied 1408 place count 2654 transition count 1909
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 3 with 790 rules applied. Total rules applied 2198 place count 2259 transition count 1909
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2204 place count 2253 transition count 1903
Iterating global reduction 3 with 6 rules applied. Total rules applied 2210 place count 2253 transition count 1903
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 2210 place count 2253 transition count 1899
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 2218 place count 2249 transition count 1899
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 1 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 3 with 1692 rules applied. Total rules applied 3910 place count 1403 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3911 place count 1403 transition count 1052
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 3913 place count 1402 transition count 1051
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4115 place count 1301 transition count 1051
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 4209 place count 1254 transition count 1051
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4211 place count 1252 transition count 1049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4212 place count 1251 transition count 1049
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4212 place count 1251 transition count 1047
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4216 place count 1249 transition count 1047
Applied a total of 4216 rules in 595 ms. Remains 1249 /3359 variables (removed 2110) and now considering 1047/3009 (removed 1962) transitions.
// Phase 1: matrix 1047 rows 1249 cols
[2022-05-20 08:05:51] [INFO ] Computed 550 place invariants in 4 ms
[2022-05-20 08:05:52] [INFO ] Implicit Places using invariants in 905 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 920 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1247/3359 places, 1047/3009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1245 transition count 1045
Applied a total of 4 rules in 47 ms. Remains 1245 /1247 variables (removed 2) and now considering 1045/1047 (removed 2) transitions.
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-20 08:05:52] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 08:05:53] [INFO ] Implicit Places using invariants in 674 ms returned []
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-20 08:05:53] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 08:05:54] [INFO ] Implicit Places using invariants and state equation in 1354 ms returned []
Implicit Place search using SMT with State Equation took 2047 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1245/3359 places, 1045/3009 transitions.
Finished structural reductions, in 2 iterations. Remains : 1245/3359 places, 1045/3009 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s151 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 817 ms.
Product exploration explored 100000 steps with 0 reset in 1018 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 126 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 34 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 188072 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188072 steps, saw 135327 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-20 08:05:59] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 08:05:59] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:06:00] [INFO ] [Nat]Absence check using 548 positive place invariants in 75 ms returned sat
[2022-05-20 08:06:00] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:06:00] [INFO ] After 467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2022-05-20 08:06:00] [INFO ] After 753ms 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 1245 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1245/1245 places, 1045/1045 transitions.
Applied a total of 0 rules in 21 ms. Remains 1245 /1245 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1045/1045 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 185619 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 185619 steps, saw 133610 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-20 08:06:03] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 08:06:03] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:06:04] [INFO ] [Nat]Absence check using 548 positive place invariants in 156 ms returned sat
[2022-05-20 08:06:04] [INFO ] After 394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:06:04] [INFO ] After 474ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2022-05-20 08:06:04] [INFO ] After 860ms 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 1245 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1245/1245 places, 1045/1045 transitions.
Applied a total of 0 rules in 31 ms. Remains 1245 /1245 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1045/1045 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1245/1245 places, 1045/1045 transitions.
Applied a total of 0 rules in 29 ms. Remains 1245 /1245 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-20 08:06:04] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 08:06:05] [INFO ] Implicit Places using invariants in 640 ms returned []
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-20 08:06:05] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 08:06:06] [INFO ] Implicit Places using invariants and state equation in 1248 ms returned []
Implicit Place search using SMT with State Equation took 1900 ms to find 0 implicit places.
[2022-05-20 08:06:06] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-20 08:06:06] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 08:06:07] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1045/1045 transitions.
Partial Free-agglomeration rule applied 294 times.
Drop transitions removed 294 transitions
Iterating global reduction 0 with 294 rules applied. Total rules applied 294 place count 1245 transition count 1045
Applied a total of 294 rules in 64 ms. Remains 1245 /1245 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-20 08:06:07] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 08:06:07] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:06:07] [INFO ] [Nat]Absence check using 548 positive place invariants in 77 ms returned sat
[2022-05-20 08:06:08] [INFO ] After 395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:06:08] [INFO ] After 465ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2022-05-20 08:06:08] [INFO ] After 742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 08:06:08] [INFO ] Flatten gal took : 32 ms
[2022-05-20 08:06:08] [INFO ] Flatten gal took : 28 ms
[2022-05-20 08:06:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4792037308538559809.gal : 4 ms
[2022-05-20 08:06:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality115782728308705162.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10930664744624602245;'/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/ReachabilityCardinality4792037308538559809.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality115782728308705162.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...318
Loading property file /tmp/ReachabilityCardinality115782728308705162.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 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,129,0.579691,13368,2,2614,11,8848,6,0,6028,2007,0
Total reachable state count : 129

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,0.582855,13632,2,1251,11,8848,7,0,6031,2007,0
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 126 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 34 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p0)]
Support contains 1 out of 1245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1245/1245 places, 1045/1045 transitions.
Applied a total of 0 rules in 28 ms. Remains 1245 /1245 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-20 08:06:09] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 08:06:09] [INFO ] Implicit Places using invariants in 651 ms returned []
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-20 08:06:09] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 08:06:11] [INFO ] Implicit Places using invariants and state equation in 1277 ms returned []
Implicit Place search using SMT with State Equation took 1957 ms to find 0 implicit places.
[2022-05-20 08:06:11] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-20 08:06:11] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 08:06:11] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1045/1045 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 194 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 43 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 192642 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 192642 steps, saw 138882 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-20 08:06:15] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 08:06:15] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:06:15] [INFO ] [Nat]Absence check using 548 positive place invariants in 74 ms returned sat
[2022-05-20 08:06:16] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:06:16] [INFO ] After 466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2022-05-20 08:06:16] [INFO ] After 733ms 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 1245 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1245/1245 places, 1045/1045 transitions.
Applied a total of 0 rules in 22 ms. Remains 1245 /1245 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1045/1045 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 188966 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188966 steps, saw 136014 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-20 08:06:19] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 08:06:19] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:06:19] [INFO ] [Nat]Absence check using 548 positive place invariants in 76 ms returned sat
[2022-05-20 08:06:20] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:06:20] [INFO ] After 457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-05-20 08:06:20] [INFO ] After 727ms 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 1245 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1245/1245 places, 1045/1045 transitions.
Applied a total of 0 rules in 22 ms. Remains 1245 /1245 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1045/1045 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1245/1245 places, 1045/1045 transitions.
Applied a total of 0 rules in 22 ms. Remains 1245 /1245 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-20 08:06:20] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 08:06:21] [INFO ] Implicit Places using invariants in 1305 ms returned []
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-20 08:06:21] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 08:06:22] [INFO ] Implicit Places using invariants and state equation in 1266 ms returned []
Implicit Place search using SMT with State Equation took 2583 ms to find 0 implicit places.
[2022-05-20 08:06:22] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-20 08:06:22] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 08:06:23] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1045/1045 transitions.
Partial Free-agglomeration rule applied 294 times.
Drop transitions removed 294 transitions
Iterating global reduction 0 with 294 rules applied. Total rules applied 294 place count 1245 transition count 1045
Applied a total of 294 rules in 51 ms. Remains 1245 /1245 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-20 08:06:23] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 08:06:23] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:06:23] [INFO ] [Nat]Absence check using 548 positive place invariants in 74 ms returned sat
[2022-05-20 08:06:24] [INFO ] After 395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:06:24] [INFO ] After 462ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2022-05-20 08:06:24] [INFO ] After 740ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 08:06:24] [INFO ] Flatten gal took : 28 ms
[2022-05-20 08:06:24] [INFO ] Flatten gal took : 27 ms
[2022-05-20 08:06:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11255624502380241860.gal : 3 ms
[2022-05-20 08:06:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7325369645572647758.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms881448882508690620;'/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/ReachabilityCardinality11255624502380241860.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7325369645572647758.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/ReachabilityCardinality7325369645572647758.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 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,129,0.557089,13372,2,2614,11,8848,6,0,6028,2007,0
Total reachable state count : 129

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,0.560251,13636,2,1251,11,8848,7,0,6031,2007,0
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 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 32 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 821 ms.
Product exploration explored 100000 steps with 0 reset in 1072 ms.
Built C files in :
/tmp/ltsmin8992229479974341248
[2022-05-20 08:06:27] [INFO ] Computing symmetric may disable matrix : 1045 transitions.
[2022-05-20 08:06:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 08:06:27] [INFO ] Computing symmetric may enable matrix : 1045 transitions.
[2022-05-20 08:06:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 08:06:27] [INFO ] Computing Do-Not-Accords matrix : 1045 transitions.
[2022-05-20 08:06:27] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 08:06:27] [INFO ] Built C files in 190ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8992229479974341248
Running compilation step : cd /tmp/ltsmin8992229479974341248;'/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/ltsmin8992229479974341248;'/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/ltsmin8992229479974341248;'/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 1 out of 1245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1245/1245 places, 1045/1045 transitions.
Applied a total of 0 rules in 22 ms. Remains 1245 /1245 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-20 08:06:30] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 08:06:31] [INFO ] Implicit Places using invariants in 720 ms returned []
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-20 08:06:31] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 08:06:32] [INFO ] Implicit Places using invariants and state equation in 1238 ms returned []
Implicit Place search using SMT with State Equation took 1977 ms to find 0 implicit places.
[2022-05-20 08:06:32] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-20 08:06:32] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 08:06:33] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1045/1045 transitions.
Built C files in :
/tmp/ltsmin2866187684964526710
[2022-05-20 08:06:33] [INFO ] Computing symmetric may disable matrix : 1045 transitions.
[2022-05-20 08:06:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 08:06:33] [INFO ] Computing symmetric may enable matrix : 1045 transitions.
[2022-05-20 08:06:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 08:06:33] [INFO ] Computing Do-Not-Accords matrix : 1045 transitions.
[2022-05-20 08:06:33] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 08:06:33] [INFO ] Built C files in 157ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2866187684964526710
Running compilation step : cd /tmp/ltsmin2866187684964526710;'/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/ltsmin2866187684964526710;'/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/ltsmin2866187684964526710;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 08:06:36] [INFO ] Flatten gal took : 36 ms
[2022-05-20 08:06:36] [INFO ] Flatten gal took : 26 ms
[2022-05-20 08:06:36] [INFO ] Time to serialize gal into /tmp/LTL1585915247642285946.gal : 2 ms
[2022-05-20 08:06:36] [INFO ] Time to serialize properties into /tmp/LTL6136121700580946979.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/LTL1585915247642285946.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6136121700580946979.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/LTL1585915...266
Read 1 LTL properties
Checking formula 0 : !((G("(p498==0)")))
Formula 0 simplified : !G"(p498==0)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 3.73747e+82 deadlock states
Detected timeout of ITS tools.
[2022-05-20 08:06:51] [INFO ] Flatten gal took : 27 ms
[2022-05-20 08:06:51] [INFO ] Applying decomposition
[2022-05-20 08:06:51] [INFO ] Flatten gal took : 30 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/graph7323572845718072080.txt' '-o' '/tmp/graph7323572845718072080.bin' '-w' '/tmp/graph7323572845718072080.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7323572845718072080.bin' '-l' '-1' '-v' '-w' '/tmp/graph7323572845718072080.weights' '-q' '0' '-e' '0.001'
[2022-05-20 08:06:51] [INFO ] Decomposing Gal with order
[2022-05-20 08:06:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:06:51] [INFO ] Removed a total of 305 redundant transitions.
[2022-05-20 08:06:51] [INFO ] Flatten gal took : 66 ms
[2022-05-20 08:06:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 296 labels/synchronizations in 27 ms.
[2022-05-20 08:06:51] [INFO ] Time to serialize gal into /tmp/LTL16423708548435997583.gal : 24 ms
[2022-05-20 08:06:51] [INFO ] Time to serialize properties into /tmp/LTL5275729930936258179.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/LTL16423708548435997583.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5275729930936258179.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/LTL1642370...246
Read 1 LTL properties
Checking formula 0 : !((G("(i3.u48.p498==0)")))
Formula 0 simplified : !G"(i3.u48.p498==0)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 3.73747e+82 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
409 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,4.2451,88724,1,0,131931,290,3573,274337,225,1582,172316
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-050B-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldPPPt-PT-050B-LTLFireability-14 finished in 65650 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U p1)&&p2)))'
Support contains 4 out of 3359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3353 transition count 3003
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3353 transition count 3003
Applied a total of 12 rules in 434 ms. Remains 3353 /3359 variables (removed 6) and now considering 3003/3009 (removed 6) transitions.
// Phase 1: matrix 3003 rows 3353 cols
[2022-05-20 08:06:56] [INFO ] Computed 551 place invariants in 13 ms
[2022-05-20 08:06:57] [INFO ] Implicit Places using invariants in 1066 ms returned []
// Phase 1: matrix 3003 rows 3353 cols
[2022-05-20 08:06:57] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 08:07:01] [INFO ] Implicit Places using invariants and state equation in 3302 ms returned []
Implicit Place search using SMT with State Equation took 4392 ms to find 0 implicit places.
// Phase 1: matrix 3003 rows 3353 cols
[2022-05-20 08:07:01] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 08:07:03] [INFO ] Dead Transitions using invariants and state equation in 2006 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3353/3359 places, 3003/3009 transitions.
Finished structural reductions, in 1 iterations. Remains : 3353/3359 places, 3003/3009 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 3}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(OR (NOT p2) (AND (NOT p1) p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s3081 1), p0:(OR (NEQ s943 1) (EQ s1685 1) (EQ s3081 1)), p2:(EQ s3195 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-15 finished in 7012 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!(F(X(p1)) U p2)||p0))))'
Found a SL insensitive property : ShieldPPPt-PT-050B-LTLFireability-01
Stuttering acceptance computed with spot in 156 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (OR p1 (AND (NOT p0) p2))]
Support contains 4 out of 3359 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 3359/3359 places, 3009/3009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 704 transitions
Trivial Post-agglo rules discarded 704 transitions
Performed 704 trivial Post agglomeration. Transition count delta: 704
Iterating post reduction 0 with 704 rules applied. Total rules applied 704 place count 3358 transition count 2304
Reduce places removed 704 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 705 rules applied. Total rules applied 1409 place count 2654 transition count 2303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1410 place count 2653 transition count 2303
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 394 Pre rules applied. Total rules applied 1410 place count 2653 transition count 1909
Deduced a syphon composed of 394 places in 3 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 3 with 788 rules applied. Total rules applied 2198 place count 2259 transition count 1909
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2204 place count 2253 transition count 1903
Iterating global reduction 3 with 6 rules applied. Total rules applied 2210 place count 2253 transition count 1903
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 2210 place count 2253 transition count 1899
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 2218 place count 2249 transition count 1899
Performed 845 Post agglomeration using F-continuation condition.Transition count delta: 845
Deduced a syphon composed of 845 places in 1 ms
Reduce places removed 845 places and 0 transitions.
Iterating global reduction 3 with 1690 rules applied. Total rules applied 3908 place count 1404 transition count 1054
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3909 place count 1404 transition count 1053
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 3911 place count 1403 transition count 1052
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4113 place count 1302 transition count 1052
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4209 place count 1254 transition count 1052
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4211 place count 1252 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4212 place count 1251 transition count 1050
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4212 place count 1251 transition count 1048
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4216 place count 1249 transition count 1048
Applied a total of 4216 rules in 605 ms. Remains 1249 /3359 variables (removed 2110) and now considering 1048/3009 (removed 1961) transitions.
// Phase 1: matrix 1048 rows 1249 cols
[2022-05-20 08:07:04] [INFO ] Computed 550 place invariants in 2 ms
[2022-05-20 08:07:05] [INFO ] Implicit Places using invariants in 823 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 835 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1247/3359 places, 1048/3009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 45 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:07:05] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 08:07:05] [INFO ] Implicit Places using invariants in 631 ms returned []
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:07:05] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 08:07:07] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned []
Implicit Place search using SMT with State Equation took 1890 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 1245/3359 places, 1046/3009 transitions.
Finished structural reductions, in 2 iterations. Remains : 1245/3359 places, 1046/3009 transitions.
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) p2) (AND p2 p1)), acceptance={} source=3 dest: 0}, { cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p0) p2) p1), acceptance={} source=4 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s481 0) (EQ s483 0)), p2:(AND (EQ s558 1) (EQ s576 1)), p1:(AND (EQ s481 1) (EQ s483 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, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 859 ms.
Product exploration explored 100000 steps with 0 reset in 1095 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), true, (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 366 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (OR p1 (AND (NOT p0) p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 47516 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 47516 steps, saw 36606 distinct states, run finished after 3011 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:07:13] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 08:07:14] [INFO ] [Real]Absence check using 548 positive place invariants in 76 ms returned sat
[2022-05-20 08:07:14] [INFO ] After 408ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 08:07:14] [INFO ] [Nat]Absence check using 548 positive place invariants in 76 ms returned sat
[2022-05-20 08:07:15] [INFO ] After 691ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 08:07:15] [INFO ] After 1266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 327 ms.
[2022-05-20 08:07:16] [INFO ] After 2108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 60 ms.
Support contains 4 out of 1245 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 22 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1046/1046 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 64913 steps, run timeout after 3002 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64913 steps, saw 48503 distinct states, run finished after 3003 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:07:20] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 08:07:21] [INFO ] [Real]Absence check using 548 positive place invariants in 76 ms returned sat
[2022-05-20 08:07:21] [INFO ] After 371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 08:07:21] [INFO ] [Nat]Absence check using 548 positive place invariants in 76 ms returned sat
[2022-05-20 08:07:22] [INFO ] After 803ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 08:07:23] [INFO ] After 1373ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 346 ms.
[2022-05-20 08:07:23] [INFO ] After 2225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 4 out of 1245 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 21 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1046/1046 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 21 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:07:23] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 08:07:24] [INFO ] Implicit Places using invariants in 675 ms returned []
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:07:24] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 08:07:25] [INFO ] Implicit Places using invariants and state equation in 1244 ms returned []
Implicit Place search using SMT with State Equation took 1954 ms to find 0 implicit places.
[2022-05-20 08:07:25] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:07:25] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 08:07:26] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1046/1046 transitions.
Partial Free-agglomeration rule applied 292 times.
Drop transitions removed 292 transitions
Iterating global reduction 0 with 292 rules applied. Total rules applied 292 place count 1245 transition count 1046
Applied a total of 292 rules in 51 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:07:26] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 08:07:26] [INFO ] [Real]Absence check using 548 positive place invariants in 75 ms returned sat
[2022-05-20 08:07:26] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 08:07:26] [INFO ] [Nat]Absence check using 548 positive place invariants in 77 ms returned sat
[2022-05-20 08:07:27] [INFO ] After 692ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 08:07:28] [INFO ] After 1251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 336 ms.
[2022-05-20 08:07:28] [INFO ] After 2109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2022-05-20 08:07:28] [INFO ] Flatten gal took : 34 ms
[2022-05-20 08:07:28] [INFO ] Flatten gal took : 31 ms
[2022-05-20 08:07:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13386167981118201418.gal : 4 ms
[2022-05-20 08:07:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12778966902827771275.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms11110251162891962067;'/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/ReachabilityCardinality13386167981118201418.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12778966902827771275.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality12778966902827771275.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 12
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :12 after 30
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :30 after 64
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :64 after 121
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :121 after 183
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :183 after 5175
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :5175 after 40315
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :40315 after 3.84015e+06
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :3.84015e+06 after 1.23191e+14
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :1.23191e+14 after 1.19118e+30
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :1.19118e+30 after 8.24634e+60
Reachability property apf7 is true.
Detected timeout of ITS tools.
[2022-05-20 08:07:43] [INFO ] Flatten gal took : 29 ms
[2022-05-20 08:07:43] [INFO ] Applying decomposition
[2022-05-20 08:07:43] [INFO ] Flatten gal took : 27 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/graph11005418784663273340.txt' '-o' '/tmp/graph11005418784663273340.bin' '-w' '/tmp/graph11005418784663273340.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11005418784663273340.bin' '-l' '-1' '-v' '-w' '/tmp/graph11005418784663273340.weights' '-q' '0' '-e' '0.001'
[2022-05-20 08:07:43] [INFO ] Decomposing Gal with order
[2022-05-20 08:07:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:07:43] [INFO ] Removed a total of 152 redundant transitions.
[2022-05-20 08:07:43] [INFO ] Flatten gal took : 42 ms
[2022-05-20 08:07:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 4 ms.
[2022-05-20 08:07:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10009085162876381306.gal : 6 ms
[2022-05-20 08:07:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10132370942565698179.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11110251162891962067;'/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/ReachabilityCardinality10009085162876381306.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10132370942565698179.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/ReachabilityCardinality10132370942565698179.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :1 after 2
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :9.8304e+08 after 1.0897e+64
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8736062891897964327
[2022-05-20 08:07:59] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8736062891897964327
Running compilation step : cd /tmp/ltsmin8736062891897964327;'/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 1875 ms.
Running link step : cd /tmp/ltsmin8736062891897964327;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8736062891897964327;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), true, (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 379 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 173 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (OR p1 (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (OR p1 (AND (NOT p0) p2))]
Support contains 4 out of 1245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 17 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:08:14] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 08:08:15] [INFO ] Implicit Places using invariants in 675 ms returned []
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:08:15] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 08:08:16] [INFO ] Implicit Places using invariants and state equation in 1258 ms returned []
Implicit Place search using SMT with State Equation took 1935 ms to find 0 implicit places.
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:08:16] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 08:08:17] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1046/1046 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (OR (AND p2 p1) (AND p2 (NOT p0))))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 411 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 245 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (OR p1 (AND (NOT p0) p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 70762 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70762 steps, saw 52429 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:08:22] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 08:08:22] [INFO ] [Real]Absence check using 548 positive place invariants in 77 ms returned sat
[2022-05-20 08:08:22] [INFO ] After 369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 08:08:22] [INFO ] [Nat]Absence check using 548 positive place invariants in 88 ms returned sat
[2022-05-20 08:08:23] [INFO ] After 731ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 08:08:24] [INFO ] After 1306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 372 ms.
[2022-05-20 08:08:24] [INFO ] After 2229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 106 ms.
Support contains 4 out of 1245 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 22 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1046/1046 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 47129 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 47129 steps, saw 36310 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:08:28] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 08:08:29] [INFO ] [Real]Absence check using 548 positive place invariants in 76 ms returned sat
[2022-05-20 08:08:29] [INFO ] After 420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 08:08:29] [INFO ] [Nat]Absence check using 548 positive place invariants in 73 ms returned sat
[2022-05-20 08:08:30] [INFO ] After 682ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 08:08:31] [INFO ] After 1233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 322 ms.
[2022-05-20 08:08:31] [INFO ] After 2040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 215 ms.
Support contains 4 out of 1245 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 22 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1046/1046 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 21 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:08:31] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 08:08:32] [INFO ] Implicit Places using invariants in 988 ms returned []
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:08:32] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 08:08:33] [INFO ] Implicit Places using invariants and state equation in 1248 ms returned []
Implicit Place search using SMT with State Equation took 2262 ms to find 0 implicit places.
[2022-05-20 08:08:34] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:08:34] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 08:08:34] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1046/1046 transitions.
Partial Free-agglomeration rule applied 292 times.
Drop transitions removed 292 transitions
Iterating global reduction 0 with 292 rules applied. Total rules applied 292 place count 1245 transition count 1046
Applied a total of 292 rules in 55 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:08:34] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 08:08:34] [INFO ] [Real]Absence check using 548 positive place invariants in 76 ms returned sat
[2022-05-20 08:08:35] [INFO ] After 393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 08:08:35] [INFO ] [Nat]Absence check using 548 positive place invariants in 75 ms returned sat
[2022-05-20 08:08:36] [INFO ] After 693ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 08:08:36] [INFO ] After 1255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 338 ms.
[2022-05-20 08:08:37] [INFO ] After 2072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2022-05-20 08:08:37] [INFO ] Flatten gal took : 28 ms
[2022-05-20 08:08:37] [INFO ] Flatten gal took : 27 ms
[2022-05-20 08:08:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8695173380203482118.gal : 4 ms
[2022-05-20 08:08:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5562147333653770512.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1389382087937189690;'/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/ReachabilityCardinality8695173380203482118.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5562147333653770512.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/ReachabilityCardinality5562147333653770512.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 12
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :12 after 30
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :30 after 64
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :64 after 121
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :121 after 183
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :183 after 5175
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :5175 after 40315
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :40315 after 3.84015e+06
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :3.84015e+06 after 1.23191e+14
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :1.23191e+14 after 1.19118e+30
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :1.19118e+30 after 8.24634e+60
Reachability property apf7 is true.
Detected timeout of ITS tools.
[2022-05-20 08:08:52] [INFO ] Flatten gal took : 27 ms
[2022-05-20 08:08:52] [INFO ] Applying decomposition
[2022-05-20 08:08:52] [INFO ] Flatten gal took : 27 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/graph15424812597142668677.txt' '-o' '/tmp/graph15424812597142668677.bin' '-w' '/tmp/graph15424812597142668677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15424812597142668677.bin' '-l' '-1' '-v' '-w' '/tmp/graph15424812597142668677.weights' '-q' '0' '-e' '0.001'
[2022-05-20 08:08:52] [INFO ] Decomposing Gal with order
[2022-05-20 08:08:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:08:52] [INFO ] Removed a total of 153 redundant transitions.
[2022-05-20 08:08:52] [INFO ] Flatten gal took : 42 ms
[2022-05-20 08:08:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2022-05-20 08:08:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11468806868413224783.gal : 5 ms
[2022-05-20 08:08:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12273981042480399131.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms1389382087937189690;'/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/ReachabilityCardinality11468806868413224783.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12273981042480399131.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/ReachabilityCardinality12273981042480399131.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :1 after 73728
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5290553195041041785
[2022-05-20 08:09:07] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5290553195041041785
Running compilation step : cd /tmp/ltsmin5290553195041041785;'/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 1887 ms.
Running link step : cd /tmp/ltsmin5290553195041041785;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5290553195041041785;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (OR (AND p2 p1) (AND p2 (NOT p0))))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 335 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 152 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (OR p1 (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 144 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (OR p1 (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (OR p1 (AND (NOT p0) p2))]
Product exploration explored 100000 steps with 0 reset in 906 ms.
Product exploration explored 100000 steps with 0 reset in 1133 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 173 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (OR p1 (AND (NOT p0) p2))]
Support contains 4 out of 1245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 30 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2022-05-20 08:09:25] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:09:25] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 08:09:26] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1046/1046 transitions.
Product exploration explored 100000 steps with 0 reset in 897 ms.
Product exploration explored 100000 steps with 0 reset in 1163 ms.
Built C files in :
/tmp/ltsmin13927533969578631920
[2022-05-20 08:09:28] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13927533969578631920
Running compilation step : cd /tmp/ltsmin13927533969578631920;'/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 1865 ms.
Running link step : cd /tmp/ltsmin13927533969578631920;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13927533969578631920;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8704445196046851173.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 23 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:09:43] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 08:09:43] [INFO ] Implicit Places using invariants in 649 ms returned []
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:09:44] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 08:09:45] [INFO ] Implicit Places using invariants and state equation in 1329 ms returned []
Implicit Place search using SMT with State Equation took 1979 ms to find 0 implicit places.
// Phase 1: matrix 1046 rows 1245 cols
[2022-05-20 08:09:45] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 08:09:45] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/1245 places, 1046/1046 transitions.
Built C files in :
/tmp/ltsmin15102451010315781617
[2022-05-20 08:09:45] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15102451010315781617
Running compilation step : cd /tmp/ltsmin15102451010315781617;'/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 1851 ms.
Running link step : cd /tmp/ltsmin15102451010315781617;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15102451010315781617;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10408066575115287089.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 08:10:01] [INFO ] Flatten gal took : 28 ms
[2022-05-20 08:10:01] [INFO ] Flatten gal took : 27 ms
[2022-05-20 08:10:01] [INFO ] Time to serialize gal into /tmp/LTL10175286805644661457.gal : 3 ms
[2022-05-20 08:10:01] [INFO ] Time to serialize properties into /tmp/LTL929227192264994433.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/LTL10175286805644661457.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL929227192264994433.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/LTL1017528...266
Read 1 LTL properties
Checking formula 0 : !((X(G(((!((F(X("((p1531==1)&&(p1533==1))")))U("((p1763==1)&&(p1810==1))")))||("(p1531==0)"))||("(p1533==0)")))))
Formula 0 simplified : !XG("(p1531==0)" | "(p1533==0)" | !(FX"((p1531==1)&&(p1533==1))" U "((p1763==1)&&(p1810==1))"))
Detected timeout of ITS tools.
[2022-05-20 08:10:16] [INFO ] Flatten gal took : 30 ms
[2022-05-20 08:10:16] [INFO ] Applying decomposition
[2022-05-20 08:10:16] [INFO ] Flatten gal took : 27 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/graph12266179236938826580.txt' '-o' '/tmp/graph12266179236938826580.bin' '-w' '/tmp/graph12266179236938826580.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12266179236938826580.bin' '-l' '-1' '-v' '-w' '/tmp/graph12266179236938826580.weights' '-q' '0' '-e' '0.001'
[2022-05-20 08:10:16] [INFO ] Decomposing Gal with order
[2022-05-20 08:10:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:10:16] [INFO ] Removed a total of 309 redundant transitions.
[2022-05-20 08:10:16] [INFO ] Flatten gal took : 48 ms
[2022-05-20 08:10:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 300 labels/synchronizations in 10 ms.
[2022-05-20 08:10:16] [INFO ] Time to serialize gal into /tmp/LTL139523502870182027.gal : 8 ms
[2022-05-20 08:10:16] [INFO ] Time to serialize properties into /tmp/LTL4871631692603689804.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/LTL139523502870182027.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4871631692603689804.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/LTL1395235...244
Read 1 LTL properties
Checking formula 0 : !((X(G(((!((F(X("((i10.i1.i0.u155.p1531==1)&&(i10.i1.i2.u156.p1533==1))")))U("((i12.i0.i0.u181.p1763==1)&&(i12.i0.i3.u186.p1810==1))")...224
Formula 0 simplified : !XG("(i10.i1.i0.u155.p1531==0)" | "(i10.i1.i2.u156.p1533==0)" | !(FX"((i10.i1.i0.u155.p1531==1)&&(i10.i1.i2.u156.p1533==1))" U "((i1...208
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 3.73747e+82 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11179255444907697793
[2022-05-20 08:10:31] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11179255444907697793
Running compilation step : cd /tmp/ltsmin11179255444907697793;'/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 1853 ms.
Running link step : cd /tmp/ltsmin11179255444907697793;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11179255444907697793;'/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((LTLAPp1==true))) U (LTLAPp2==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-050B-LTLFireability-01 finished in 223074 ms.
[2022-05-20 08:10:46] [INFO ] Flatten gal took : 75 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15952476587756872514
[2022-05-20 08:10:46] [INFO ] Too many transitions (3009) to apply POR reductions. Disabling POR matrices.
[2022-05-20 08:10:46] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15952476587756872514
Running compilation step : cd /tmp/ltsmin15952476587756872514;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 08:10:46] [INFO ] Applying decomposition
[2022-05-20 08:10:46] [INFO ] Flatten gal took : 70 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/graph8738127591684207571.txt' '-o' '/tmp/graph8738127591684207571.bin' '-w' '/tmp/graph8738127591684207571.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8738127591684207571.bin' '-l' '-1' '-v' '-w' '/tmp/graph8738127591684207571.weights' '-q' '0' '-e' '0.001'
[2022-05-20 08:10:46] [INFO ] Decomposing Gal with order
[2022-05-20 08:10:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:10:47] [INFO ] Removed a total of 484 redundant transitions.
[2022-05-20 08:10:47] [INFO ] Flatten gal took : 117 ms
[2022-05-20 08:10:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2022-05-20 08:10:47] [INFO ] Time to serialize gal into /tmp/LTLFireability5924453408587515330.gal : 19 ms
[2022-05-20 08:10:47] [INFO ] Time to serialize properties into /tmp/LTLFireability4884087295906544733.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/LTLFireability5924453408587515330.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4884087295906544733.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((X(G(((!((F(X("((i21.u472.p1531==1)&&(i21.u472.p1533==1))")))U("((i24.i0.i1.u545.p1763==1)&&(i24.i1.i3.u558.p1810==1))")))||("(i21.u...200
Formula 0 simplified : !XG("(i21.u472.p1531==0)" | "(i21.u472.p1533==0)" | !(FX"((i21.u472.p1531==1)&&(i21.u472.p1533==1))" U "((i24.i0.i1.u545.p1763==1)&&...184
Compilation finished in 7429 ms.
Running link step : cd /tmp/ltsmin15952476587756872514;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin15952476587756872514;'/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((LTLAPp1==true))) U (LTLAPp2==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 08:36:15] [INFO ] Applying decomposition
[2022-05-20 08:36:16] [INFO ] Flatten gal took : 730 ms
[2022-05-20 08:36:16] [INFO ] Decomposing Gal with order
[2022-05-20 08:36:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:36:20] [INFO ] Removed a total of 149 redundant transitions.
[2022-05-20 08:36:20] [INFO ] Flatten gal took : 831 ms
[2022-05-20 08:36:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 594 labels/synchronizations in 596 ms.
[2022-05-20 08:36:23] [INFO ] Time to serialize gal into /tmp/LTLFireability10770268289662461589.gal : 112 ms
[2022-05-20 08:36:23] [INFO ] Time to serialize properties into /tmp/LTLFireability6515793772136933766.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/LTLFireability10770268289662461589.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6515793772136933766.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((X(G(((!((F(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.i1.i0.i0.i0.i0.i0.i0.i1.u...812
Formula 0 simplified : !XG("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u459.p1531==...796

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-050B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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