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-165286024800156.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 ShieldIIPs-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-165286024800156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K Apr 29 15:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 29 15:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 15:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 15:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:49 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 846K 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 ShieldIIPs-PT-050B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652943634758

Running Version 202205111006
[2022-05-19 07:00:35] [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-19 07:00:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 07:00:36] [INFO ] Load time of PNML (sax parser for PT used): 297 ms
[2022-05-19 07:00:36] [INFO ] Transformed 3003 places.
[2022-05-19 07:00:36] [INFO ] Transformed 2953 transitions.
[2022-05-19 07:00:36] [INFO ] Found NUPN structural information;
[2022-05-19 07:00:36] [INFO ] Parsed PT model containing 3003 places and 2953 transitions in 612 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPs-PT-050B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 3003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Discarding 342 places :
Symmetric choice reduction at 0 with 342 rule applications. Total rules 342 place count 2661 transition count 2611
Iterating global reduction 0 with 342 rules applied. Total rules applied 684 place count 2661 transition count 2611
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 685 place count 2660 transition count 2610
Iterating global reduction 0 with 1 rules applied. Total rules applied 686 place count 2660 transition count 2610
Applied a total of 686 rules in 1028 ms. Remains 2660 /3003 variables (removed 343) and now considering 2610/2953 (removed 343) transitions.
// Phase 1: matrix 2610 rows 2660 cols
[2022-05-19 07:00:38] [INFO ] Computed 451 place invariants in 41 ms
[2022-05-19 07:00:39] [INFO ] Implicit Places using invariants in 1122 ms returned []
// Phase 1: matrix 2610 rows 2660 cols
[2022-05-19 07:00:39] [INFO ] Computed 451 place invariants in 13 ms
[2022-05-19 07:00:42] [INFO ] Implicit Places using invariants and state equation in 2850 ms returned []
Implicit Place search using SMT with State Equation took 4001 ms to find 0 implicit places.
// Phase 1: matrix 2610 rows 2660 cols
[2022-05-19 07:00:42] [INFO ] Computed 451 place invariants in 20 ms
[2022-05-19 07:00:43] [INFO ] Dead Transitions using invariants and state equation in 1662 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2660/3003 places, 2610/2953 transitions.
Finished structural reductions, in 1 iterations. Remains : 2660/3003 places, 2610/2953 transitions.
Support contains 56 out of 2660 places after structural reductions.
[2022-05-19 07:00:44] [INFO ] Flatten gal took : 200 ms
[2022-05-19 07:00:44] [INFO ] Flatten gal took : 136 ms
[2022-05-19 07:00:44] [INFO ] Input system was already deterministic with 2610 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 724 ms. (steps per millisecond=13 ) properties (out of 35) seen :20
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 2610 rows 2660 cols
[2022-05-19 07:00:45] [INFO ] Computed 451 place invariants in 9 ms
[2022-05-19 07:00:46] [INFO ] After 962ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-19 07:00:47] [INFO ] [Nat]Absence check using 451 positive place invariants in 194 ms returned sat
[2022-05-19 07:00:50] [INFO ] After 2519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-19 07:00:51] [INFO ] Deduced a trap composed of 15 places in 727 ms of which 14 ms to minimize.
[2022-05-19 07:00:52] [INFO ] Deduced a trap composed of 15 places in 689 ms of which 5 ms to minimize.
[2022-05-19 07:00:53] [INFO ] Deduced a trap composed of 19 places in 639 ms of which 7 ms to minimize.
[2022-05-19 07:00:53] [INFO ] Deduced a trap composed of 23 places in 662 ms of which 3 ms to minimize.
[2022-05-19 07:00:54] [INFO ] Deduced a trap composed of 28 places in 648 ms of which 2 ms to minimize.
[2022-05-19 07:00:55] [INFO ] Deduced a trap composed of 18 places in 616 ms of which 1 ms to minimize.
[2022-05-19 07:00:55] [INFO ] Deduced a trap composed of 16 places in 604 ms of which 2 ms to minimize.
[2022-05-19 07:00:56] [INFO ] Deduced a trap composed of 28 places in 580 ms of which 1 ms to minimize.
[2022-05-19 07:00:57] [INFO ] Deduced a trap composed of 17 places in 591 ms of which 1 ms to minimize.
[2022-05-19 07:00:57] [INFO ] Deduced a trap composed of 25 places in 591 ms of which 2 ms to minimize.
[2022-05-19 07:00:58] [INFO ] Deduced a trap composed of 28 places in 564 ms of which 1 ms to minimize.
[2022-05-19 07:00:59] [INFO ] Deduced a trap composed of 26 places in 608 ms of which 1 ms to minimize.
[2022-05-19 07:00:59] [INFO ] Deduced a trap composed of 32 places in 598 ms of which 1 ms to minimize.
[2022-05-19 07:01:00] [INFO ] Deduced a trap composed of 18 places in 540 ms of which 1 ms to minimize.
[2022-05-19 07:01:01] [INFO ] Deduced a trap composed of 30 places in 522 ms of which 1 ms to minimize.
[2022-05-19 07:01:01] [INFO ] Deduced a trap composed of 39 places in 512 ms of which 1 ms to minimize.
[2022-05-19 07:01:02] [INFO ] Deduced a trap composed of 46 places in 518 ms of which 1 ms to minimize.
[2022-05-19 07:01:03] [INFO ] Deduced a trap composed of 26 places in 522 ms of which 1 ms to minimize.
[2022-05-19 07:01:03] [INFO ] Deduced a trap composed of 32 places in 503 ms of which 1 ms to minimize.
[2022-05-19 07:01:04] [INFO ] Deduced a trap composed of 31 places in 515 ms of which 1 ms to minimize.
[2022-05-19 07:01:04] [INFO ] Deduced a trap composed of 29 places in 517 ms of which 1 ms to minimize.
[2022-05-19 07:01:05] [INFO ] Deduced a trap composed of 27 places in 505 ms of which 2 ms to minimize.
[2022-05-19 07:01:06] [INFO ] Deduced a trap composed of 54 places in 490 ms of which 1 ms to minimize.
[2022-05-19 07:01:06] [INFO ] Deduced a trap composed of 51 places in 496 ms of which 2 ms to minimize.
[2022-05-19 07:01:07] [INFO ] Deduced a trap composed of 37 places in 482 ms of which 2 ms to minimize.
[2022-05-19 07:01:07] [INFO ] Deduced a trap composed of 23 places in 470 ms of which 1 ms to minimize.
[2022-05-19 07:01:08] [INFO ] Deduced a trap composed of 34 places in 472 ms of which 1 ms to minimize.
[2022-05-19 07:01:08] [INFO ] Deduced a trap composed of 36 places in 461 ms of which 2 ms to minimize.
[2022-05-19 07:01:09] [INFO ] Deduced a trap composed of 32 places in 476 ms of which 2 ms to minimize.
[2022-05-19 07:01:10] [INFO ] Deduced a trap composed of 33 places in 453 ms of which 2 ms to minimize.
[2022-05-19 07:01:10] [INFO ] Deduced a trap composed of 46 places in 452 ms of which 2 ms to minimize.
[2022-05-19 07:01:11] [INFO ] Deduced a trap composed of 54 places in 441 ms of which 1 ms to minimize.
[2022-05-19 07:01:11] [INFO ] Deduced a trap composed of 26 places in 436 ms of which 1 ms to minimize.
[2022-05-19 07:01:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 07:01:11] [INFO ] After 25090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 1308 ms.
Support contains 24 out of 2660 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2660/2660 places, 2610/2610 transitions.
Drop transitions removed 247 transitions
Trivial Post-agglo rules discarded 247 transitions
Performed 247 trivial Post agglomeration. Transition count delta: 247
Iterating post reduction 0 with 247 rules applied. Total rules applied 247 place count 2660 transition count 2363
Reduce places removed 247 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 248 rules applied. Total rules applied 495 place count 2413 transition count 2362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 496 place count 2412 transition count 2362
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 251 Pre rules applied. Total rules applied 496 place count 2412 transition count 2111
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 3 with 502 rules applied. Total rules applied 998 place count 2161 transition count 2111
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1000 place count 2159 transition count 2109
Iterating global reduction 3 with 2 rules applied. Total rules applied 1002 place count 2159 transition count 2109
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1002 place count 2159 transition count 2107
Deduced a syphon composed of 2 places in 15 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1006 place count 2157 transition count 2107
Performed 890 Post agglomeration using F-continuation condition.Transition count delta: 890
Deduced a syphon composed of 890 places in 11 ms
Reduce places removed 890 places and 0 transitions.
Iterating global reduction 3 with 1780 rules applied. Total rules applied 2786 place count 1267 transition count 1217
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 340 times.
Drop transitions removed 340 transitions
Iterating global reduction 3 with 340 rules applied. Total rules applied 3126 place count 1267 transition count 1217
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3127 place count 1266 transition count 1216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3128 place count 1265 transition count 1216
Applied a total of 3128 rules in 761 ms. Remains 1265 /2660 variables (removed 1395) and now considering 1216/2610 (removed 1394) transitions.
Finished structural reductions, in 1 iterations. Remains : 1265/2660 places, 1216/2610 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1216 rows 1265 cols
[2022-05-19 07:01:14] [INFO ] Computed 450 place invariants in 66 ms
[2022-05-19 07:01:14] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 07:01:14] [INFO ] [Nat]Absence check using 446 positive place invariants in 70 ms returned sat
[2022-05-19 07:01:14] [INFO ] [Nat]Absence check using 446 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-19 07:01:15] [INFO ] After 518ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 07:01:15] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2022-05-19 07:01:15] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2022-05-19 07:01:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2022-05-19 07:01:15] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2022-05-19 07:01:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2022-05-19 07:01:15] [INFO ] After 982ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 100 ms.
[2022-05-19 07:01:15] [INFO ] After 1335ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 44 ms.
Support contains 5 out of 1265 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1265/1265 places, 1216/1216 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1265 transition count 1214
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1263 transition count 1214
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 22 place count 1254 transition count 1205
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 1254 transition count 1205
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 1253 transition count 1204
Applied a total of 29 rules in 137 ms. Remains 1253 /1265 variables (removed 12) and now considering 1204/1216 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1265 places, 1204/1216 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 2) seen :1
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
Running SMT prover for 1 properties.
// Phase 1: matrix 1204 rows 1253 cols
[2022-05-19 07:01:16] [INFO ] Computed 450 place invariants in 56 ms
[2022-05-19 07:01:16] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:01:16] [INFO ] [Nat]Absence check using 449 positive place invariants in 62 ms returned sat
[2022-05-19 07:01:16] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:01:17] [INFO ] After 530ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:01:17] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2022-05-19 07:01:17] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2022-05-19 07:01:17] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2022-05-19 07:01:17] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2022-05-19 07:01:17] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2022-05-19 07:01:17] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2022-05-19 07:01:17] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2022-05-19 07:01:17] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2022-05-19 07:01:17] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2022-05-19 07:01:18] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2022-05-19 07:01:18] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2022-05-19 07:01:18] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2022-05-19 07:01:18] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2022-05-19 07:01:18] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1270 ms
[2022-05-19 07:01:18] [INFO ] After 1841ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2022-05-19 07:01:18] [INFO ] After 2096ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1253/1253 places, 1204/1204 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 1252 transition count 1203
Applied a total of 2 rules in 61 ms. Remains 1252 /1253 variables (removed 1) and now considering 1203/1204 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1252/1253 places, 1203/1204 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 222626 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 222626 steps, saw 216581 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1203 rows 1252 cols
[2022-05-19 07:01:21] [INFO ] Computed 450 place invariants in 28 ms
[2022-05-19 07:01:21] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:01:22] [INFO ] [Nat]Absence check using 449 positive place invariants in 67 ms returned sat
[2022-05-19 07:01:22] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:01:22] [INFO ] After 501ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:01:22] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2022-05-19 07:01:22] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2022-05-19 07:01:23] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2022-05-19 07:01:23] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 0 ms to minimize.
[2022-05-19 07:01:23] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 0 ms to minimize.
[2022-05-19 07:01:23] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2022-05-19 07:01:23] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2022-05-19 07:01:23] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 0 ms to minimize.
[2022-05-19 07:01:23] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2022-05-19 07:01:23] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2022-05-19 07:01:24] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2022-05-19 07:01:24] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2022-05-19 07:01:24] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1577 ms
[2022-05-19 07:01:24] [INFO ] After 2130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2022-05-19 07:01:24] [INFO ] After 2420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 1252 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1252/1252 places, 1203/1203 transitions.
Applied a total of 0 rules in 37 ms. Remains 1252 /1252 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1252/1252 places, 1203/1203 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1252/1252 places, 1203/1203 transitions.
Applied a total of 0 rules in 34 ms. Remains 1252 /1252 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1252 cols
[2022-05-19 07:01:24] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-19 07:01:25] [INFO ] Implicit Places using invariants in 738 ms returned []
// Phase 1: matrix 1203 rows 1252 cols
[2022-05-19 07:01:25] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-19 07:01:26] [INFO ] Implicit Places using invariants and state equation in 1642 ms returned []
Implicit Place search using SMT with State Equation took 2382 ms to find 0 implicit places.
[2022-05-19 07:01:26] [INFO ] Redundant transitions in 80 ms returned []
// Phase 1: matrix 1203 rows 1252 cols
[2022-05-19 07:01:26] [INFO ] Computed 450 place invariants in 9 ms
[2022-05-19 07:01:27] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1252/1252 places, 1203/1203 transitions.
Applied a total of 0 rules in 31 ms. Remains 1252 /1252 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1203 rows 1252 cols
[2022-05-19 07:01:27] [INFO ] Computed 450 place invariants in 15 ms
[2022-05-19 07:01:27] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:01:27] [INFO ] [Nat]Absence check using 449 positive place invariants in 63 ms returned sat
[2022-05-19 07:01:27] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:01:28] [INFO ] After 479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:01:28] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 0 ms to minimize.
[2022-05-19 07:01:28] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2022-05-19 07:01:28] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2022-05-19 07:01:28] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2022-05-19 07:01:28] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 0 ms to minimize.
[2022-05-19 07:01:29] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2022-05-19 07:01:29] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2022-05-19 07:01:29] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2022-05-19 07:01:29] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2022-05-19 07:01:29] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2022-05-19 07:01:29] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2022-05-19 07:01:29] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2022-05-19 07:01:29] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1555 ms
[2022-05-19 07:01:29] [INFO ] After 2089ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2022-05-19 07:01:30] [INFO ] After 2358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 07:01:30] [INFO ] Flatten gal took : 60 ms
[2022-05-19 07:01:30] [INFO ] Flatten gal took : 57 ms
[2022-05-19 07:01:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17156354292603861830.gal : 33 ms
[2022-05-19 07:01:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14560987795997176917.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3820844235650754469;'/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/ReachabilityCardinality17156354292603861830.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14560987795997176917.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/ReachabilityCardinality14560987795997176917.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 60
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :60 after 100
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :100 after 166
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :166 after 246
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :246 after 518
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :518 after 2933
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2933 after 4945
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4945 after 73253
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :73253 after 4.14797e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.14797e+06 after 9.51986e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :9.51986e+08 after 2.98803e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.98803e+10 after 8.26337e+12
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :8.26337e+12 after 1.02056e+14
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.02056e+14 after 2.8937e+15
Detected timeout of ITS tools.
[2022-05-19 07:01:45] [INFO ] Flatten gal took : 57 ms
[2022-05-19 07:01:45] [INFO ] Applying decomposition
[2022-05-19 07:01:45] [INFO ] Flatten gal took : 57 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/graph5383892186193740483.txt' '-o' '/tmp/graph5383892186193740483.bin' '-w' '/tmp/graph5383892186193740483.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5383892186193740483.bin' '-l' '-1' '-v' '-w' '/tmp/graph5383892186193740483.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:01:45] [INFO ] Decomposing Gal with order
[2022-05-19 07:01:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:01:45] [INFO ] Removed a total of 956 redundant transitions.
[2022-05-19 07:01:46] [INFO ] Flatten gal took : 472 ms
[2022-05-19 07:01:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 1293 labels/synchronizations in 40 ms.
[2022-05-19 07:01:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality33931637708967883.gal : 14 ms
[2022-05-19 07:01:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8798754038466077763.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3820844235650754469;'/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/ReachabilityCardinality33931637708967883.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8798754038466077763.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...296
Loading property file /tmp/ReachabilityCardinality8798754038466077763.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 2
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2 after 2
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2274548908803074854
[2022-05-19 07:02:01] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2274548908803074854
Running compilation step : cd /tmp/ltsmin2274548908803074854;'/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/ltsmin2274548908803074854;'/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/ltsmin2274548908803074854;'/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)
FORMULA ShieldIIPs-PT-050B-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 603 stabilizing places and 603 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 2 out of 2660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2660/2660 places, 2610/2610 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2653 transition count 2603
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2653 transition count 2603
Applied a total of 14 rules in 212 ms. Remains 2653 /2660 variables (removed 7) and now considering 2603/2610 (removed 7) transitions.
// Phase 1: matrix 2603 rows 2653 cols
[2022-05-19 07:02:05] [INFO ] Computed 451 place invariants in 32 ms
[2022-05-19 07:02:05] [INFO ] Implicit Places using invariants in 843 ms returned []
// Phase 1: matrix 2603 rows 2653 cols
[2022-05-19 07:02:05] [INFO ] Computed 451 place invariants in 16 ms
[2022-05-19 07:02:08] [INFO ] Implicit Places using invariants and state equation in 3034 ms returned []
Implicit Place search using SMT with State Equation took 3880 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 2653 cols
[2022-05-19 07:02:08] [INFO ] Computed 451 place invariants in 11 ms
[2022-05-19 07:02:10] [INFO ] Dead Transitions using invariants and state equation in 1592 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2653/2660 places, 2603/2610 transitions.
Finished structural reductions, in 1 iterations. Remains : 2653/2660 places, 2603/2610 transitions.
Stuttering acceptance computed with spot in 423 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(EQ s1955 1), p0:(EQ s293 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-00 finished in 6180 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(((F(X(p1))||p0)&&p2))))'
Support contains 5 out of 2660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2660/2660 places, 2610/2610 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2653 transition count 2603
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2653 transition count 2603
Applied a total of 14 rules in 215 ms. Remains 2653 /2660 variables (removed 7) and now considering 2603/2610 (removed 7) transitions.
// Phase 1: matrix 2603 rows 2653 cols
[2022-05-19 07:02:11] [INFO ] Computed 451 place invariants in 13 ms
[2022-05-19 07:02:12] [INFO ] Implicit Places using invariants in 903 ms returned []
// Phase 1: matrix 2603 rows 2653 cols
[2022-05-19 07:02:12] [INFO ] Computed 451 place invariants in 9 ms
[2022-05-19 07:02:14] [INFO ] Implicit Places using invariants and state equation in 2880 ms returned []
Implicit Place search using SMT with State Equation took 3789 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 2653 cols
[2022-05-19 07:02:15] [INFO ] Computed 451 place invariants in 11 ms
[2022-05-19 07:02:16] [INFO ] Dead Transitions using invariants and state equation in 1508 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2653/2660 places, 2603/2610 transitions.
Finished structural reductions, in 1 iterations. Remains : 2653/2660 places, 2603/2610 transitions.
Stuttering acceptance computed with spot in 810 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s2566 1) (EQ s2591 1)), p2:(EQ s769 0), p1:(OR (EQ s2200 0) (EQ s2216 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1937 ms.
Product exploration explored 100000 steps with 50000 reset in 1816 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (AND (NOT p0) p2)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))))
Knowledge based reduction with 11 factoid took 208 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-050B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-050B-LTLFireability-01 finished in 10366 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!(X(X(p0)) U p1))&&X(p2))))'
Support contains 6 out of 2660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2660/2660 places, 2610/2610 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2652 transition count 2602
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2652 transition count 2602
Applied a total of 16 rules in 203 ms. Remains 2652 /2660 variables (removed 8) and now considering 2602/2610 (removed 8) transitions.
// Phase 1: matrix 2602 rows 2652 cols
[2022-05-19 07:02:21] [INFO ] Computed 451 place invariants in 15 ms
[2022-05-19 07:02:22] [INFO ] Implicit Places using invariants in 874 ms returned []
// Phase 1: matrix 2602 rows 2652 cols
[2022-05-19 07:02:22] [INFO ] Computed 451 place invariants in 15 ms
[2022-05-19 07:02:25] [INFO ] Implicit Places using invariants and state equation in 2896 ms returned []
Implicit Place search using SMT with State Equation took 3773 ms to find 0 implicit places.
// Phase 1: matrix 2602 rows 2652 cols
[2022-05-19 07:02:25] [INFO ] Computed 451 place invariants in 13 ms
[2022-05-19 07:02:26] [INFO ] Dead Transitions using invariants and state equation in 1643 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2652/2660 places, 2602/2610 transitions.
Finished structural reductions, in 1 iterations. Remains : 2652/2660 places, 2602/2610 transitions.
Stuttering acceptance computed with spot in 556 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p2), p1, (AND p1 p0), true, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 6}, { cond=p1, acceptance={0} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 6}, { cond=(AND p1 p0), acceptance={0} source=6 dest: 7}], [{ cond=(AND p1 p0), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 4}]], initial=0, aps=[p1:(EQ s2294 1), p2:(AND (EQ s743 1) (EQ s759 1)), p0:(AND (EQ s1477 1) (EQ s1485 1) (EQ s1506 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-03 finished in 6211 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1)||X(p2))))'
Support contains 8 out of 2660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2660/2660 places, 2610/2610 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2652 transition count 2602
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2652 transition count 2602
Applied a total of 16 rules in 193 ms. Remains 2652 /2660 variables (removed 8) and now considering 2602/2610 (removed 8) transitions.
// Phase 1: matrix 2602 rows 2652 cols
[2022-05-19 07:02:27] [INFO ] Computed 451 place invariants in 14 ms
[2022-05-19 07:02:28] [INFO ] Implicit Places using invariants in 890 ms returned []
// Phase 1: matrix 2602 rows 2652 cols
[2022-05-19 07:02:28] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 07:02:31] [INFO ] Implicit Places using invariants and state equation in 2822 ms returned []
Implicit Place search using SMT with State Equation took 3723 ms to find 0 implicit places.
// Phase 1: matrix 2602 rows 2652 cols
[2022-05-19 07:02:31] [INFO ] Computed 451 place invariants in 14 ms
[2022-05-19 07:02:33] [INFO ] Dead Transitions using invariants and state equation in 1611 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2652/2660 places, 2602/2610 transitions.
Finished structural reductions, in 1 iterations. Remains : 2652/2660 places, 2602/2610 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1485 1), p1:(OR (EQ s492 0) (EQ s510 0) (EQ s517 0) (EQ s2347 0)), p2:(OR (EQ s1636 0) (EQ s1652 0) (EQ s1663 0))], 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 50000 reset in 2030 ms.
Product exploration explored 100000 steps with 50000 reset in 2049 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1 p2)
Knowledge based reduction with 5 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-050B-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-050B-LTLFireability-04 finished in 9876 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&X(p1)&&F(G(p2))))'
Support contains 3 out of 2660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2660/2660 places, 2610/2610 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2653 transition count 2603
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2653 transition count 2603
Applied a total of 14 rules in 202 ms. Remains 2653 /2660 variables (removed 7) and now considering 2603/2610 (removed 7) transitions.
// Phase 1: matrix 2603 rows 2653 cols
[2022-05-19 07:02:37] [INFO ] Computed 451 place invariants in 13 ms
[2022-05-19 07:02:38] [INFO ] Implicit Places using invariants in 874 ms returned []
// Phase 1: matrix 2603 rows 2653 cols
[2022-05-19 07:02:38] [INFO ] Computed 451 place invariants in 10 ms
[2022-05-19 07:02:41] [INFO ] Implicit Places using invariants and state equation in 3015 ms returned []
Implicit Place search using SMT with State Equation took 3892 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 2653 cols
[2022-05-19 07:02:41] [INFO ] Computed 451 place invariants in 11 ms
[2022-05-19 07:02:43] [INFO ] Dead Transitions using invariants and state equation in 1508 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2653/2660 places, 2603/2610 transitions.
Finished structural reductions, in 1 iterations. Remains : 2653/2660 places, 2603/2610 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s546 0), p0:(AND (EQ s1572 1) (EQ s1596 1)), p2:(EQ s546 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6172 steps with 0 reset in 55 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-05 finished in 5942 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((X(p0)||F(p1))))))'
Support contains 5 out of 2660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2660/2660 places, 2610/2610 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 2659 transition count 2359
Reduce places removed 250 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 251 rules applied. Total rules applied 501 place count 2409 transition count 2358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 502 place count 2408 transition count 2358
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 251 Pre rules applied. Total rules applied 502 place count 2408 transition count 2107
Deduced a syphon composed of 251 places in 6 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 3 with 502 rules applied. Total rules applied 1004 place count 2157 transition count 2107
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1012 place count 2149 transition count 2099
Iterating global reduction 3 with 8 rules applied. Total rules applied 1020 place count 2149 transition count 2099
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1020 place count 2149 transition count 2095
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1028 place count 2145 transition count 2095
Performed 893 Post agglomeration using F-continuation condition.Transition count delta: 893
Deduced a syphon composed of 893 places in 3 ms
Reduce places removed 893 places and 0 transitions.
Iterating global reduction 3 with 1786 rules applied. Total rules applied 2814 place count 1252 transition count 1202
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2816 place count 1250 transition count 1200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2817 place count 1249 transition count 1200
Applied a total of 2817 rules in 475 ms. Remains 1249 /2660 variables (removed 1411) and now considering 1200/2610 (removed 1410) transitions.
// Phase 1: matrix 1200 rows 1249 cols
[2022-05-19 07:02:43] [INFO ] Computed 450 place invariants in 5 ms
[2022-05-19 07:02:44] [INFO ] Implicit Places using invariants in 545 ms returned []
// Phase 1: matrix 1200 rows 1249 cols
[2022-05-19 07:02:44] [INFO ] Computed 450 place invariants in 5 ms
[2022-05-19 07:02:45] [INFO ] Implicit Places using invariants and state equation in 1309 ms returned []
Implicit Place search using SMT with State Equation took 1857 ms to find 0 implicit places.
[2022-05-19 07:02:45] [INFO ] Redundant transitions in 252 ms returned [1199]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1199 rows 1249 cols
[2022-05-19 07:02:45] [INFO ] Computed 450 place invariants in 3 ms
[2022-05-19 07:02:46] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1249/2660 places, 1199/2610 transitions.
Applied a total of 0 rules in 31 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1249/2660 places, 1199/2610 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s1235 1) (EQ s1237 1) (EQ s1248 1)), p0:(AND (EQ s6 1) (EQ s8 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 48 reset in 826 ms.
Product exploration explored 100000 steps with 57 reset in 1150 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 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 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2343 steps, including 0 resets, run visited all 1 properties in 28 ms. (steps per millisecond=83 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 124 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 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 1199 rows 1249 cols
[2022-05-19 07:02:49] [INFO ] Computed 450 place invariants in 4 ms
[2022-05-19 07:02:50] [INFO ] [Real]Absence check using 450 positive place invariants in 264 ms returned sat
[2022-05-19 07:02:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:02:52] [INFO ] [Real]Absence check using state equation in 2460 ms returned sat
[2022-05-19 07:02:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 07:02:53] [INFO ] [Nat]Absence check using 450 positive place invariants in 274 ms returned sat
[2022-05-19 07:02:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 07:02:56] [INFO ] [Nat]Absence check using state equation in 2624 ms returned sat
[2022-05-19 07:02:56] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2022-05-19 07:02:56] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2022-05-19 07:02:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 303 ms
[2022-05-19 07:02:56] [INFO ] Computed and/alt/rep : 1198/2987/1198 causal constraints (skipped 0 transitions) in 64 ms.
[2022-05-19 07:03:07] [INFO ] Added : 500 causal constraints over 100 iterations in 10973 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 5 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 1199/1199 transitions.
Applied a total of 0 rules in 28 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
// Phase 1: matrix 1199 rows 1249 cols
[2022-05-19 07:03:07] [INFO ] Computed 450 place invariants in 5 ms
[2022-05-19 07:03:08] [INFO ] Implicit Places using invariants in 546 ms returned []
// Phase 1: matrix 1199 rows 1249 cols
[2022-05-19 07:03:08] [INFO ] Computed 450 place invariants in 4 ms
[2022-05-19 07:03:09] [INFO ] Implicit Places using invariants and state equation in 1259 ms returned []
Implicit Place search using SMT with State Equation took 1810 ms to find 0 implicit places.
[2022-05-19 07:03:09] [INFO ] Redundant transitions in 109 ms returned []
// Phase 1: matrix 1199 rows 1249 cols
[2022-05-19 07:03:09] [INFO ] Computed 450 place invariants in 5 ms
[2022-05-19 07:03:10] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1249/1249 places, 1199/1199 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 p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 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 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2339 steps, including 0 resets, run visited all 1 properties in 24 ms. (steps per millisecond=97 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 126 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 551 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 1199 rows 1249 cols
[2022-05-19 07:03:11] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-19 07:03:12] [INFO ] [Real]Absence check using 450 positive place invariants in 264 ms returned sat
[2022-05-19 07:03:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:03:14] [INFO ] [Real]Absence check using state equation in 2442 ms returned sat
[2022-05-19 07:03:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 07:03:16] [INFO ] [Nat]Absence check using 450 positive place invariants in 267 ms returned sat
[2022-05-19 07:03:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 07:03:18] [INFO ] [Nat]Absence check using state equation in 2639 ms returned sat
[2022-05-19 07:03:18] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2022-05-19 07:03:18] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2022-05-19 07:03:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 310 ms
[2022-05-19 07:03:19] [INFO ] Computed and/alt/rep : 1198/2987/1198 causal constraints (skipped 0 transitions) in 67 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-19 07:03:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 55 reset in 863 ms.
Product exploration explored 100000 steps with 56 reset in 1039 ms.
Built C files in :
/tmp/ltsmin16545045218216413450
[2022-05-19 07:03:32] [INFO ] Computing symmetric may disable matrix : 1199 transitions.
[2022-05-19 07:03:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:03:32] [INFO ] Computing symmetric may enable matrix : 1199 transitions.
[2022-05-19 07:03:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:03:32] [INFO ] Computing Do-Not-Accords matrix : 1199 transitions.
[2022-05-19 07:03:32] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:03:32] [INFO ] Built C files in 202ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16545045218216413450
Running compilation step : cd /tmp/ltsmin16545045218216413450;'/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/ltsmin16545045218216413450;'/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/ltsmin16545045218216413450;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 1199/1199 transitions.
Applied a total of 0 rules in 26 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
// Phase 1: matrix 1199 rows 1249 cols
[2022-05-19 07:03:35] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-19 07:03:36] [INFO ] Implicit Places using invariants in 527 ms returned []
// Phase 1: matrix 1199 rows 1249 cols
[2022-05-19 07:03:36] [INFO ] Computed 450 place invariants in 2 ms
[2022-05-19 07:03:37] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned []
Implicit Place search using SMT with State Equation took 1741 ms to find 0 implicit places.
[2022-05-19 07:03:37] [INFO ] Redundant transitions in 122 ms returned []
// Phase 1: matrix 1199 rows 1249 cols
[2022-05-19 07:03:37] [INFO ] Computed 450 place invariants in 4 ms
[2022-05-19 07:03:38] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1249/1249 places, 1199/1199 transitions.
Built C files in :
/tmp/ltsmin3910100904455664815
[2022-05-19 07:03:38] [INFO ] Computing symmetric may disable matrix : 1199 transitions.
[2022-05-19 07:03:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:03:38] [INFO ] Computing symmetric may enable matrix : 1199 transitions.
[2022-05-19 07:03:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:03:38] [INFO ] Computing Do-Not-Accords matrix : 1199 transitions.
[2022-05-19 07:03:38] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:03:38] [INFO ] Built C files in 179ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3910100904455664815
Running compilation step : cd /tmp/ltsmin3910100904455664815;'/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/ltsmin3910100904455664815;'/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/ltsmin3910100904455664815;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 07:03:42] [INFO ] Flatten gal took : 55 ms
[2022-05-19 07:03:42] [INFO ] Flatten gal took : 49 ms
[2022-05-19 07:03:42] [INFO ] Time to serialize gal into /tmp/LTL13588214439210164860.gal : 6 ms
[2022-05-19 07:03:42] [INFO ] Time to serialize properties into /tmp/LTL4816019461849328649.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/LTL13588214439210164860.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4816019461849328649.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/LTL1358821...267
Read 1 LTL properties
Checking formula 0 : !((F(G(F((X("((p68==1)&&(p70==1))"))||(F("(((p2964==1)&&(p2972==1))&&(p2999==1))")))))))
Formula 0 simplified : !FGF(X"((p68==1)&&(p70==1))" | F"(((p2964==1)&&(p2972==1))&&(p2999==1))")
Detected timeout of ITS tools.
[2022-05-19 07:03:57] [INFO ] Flatten gal took : 40 ms
[2022-05-19 07:03:57] [INFO ] Applying decomposition
[2022-05-19 07:03:57] [INFO ] Flatten gal took : 40 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/graph17374279778762275922.txt' '-o' '/tmp/graph17374279778762275922.bin' '-w' '/tmp/graph17374279778762275922.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17374279778762275922.bin' '-l' '-1' '-v' '-w' '/tmp/graph17374279778762275922.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:03:57] [INFO ] Decomposing Gal with order
[2022-05-19 07:03:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:03:57] [INFO ] Removed a total of 795 redundant transitions.
[2022-05-19 07:03:57] [INFO ] Flatten gal took : 79 ms
[2022-05-19 07:03:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 716 labels/synchronizations in 14 ms.
[2022-05-19 07:03:57] [INFO ] Time to serialize gal into /tmp/LTL16162612973557804182.gal : 11 ms
[2022-05-19 07:03:57] [INFO ] Time to serialize properties into /tmp/LTL8256691792375363931.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/LTL16162612973557804182.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8256691792375363931.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/LTL1616261...246
Read 1 LTL properties
Checking formula 0 : !((F(G(F((X("((i0.u2.p68==1)&&(i0.u3.p70==1))"))||(F("(((i29.i1.i0.u445.p2964==1)&&(i29.i1.i0.u446.p2972==1))&&(i29.i1.i0.u449.p2999==...166
Formula 0 simplified : !FGF(X"((i0.u2.p68==1)&&(i0.u3.p70==1))" | F"(((i29.i1.i0.u445.p2964==1)&&(i29.i1.i0.u446.p2972==1))&&(i29.i1.i0.u449.p2999==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2407083140162196818
[2022-05-19 07:04:12] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2407083140162196818
Running compilation step : cd /tmp/ltsmin2407083140162196818;'/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 2314 ms.
Running link step : cd /tmp/ltsmin2407083140162196818;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin2407083140162196818;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](<>((X((LTLAPp0==true))||<>((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-050B-LTLFireability-06 finished in 104393 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)&&F(p1))) U (X((G(p3)&&p2))||F(p4))))'
Support contains 6 out of 2660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2660/2660 places, 2610/2610 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2654 transition count 2604
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2654 transition count 2604
Applied a total of 12 rules in 196 ms. Remains 2654 /2660 variables (removed 6) and now considering 2604/2610 (removed 6) transitions.
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:04:28] [INFO ] Computed 451 place invariants in 41 ms
[2022-05-19 07:04:29] [INFO ] Implicit Places using invariants in 915 ms returned []
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:04:29] [INFO ] Computed 451 place invariants in 8 ms
[2022-05-19 07:04:32] [INFO ] Implicit Places using invariants and state equation in 2836 ms returned []
Implicit Place search using SMT with State Equation took 3753 ms to find 0 implicit places.
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:04:32] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 07:04:33] [INFO ] Dead Transitions using invariants and state equation in 1537 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2654/2660 places, 2604/2610 transitions.
Finished structural reductions, in 1 iterations. Remains : 2654/2660 places, 2604/2610 transitions.
Stuttering acceptance computed with spot in 611 ms :[(OR (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (AND (NOT p0) (NOT p4)), (AND (NOT p4) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p4) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p4), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p4) p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p4) p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND (NOT p4) (NOT p0) (NOT p2)) (AND (NOT p4) (NOT p0) (NOT p3))), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p4) p0 (NOT p2)) (AND (NOT p4) p0 (NOT p3))), acceptance={} source=1 dest: 7}, { cond=(OR (AND (NOT p4) p0 (NOT p1) (NOT p2)) (AND (NOT p4) p0 (NOT p1) (NOT p3))), acceptance={} source=1 dest: 8}], [{ cond=(OR (AND (NOT p4) (NOT p0) (NOT p2)) (AND (NOT p4) (NOT p0) (NOT p3))), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p4) (NOT p2)) (AND (NOT p4) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p4) p0 (NOT p2)) (AND (NOT p4) p0 (NOT p3))), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p4) p0 (NOT p1) (NOT p2)) (AND (NOT p4) p0 (NOT p1) (NOT p3))), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p4) (NOT p0) p2 p3), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p4) p0 p2 p3), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p4) p0 (NOT p1) p2 p3), acceptance={} source=2 dest: 10}, { cond=(AND (NOT p4) p2 p3), acceptance={} source=2 dest: 11}], [{ cond=(OR (AND (NOT p4) (NOT p0) (NOT p2)) (AND (NOT p4) (NOT p0) (NOT p3))), acceptance={} source=3 dest: 5}, { cond=(OR (AND (NOT p4) p0 (NOT p2)) (AND (NOT p4) p0 (NOT p3))), acceptance={} source=3 dest: 7}], [{ cond=(OR (AND (NOT p4) (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p1) (NOT p3))), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p4) (NOT p0) (NOT p1) p2 p3), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p4) (NOT p0)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p4) p0), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p4) p0 (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p4) (NOT p0) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p4) p0 (NOT p3)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p4) p0 (NOT p1) (NOT p3)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p4) (NOT p0)), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p4) p0), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p4) (NOT p1)), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p4) (NOT p0) (NOT p3)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p4) p0 (NOT p3)), acceptance={} source=9 dest: 7}], [{ cond=(AND (NOT p4) (NOT p1) (NOT p3)), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p4) (NOT p0) (NOT p1) p3), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p4) (NOT p0) (NOT p3)), acceptance={} source=11 dest: 1}, { cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=11 dest: 2}, { cond=(AND (NOT p4) p0 (NOT p3)), acceptance={} source=11 dest: 3}, { cond=(AND (NOT p4) p0 (NOT p1) (NOT p3)), acceptance={} source=11 dest: 4}, { cond=(AND (NOT p4) (NOT p0) p3), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p4) p0 p3), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p4) p0 (NOT p1) p3), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p4) p3), acceptance={} source=11 dest: 11}]], initial=0, aps=[p4:(EQ s661 1), p0:(EQ s835 1), p1:(AND (EQ s1011 1) (EQ s1021 1) (EQ s1040 1)), p2:(AND (EQ s1011 1) (EQ s1021 1) (EQ s1040 1)), p3:(EQ s926 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 23 reset in 906 ms.
Product exploration explored 100000 steps with 22 reset in 1058 ms.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Detected a total of 600/2654 stabilizing places and 600/2604 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/5 atomic propositions.
Knowledge obtained : [(AND (NOT p4) (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND (NOT p4) p0 p2 p3))), (X (OR (AND (NOT p4) (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p1) (NOT p3)))), (X (OR (AND (NOT p4) (NOT p2)) (AND (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p4) p2 p3))), (X (NOT (AND (NOT p4) (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND (NOT p4) p0 (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p4) p0 (NOT p1) (NOT p2)) (AND (NOT p4) p0 (NOT p1) (NOT p3))))), (X (NOT (AND (NOT p4) (NOT p0) p2 p3))), (X (NOT (OR (AND (NOT p4) p0 (NOT p2)) (AND (NOT p4) p0 (NOT p3))))), (X (OR (AND (NOT p4) (NOT p0) (NOT p2)) (AND (NOT p4) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p4) p0 p2 p3)))), (X (X (NOT (AND (NOT p4) p0 (NOT p1) p3)))), (X (X (OR (AND (NOT p4) (NOT p2)) (AND (NOT p4) (NOT p3))))), (X (X (AND (NOT p4) (NOT p1) (NOT p3)))), (X (X (AND (NOT p4) (NOT p0)))), (X (X (NOT (AND (NOT p4) (NOT p0) (NOT p1) p2 p3)))), (X (X (AND (NOT p4) (NOT p0) (NOT p3)))), (X (X (NOT (OR (AND (NOT p4) p0 (NOT p2)) (AND (NOT p4) p0 (NOT p3)))))), (X (X (OR (AND (NOT p4) (NOT p0) (NOT p2)) (AND (NOT p4) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p4) p0 (NOT p3))))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (OR (AND (NOT p4) (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p4) p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p4) p2 p3)))), (X (X (NOT (AND (NOT p4) p0 (NOT p1))))), (X (X (AND (NOT p4) (NOT p1)))), (X (X (NOT (AND (NOT p4) p0 (NOT p1) p2 p3)))), (X (X (NOT (OR (AND (NOT p4) p0 (NOT p1) (NOT p2)) (AND (NOT p4) p0 (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p4) (NOT p0) p2 p3)))), (X (X (NOT (AND (NOT p4) (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p4) (NOT p0) p3)))), (X (X (NOT (AND (NOT p4) p0 p3)))), (X (X (AND (NOT p4) (NOT p3)))), (X (X (NOT (AND (NOT p4) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 36 factoid took 2634 ms. Reduced automaton from 12 states, 40 edges and 5 AP to 12 states, 38 edges and 5 AP.
Stuttering acceptance computed with spot in 571 ms :[(OR (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (AND (NOT p0) (NOT p4)), (AND (NOT p4) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 24) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) 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 15) 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 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:04:40] [INFO ] Computed 451 place invariants in 7 ms
[2022-05-19 07:04:41] [INFO ] [Real]Absence check using 451 positive place invariants in 164 ms returned sat
[2022-05-19 07:04:41] [INFO ] After 1033ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:13
[2022-05-19 07:04:41] [INFO ] [Nat]Absence check using 451 positive place invariants in 155 ms returned sat
[2022-05-19 07:04:44] [INFO ] After 2473ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :13
[2022-05-19 07:04:45] [INFO ] Deduced a trap composed of 25 places in 675 ms of which 2 ms to minimize.
[2022-05-19 07:04:46] [INFO ] Deduced a trap composed of 22 places in 631 ms of which 2 ms to minimize.
[2022-05-19 07:04:47] [INFO ] Deduced a trap composed of 24 places in 666 ms of which 1 ms to minimize.
[2022-05-19 07:04:47] [INFO ] Deduced a trap composed of 26 places in 642 ms of which 1 ms to minimize.
[2022-05-19 07:04:48] [INFO ] Deduced a trap composed of 27 places in 636 ms of which 1 ms to minimize.
[2022-05-19 07:04:49] [INFO ] Deduced a trap composed of 26 places in 610 ms of which 1 ms to minimize.
[2022-05-19 07:04:50] [INFO ] Deduced a trap composed of 18 places in 636 ms of which 1 ms to minimize.
[2022-05-19 07:04:50] [INFO ] Deduced a trap composed of 18 places in 626 ms of which 2 ms to minimize.
[2022-05-19 07:04:51] [INFO ] Deduced a trap composed of 38 places in 617 ms of which 1 ms to minimize.
[2022-05-19 07:04:52] [INFO ] Deduced a trap composed of 15 places in 609 ms of which 2 ms to minimize.
[2022-05-19 07:04:52] [INFO ] Deduced a trap composed of 25 places in 601 ms of which 2 ms to minimize.
[2022-05-19 07:04:53] [INFO ] Deduced a trap composed of 37 places in 595 ms of which 1 ms to minimize.
[2022-05-19 07:04:54] [INFO ] Deduced a trap composed of 24 places in 561 ms of which 1 ms to minimize.
[2022-05-19 07:04:54] [INFO ] Deduced a trap composed of 27 places in 564 ms of which 1 ms to minimize.
[2022-05-19 07:04:55] [INFO ] Deduced a trap composed of 32 places in 563 ms of which 2 ms to minimize.
[2022-05-19 07:04:56] [INFO ] Deduced a trap composed of 35 places in 545 ms of which 1 ms to minimize.
[2022-05-19 07:04:56] [INFO ] Deduced a trap composed of 41 places in 552 ms of which 1 ms to minimize.
[2022-05-19 07:04:57] [INFO ] Deduced a trap composed of 27 places in 569 ms of which 1 ms to minimize.
[2022-05-19 07:04:58] [INFO ] Deduced a trap composed of 37 places in 545 ms of which 1 ms to minimize.
[2022-05-19 07:04:58] [INFO ] Deduced a trap composed of 35 places in 545 ms of which 2 ms to minimize.
[2022-05-19 07:04:59] [INFO ] Deduced a trap composed of 34 places in 513 ms of which 1 ms to minimize.
[2022-05-19 07:05:00] [INFO ] Deduced a trap composed of 20 places in 552 ms of which 2 ms to minimize.
[2022-05-19 07:05:00] [INFO ] Deduced a trap composed of 42 places in 541 ms of which 2 ms to minimize.
[2022-05-19 07:05:01] [INFO ] Deduced a trap composed of 27 places in 529 ms of which 1 ms to minimize.
[2022-05-19 07:05:01] [INFO ] Deduced a trap composed of 33 places in 502 ms of which 1 ms to minimize.
[2022-05-19 07:05:02] [INFO ] Deduced a trap composed of 41 places in 498 ms of which 1 ms to minimize.
[2022-05-19 07:05:03] [INFO ] Deduced a trap composed of 46 places in 479 ms of which 1 ms to minimize.
[2022-05-19 07:05:03] [INFO ] Deduced a trap composed of 43 places in 488 ms of which 1 ms to minimize.
[2022-05-19 07:05:04] [INFO ] Deduced a trap composed of 28 places in 453 ms of which 1 ms to minimize.
[2022-05-19 07:05:04] [INFO ] Deduced a trap composed of 48 places in 436 ms of which 1 ms to minimize.
[2022-05-19 07:05:05] [INFO ] Deduced a trap composed of 37 places in 436 ms of which 1 ms to minimize.
[2022-05-19 07:05:05] [INFO ] Deduced a trap composed of 21 places in 426 ms of which 1 ms to minimize.
[2022-05-19 07:05:06] [INFO ] Deduced a trap composed of 18 places in 421 ms of which 1 ms to minimize.
[2022-05-19 07:05:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 07:05:06] [INFO ] After 25180ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:13
Fused 15 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 1042 ms.
Support contains 6 out of 2654 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2654/2654 places, 2604/2604 transitions.
Drop transitions removed 249 transitions
Trivial Post-agglo rules discarded 249 transitions
Performed 249 trivial Post agglomeration. Transition count delta: 249
Iterating post reduction 0 with 249 rules applied. Total rules applied 249 place count 2654 transition count 2355
Reduce places removed 249 places and 0 transitions.
Iterating post reduction 1 with 249 rules applied. Total rules applied 498 place count 2405 transition count 2355
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 498 place count 2405 transition count 2104
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1000 place count 2154 transition count 2104
Performed 898 Post agglomeration using F-continuation condition.Transition count delta: 898
Deduced a syphon composed of 898 places in 3 ms
Reduce places removed 898 places and 0 transitions.
Iterating global reduction 2 with 1796 rules applied. Total rules applied 2796 place count 1256 transition count 1206
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 347 times.
Drop transitions removed 347 transitions
Iterating global reduction 2 with 347 rules applied. Total rules applied 3143 place count 1256 transition count 1206
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3144 place count 1255 transition count 1205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3145 place count 1254 transition count 1205
Applied a total of 3145 rules in 305 ms. Remains 1254 /2654 variables (removed 1400) and now considering 1205/2604 (removed 1399) transitions.
Finished structural reductions, in 1 iterations. Remains : 1254/2654 places, 1205/2604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1205 rows 1254 cols
[2022-05-19 07:05:08] [INFO ] Computed 450 place invariants in 13 ms
[2022-05-19 07:05:08] [INFO ] [Real]Absence check using 449 positive place invariants in 70 ms returned sat
[2022-05-19 07:05:08] [INFO ] [Real]Absence check using 449 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:05:09] [INFO ] After 998ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-19 07:05:09] [INFO ] [Nat]Absence check using 449 positive place invariants in 69 ms returned sat
[2022-05-19 07:05:09] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 07:05:10] [INFO ] After 772ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-19 07:05:10] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-19 07:05:10] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2022-05-19 07:05:10] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2022-05-19 07:05:10] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2022-05-19 07:05:10] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2022-05-19 07:05:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 537 ms
[2022-05-19 07:05:11] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2022-05-19 07:05:11] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2022-05-19 07:05:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2022-05-19 07:05:11] [INFO ] After 1847ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 347 ms.
[2022-05-19 07:05:11] [INFO ] After 2564ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 114 ms.
Support contains 6 out of 1254 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1254/1254 places, 1205/1205 transitions.
Applied a total of 0 rules in 37 ms. Remains 1254 /1254 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1254/1254 places, 1205/1205 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1205 rows 1254 cols
[2022-05-19 07:05:12] [INFO ] Computed 450 place invariants in 8 ms
[2022-05-19 07:05:12] [INFO ] [Real]Absence check using 449 positive place invariants in 67 ms returned sat
[2022-05-19 07:05:12] [INFO ] [Real]Absence check using 449 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 07:05:13] [INFO ] After 815ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 07:05:13] [INFO ] [Nat]Absence check using 449 positive place invariants in 67 ms returned sat
[2022-05-19 07:05:13] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:05:14] [INFO ] After 578ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 07:05:14] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2022-05-19 07:05:14] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2022-05-19 07:05:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
[2022-05-19 07:05:14] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2022-05-19 07:05:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2022-05-19 07:05:14] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2022-05-19 07:05:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2022-05-19 07:05:14] [INFO ] After 1246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 151 ms.
[2022-05-19 07:05:15] [INFO ] After 1702ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 70 ms.
Support contains 6 out of 1254 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1254/1254 places, 1205/1205 transitions.
Applied a total of 0 rules in 22 ms. Remains 1254 /1254 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1254/1254 places, 1205/1205 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 146991 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 146991 steps, saw 144907 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1205 rows 1254 cols
[2022-05-19 07:05:18] [INFO ] Computed 450 place invariants in 5 ms
[2022-05-19 07:05:18] [INFO ] [Real]Absence check using 449 positive place invariants in 69 ms returned sat
[2022-05-19 07:05:18] [INFO ] [Real]Absence check using 449 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:05:19] [INFO ] After 865ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 07:05:19] [INFO ] [Nat]Absence check using 449 positive place invariants in 68 ms returned sat
[2022-05-19 07:05:19] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 07:05:20] [INFO ] After 609ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 07:05:20] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2022-05-19 07:05:20] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2022-05-19 07:05:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2022-05-19 07:05:20] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2022-05-19 07:05:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2022-05-19 07:05:21] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2022-05-19 07:05:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2022-05-19 07:05:21] [INFO ] After 1276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 150 ms.
[2022-05-19 07:05:21] [INFO ] After 1746ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 72 ms.
Support contains 6 out of 1254 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1254/1254 places, 1205/1205 transitions.
Applied a total of 0 rules in 24 ms. Remains 1254 /1254 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1254/1254 places, 1205/1205 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1254/1254 places, 1205/1205 transitions.
Applied a total of 0 rules in 23 ms. Remains 1254 /1254 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
// Phase 1: matrix 1205 rows 1254 cols
[2022-05-19 07:05:21] [INFO ] Computed 450 place invariants in 15 ms
[2022-05-19 07:05:22] [INFO ] Implicit Places using invariants in 702 ms returned []
// Phase 1: matrix 1205 rows 1254 cols
[2022-05-19 07:05:22] [INFO ] Computed 450 place invariants in 12 ms
[2022-05-19 07:05:23] [INFO ] Implicit Places using invariants and state equation in 1640 ms returned []
Implicit Place search using SMT with State Equation took 2346 ms to find 0 implicit places.
[2022-05-19 07:05:23] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 1205 rows 1254 cols
[2022-05-19 07:05:23] [INFO ] Computed 450 place invariants in 13 ms
[2022-05-19 07:05:24] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1254/1254 places, 1205/1205 transitions.
Applied a total of 0 rules in 24 ms. Remains 1254 /1254 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1205 rows 1254 cols
[2022-05-19 07:05:24] [INFO ] Computed 450 place invariants in 13 ms
[2022-05-19 07:05:24] [INFO ] [Real]Absence check using 449 positive place invariants in 68 ms returned sat
[2022-05-19 07:05:24] [INFO ] [Real]Absence check using 449 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 07:05:25] [INFO ] After 861ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 07:05:25] [INFO ] [Nat]Absence check using 449 positive place invariants in 68 ms returned sat
[2022-05-19 07:05:25] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 07:05:26] [INFO ] After 602ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 07:05:26] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2022-05-19 07:05:26] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2022-05-19 07:05:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 248 ms
[2022-05-19 07:05:26] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2022-05-19 07:05:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2022-05-19 07:05:26] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2022-05-19 07:05:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2022-05-19 07:05:26] [INFO ] After 1292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 142 ms.
[2022-05-19 07:05:27] [INFO ] After 1755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-19 07:05:27] [INFO ] Flatten gal took : 43 ms
[2022-05-19 07:05:27] [INFO ] Flatten gal took : 43 ms
[2022-05-19 07:05:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17868336694758320776.gal : 5 ms
[2022-05-19 07:05:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3314031413481155394.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms3968612004633610531;'/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/ReachabilityCardinality17868336694758320776.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3314031413481155394.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/ReachabilityCardinality3314031413481155394.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :3 after 6
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :6 after 108
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :108 after 306
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :306 after 435
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :435 after 686
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :686 after 2841
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :2841 after 13158
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :13158 after 206950
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :206950 after 3.44408e+06
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :3.44408e+06 after 1.27984e+08
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :1.27984e+08 after 1.50933e+10
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :1.50933e+10 after 2.67784e+10
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :2.67784e+10 after 5.63994e+11
Detected timeout of ITS tools.
[2022-05-19 07:05:42] [INFO ] Flatten gal took : 43 ms
[2022-05-19 07:05:42] [INFO ] Applying decomposition
[2022-05-19 07:05:42] [INFO ] Flatten gal took : 43 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/graph5645902498257209586.txt' '-o' '/tmp/graph5645902498257209586.bin' '-w' '/tmp/graph5645902498257209586.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5645902498257209586.bin' '-l' '-1' '-v' '-w' '/tmp/graph5645902498257209586.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:05:42] [INFO ] Decomposing Gal with order
[2022-05-19 07:05:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:05:42] [INFO ] Removed a total of 956 redundant transitions.
[2022-05-19 07:05:42] [INFO ] Flatten gal took : 81 ms
[2022-05-19 07:05:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 1298 labels/synchronizations in 22 ms.
[2022-05-19 07:05:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11461858494062116450.gal : 8 ms
[2022-05-19 07:05:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18101234133989007901.prop : 56 ms
Invoking ITS tools like this :cd /tmp/redAtoms3968612004633610531;'/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/ReachabilityCardinality11461858494062116450.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18101234133989007901.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/ReachabilityCardinality18101234133989007901.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1 after 1
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7636986998951046459
[2022-05-19 07:05:57] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7636986998951046459
Running compilation step : cd /tmp/ltsmin7636986998951046459;'/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 2364 ms.
Running link step : cd /tmp/ltsmin7636986998951046459;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7636986998951046459;'/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' 'apf5==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p4) (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND (NOT p4) p0 p2 p3))), (X (OR (AND (NOT p4) (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p1) (NOT p3)))), (X (OR (AND (NOT p4) (NOT p2)) (AND (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p4) p2 p3))), (X (NOT (AND (NOT p4) (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND (NOT p4) p0 (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p4) p0 (NOT p1) (NOT p2)) (AND (NOT p4) p0 (NOT p1) (NOT p3))))), (X (NOT (AND (NOT p4) (NOT p0) p2 p3))), (X (NOT (OR (AND (NOT p4) p0 (NOT p2)) (AND (NOT p4) p0 (NOT p3))))), (X (OR (AND (NOT p4) (NOT p0) (NOT p2)) (AND (NOT p4) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p4) p0 p2 p3)))), (X (X (NOT (AND (NOT p4) p0 (NOT p1) p3)))), (X (X (OR (AND (NOT p4) (NOT p2)) (AND (NOT p4) (NOT p3))))), (X (X (AND (NOT p4) (NOT p1) (NOT p3)))), (X (X (AND (NOT p4) (NOT p0)))), (X (X (NOT (AND (NOT p4) (NOT p0) (NOT p1) p2 p3)))), (X (X (AND (NOT p4) (NOT p0) (NOT p3)))), (X (X (NOT (OR (AND (NOT p4) p0 (NOT p2)) (AND (NOT p4) p0 (NOT p3)))))), (X (X (OR (AND (NOT p4) (NOT p0) (NOT p2)) (AND (NOT p4) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p4) p0 (NOT p3))))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (OR (AND (NOT p4) (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p4) p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p4) p2 p3)))), (X (X (NOT (AND (NOT p4) p0 (NOT p1))))), (X (X (AND (NOT p4) (NOT p1)))), (X (X (NOT (AND (NOT p4) p0 (NOT p1) p2 p3)))), (X (X (NOT (OR (AND (NOT p4) p0 (NOT p1) (NOT p2)) (AND (NOT p4) p0 (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p4) (NOT p0) p2 p3)))), (X (X (NOT (AND (NOT p4) (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p4) (NOT p0) p3)))), (X (X (NOT (AND (NOT p4) p0 p3)))), (X (X (AND (NOT p4) (NOT p3)))), (X (X (NOT (AND (NOT p4) p0)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p2 (NOT p0) (NOT p4) p3 (NOT p1)))), (G (NOT (AND p2 p0 (NOT p4) p3 (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p2) (NOT p4) (NOT p1)) (AND (NOT p4) (NOT p3) (NOT p1))))), (F (AND p2 (NOT p4) p3)), (F (AND p0 (NOT p4) (NOT p3) (NOT p1))), (F (AND p2 (NOT p0) (NOT p4) p3)), (F (AND p0 (NOT p4) (NOT p3))), (F (NOT (OR (AND (NOT p2) (NOT p4)) (AND (NOT p4) (NOT p3))))), (F (NOT (AND (NOT p0) (NOT p4) (NOT p3)))), (F (AND p0 (NOT p4) (NOT p1))), (F (AND (NOT p4) p3)), (F (NOT (OR (AND (NOT p2) (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p4) (NOT p3))))), (F (NOT (AND (NOT p4) (NOT p3)))), (F (AND (NOT p0) (NOT p4) p3 (NOT p1))), (F (OR (AND (NOT p2) p0 (NOT p4) (NOT p1)) (AND p0 (NOT p4) (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p4) (NOT p3) (NOT p1)))), (F (OR (AND (NOT p2) p0 (NOT p4)) (AND p0 (NOT p4) (NOT p3)))), (F (NOT (AND (NOT p4) (NOT p1)))), (F (AND p0 (NOT p4))), (F (NOT (AND (NOT p0) (NOT p4)))), (F (AND (NOT p0) (NOT p4) p3))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 38 factoid took 2804 ms. Reduced automaton from 12 states, 38 edges and 5 AP to 6 states, 16 edges and 5 AP.
Stuttering acceptance computed with spot in 291 ms :[(OR (AND (NOT p0) (NOT p4)) (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p4))), (AND (NOT p0) (NOT p4)), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (AND (NOT p3) (NOT p4))]
Stuttering acceptance computed with spot in 282 ms :[(OR (AND (NOT p0) (NOT p4)) (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p4))), (AND (NOT p0) (NOT p4)), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (AND (NOT p3) (NOT p4))]
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:06:16] [INFO ] Computed 451 place invariants in 16 ms
[2022-05-19 07:06:18] [INFO ] [Real]Absence check using 451 positive place invariants in 794 ms returned sat
[2022-05-19 07:06:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:06:31] [INFO ] [Real]Absence check using state equation in 12740 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p4))
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:06:31] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 07:06:33] [INFO ] [Real]Absence check using 451 positive place invariants in 801 ms returned sat
[2022-05-19 07:06:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:06:46] [INFO ] [Real]Absence check using state equation in 12763 ms returned unknown
Could not prove EG (AND (NOT p2) (NOT p4))
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:06:46] [INFO ] Computed 451 place invariants in 12 ms
[2022-05-19 07:06:48] [INFO ] [Real]Absence check using 451 positive place invariants in 777 ms returned sat
[2022-05-19 07:06:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:07:01] [INFO ] [Real]Absence check using state equation in 12846 ms returned unknown
Could not prove EG (AND (NOT p3) (NOT p4))
Support contains 6 out of 2654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2654/2654 places, 2604/2604 transitions.
Applied a total of 0 rules in 104 ms. Remains 2654 /2654 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:07:01] [INFO ] Computed 451 place invariants in 21 ms
[2022-05-19 07:07:02] [INFO ] Implicit Places using invariants in 834 ms returned []
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:07:02] [INFO ] Computed 451 place invariants in 8 ms
[2022-05-19 07:07:05] [INFO ] Implicit Places using invariants and state equation in 2859 ms returned []
Implicit Place search using SMT with State Equation took 3695 ms to find 0 implicit places.
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:07:05] [INFO ] Computed 451 place invariants in 7 ms
[2022-05-19 07:07:06] [INFO ] Dead Transitions using invariants and state equation in 1473 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2654/2654 places, 2604/2604 transitions.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Detected a total of 600/2654 stabilizing places and 600/2604 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/5 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p4) (NOT p3) (NOT p0) (NOT p1)), (X (OR (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4)))), (X (NOT (AND p1 p2 p3 (NOT p4)))), (X (NOT (OR (AND p0 (NOT p2) (NOT p4)) (AND p0 (NOT p3) (NOT p4))))), (X (NOT (AND p0 (NOT p4)))), (X (NOT (AND (NOT p1) p0 (NOT p4)))), (X (AND (NOT p0) (NOT p4))), (X (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4)))), (X (X (OR (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 p2 p3 (NOT p4))))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p4)) (AND p0 (NOT p3) (NOT p4)))))), (X (X (AND (NOT p3) (NOT p4)))), (X (X (NOT (AND p0 (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4))))), (X (X (AND (NOT p0) (NOT p4)))), (X (X (NOT (OR (AND p1 p3 (NOT p4)) (AND (NOT p2) p3 (NOT p4)))))), (X (X (AND (NOT p0) (NOT p3) (NOT p4)))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))))), (X (X (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))))), (X (X (NOT (AND p0 (NOT p3) (NOT p4))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1012 ms. Reduced automaton from 6 states, 16 edges and 5 AP to 6 states, 16 edges and 5 AP.
Stuttering acceptance computed with spot in 282 ms :[(OR (AND (NOT p0) (NOT p4)) (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (AND (NOT p0) (NOT p4)), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), (AND (NOT p3) (NOT p4))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 12) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:07:08] [INFO ] Computed 451 place invariants in 9 ms
[2022-05-19 07:07:08] [INFO ] [Real]Absence check using 451 positive place invariants in 150 ms returned sat
[2022-05-19 07:07:08] [INFO ] After 691ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-19 07:07:09] [INFO ] [Nat]Absence check using 451 positive place invariants in 157 ms returned sat
[2022-05-19 07:07:11] [INFO ] After 1669ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-19 07:07:12] [INFO ] Deduced a trap composed of 11 places in 689 ms of which 1 ms to minimize.
[2022-05-19 07:07:12] [INFO ] Deduced a trap composed of 14 places in 686 ms of which 1 ms to minimize.
[2022-05-19 07:07:13] [INFO ] Deduced a trap composed of 26 places in 640 ms of which 1 ms to minimize.
[2022-05-19 07:07:14] [INFO ] Deduced a trap composed of 23 places in 629 ms of which 1 ms to minimize.
[2022-05-19 07:07:15] [INFO ] Deduced a trap composed of 14 places in 675 ms of which 2 ms to minimize.
[2022-05-19 07:07:15] [INFO ] Deduced a trap composed of 27 places in 669 ms of which 1 ms to minimize.
[2022-05-19 07:07:16] [INFO ] Deduced a trap composed of 16 places in 632 ms of which 2 ms to minimize.
[2022-05-19 07:07:17] [INFO ] Deduced a trap composed of 22 places in 662 ms of which 2 ms to minimize.
[2022-05-19 07:07:18] [INFO ] Deduced a trap composed of 18 places in 636 ms of which 1 ms to minimize.
[2022-05-19 07:07:18] [INFO ] Deduced a trap composed of 24 places in 662 ms of which 1 ms to minimize.
[2022-05-19 07:07:19] [INFO ] Deduced a trap composed of 14 places in 623 ms of which 2 ms to minimize.
[2022-05-19 07:07:20] [INFO ] Deduced a trap composed of 26 places in 609 ms of which 1 ms to minimize.
[2022-05-19 07:07:21] [INFO ] Deduced a trap composed of 25 places in 596 ms of which 2 ms to minimize.
[2022-05-19 07:07:21] [INFO ] Deduced a trap composed of 31 places in 606 ms of which 1 ms to minimize.
[2022-05-19 07:07:22] [INFO ] Deduced a trap composed of 39 places in 647 ms of which 2 ms to minimize.
[2022-05-19 07:07:23] [INFO ] Deduced a trap composed of 35 places in 619 ms of which 2 ms to minimize.
[2022-05-19 07:07:23] [INFO ] Deduced a trap composed of 26 places in 593 ms of which 1 ms to minimize.
[2022-05-19 07:07:24] [INFO ] Deduced a trap composed of 20 places in 656 ms of which 2 ms to minimize.
[2022-05-19 07:07:25] [INFO ] Deduced a trap composed of 26 places in 626 ms of which 1 ms to minimize.
[2022-05-19 07:07:26] [INFO ] Deduced a trap composed of 22 places in 633 ms of which 2 ms to minimize.
[2022-05-19 07:07:26] [INFO ] Deduced a trap composed of 13 places in 619 ms of which 1 ms to minimize.
[2022-05-19 07:07:27] [INFO ] Deduced a trap composed of 10 places in 612 ms of which 2 ms to minimize.
[2022-05-19 07:07:28] [INFO ] Deduced a trap composed of 34 places in 629 ms of which 1 ms to minimize.
[2022-05-19 07:07:28] [INFO ] Deduced a trap composed of 26 places in 636 ms of which 2 ms to minimize.
[2022-05-19 07:07:29] [INFO ] Deduced a trap composed of 22 places in 621 ms of which 1 ms to minimize.
[2022-05-19 07:07:30] [INFO ] Deduced a trap composed of 32 places in 667 ms of which 2 ms to minimize.
[2022-05-19 07:07:31] [INFO ] Deduced a trap composed of 33 places in 649 ms of which 1 ms to minimize.
[2022-05-19 07:07:31] [INFO ] Deduced a trap composed of 31 places in 645 ms of which 1 ms to minimize.
[2022-05-19 07:07:32] [INFO ] Deduced a trap composed of 25 places in 608 ms of which 2 ms to minimize.
[2022-05-19 07:07:33] [INFO ] Deduced a trap composed of 22 places in 641 ms of which 2 ms to minimize.
[2022-05-19 07:07:34] [INFO ] Deduced a trap composed of 20 places in 633 ms of which 1 ms to minimize.
[2022-05-19 07:07:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 07:07:34] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 410 ms.
Support contains 5 out of 2654 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2654/2654 places, 2604/2604 transitions.
Drop transitions removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 2654 transition count 2354
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 1 with 250 rules applied. Total rules applied 500 place count 2404 transition count 2354
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 500 place count 2404 transition count 2103
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1002 place count 2153 transition count 2103
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 3 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 2800 place count 1254 transition count 1204
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 347 times.
Drop transitions removed 347 transitions
Iterating global reduction 2 with 347 rules applied. Total rules applied 3147 place count 1254 transition count 1204
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3148 place count 1253 transition count 1203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3149 place count 1252 transition count 1203
Applied a total of 3149 rules in 316 ms. Remains 1252 /2654 variables (removed 1402) and now considering 1203/2604 (removed 1401) transitions.
Finished structural reductions, in 1 iterations. Remains : 1252/2654 places, 1203/2604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1203 rows 1252 cols
[2022-05-19 07:07:34] [INFO ] Computed 450 place invariants in 13 ms
[2022-05-19 07:07:35] [INFO ] [Real]Absence check using 449 positive place invariants in 66 ms returned sat
[2022-05-19 07:07:35] [INFO ] [Real]Absence check using 449 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-19 07:07:35] [INFO ] After 718ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:07:35] [INFO ] [Nat]Absence check using 449 positive place invariants in 68 ms returned sat
[2022-05-19 07:07:35] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 07:07:36] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:07:36] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2022-05-19 07:07:36] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2022-05-19 07:07:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 232 ms
[2022-05-19 07:07:36] [INFO ] After 779ms 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-19 07:07:36] [INFO ] After 1075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 5 out of 1252 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1252/1252 places, 1203/1203 transitions.
Applied a total of 0 rules in 23 ms. Remains 1252 /1252 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1252/1252 places, 1203/1203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Finished probabilistic random walk after 224825 steps, run visited all 1 properties in 2629 ms. (steps per millisecond=85 )
Probabilistic random walk after 224825 steps, saw 221468 distinct states, run finished after 2630 ms. (steps per millisecond=85 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) (NOT p4) (NOT p3) (NOT p0) (NOT p1)), (X (OR (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4)))), (X (NOT (AND p1 p2 p3 (NOT p4)))), (X (NOT (OR (AND p0 (NOT p2) (NOT p4)) (AND p0 (NOT p3) (NOT p4))))), (X (NOT (AND p0 (NOT p4)))), (X (NOT (AND (NOT p1) p0 (NOT p4)))), (X (AND (NOT p0) (NOT p4))), (X (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4)))), (X (X (OR (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 p2 p3 (NOT p4))))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p4)) (AND p0 (NOT p3) (NOT p4)))))), (X (X (AND (NOT p3) (NOT p4)))), (X (X (NOT (AND p0 (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4))))), (X (X (AND (NOT p0) (NOT p4)))), (X (X (NOT (OR (AND p1 p3 (NOT p4)) (AND (NOT p2) p3 (NOT p4)))))), (X (X (AND (NOT p0) (NOT p3) (NOT p4)))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))))), (X (X (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))))), (X (X (NOT (AND p0 (NOT p3) (NOT p4))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p3) (NOT p4)))), (F (NOT (OR (AND (NOT p3) (NOT p4) (NOT p1)) (AND (NOT p4) (NOT p2) (NOT p1))))), (F (NOT (AND (NOT p3) (NOT p0) (NOT p4)))), (F (NOT (AND (NOT p0) (NOT p4)))), (F (AND p3 (NOT p4) p2 p1)), (F (AND p0 (NOT p4) (NOT p1))), (F (AND p0 (NOT p4))), (F (NOT (OR (AND (NOT p3) (NOT p4)) (AND (NOT p4) (NOT p2))))), (F (OR (AND (NOT p3) p0 (NOT p4)) (AND p0 (NOT p4) (NOT p2)))), (F (NOT (OR (AND (NOT p3) (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p4) (NOT p2))))), (F (OR (AND p3 (NOT p4) (NOT p2)) (AND p3 (NOT p4) p1))), (F (AND (NOT p3) p0 (NOT p4)))]
Knowledge based reduction with 21 factoid took 1458 ms. Reduced automaton from 6 states, 16 edges and 5 AP to 6 states, 16 edges and 5 AP.
Stuttering acceptance computed with spot in 292 ms :[(OR (AND (NOT p0) (NOT p4)) (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (AND (NOT p0) (NOT p4)), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), (AND (NOT p3) (NOT p4))]
Stuttering acceptance computed with spot in 282 ms :[(OR (AND (NOT p0) (NOT p4)) (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (AND (NOT p0) (NOT p4)), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), (AND (NOT p3) (NOT p4))]
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:07:41] [INFO ] Computed 451 place invariants in 16 ms
[2022-05-19 07:07:43] [INFO ] [Real]Absence check using 451 positive place invariants in 726 ms returned sat
[2022-05-19 07:07:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:07:56] [INFO ] [Real]Absence check using state equation in 12856 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p4))
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:07:56] [INFO ] Computed 451 place invariants in 14 ms
[2022-05-19 07:07:58] [INFO ] [Real]Absence check using 451 positive place invariants in 751 ms returned sat
[2022-05-19 07:07:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:08:11] [INFO ] [Real]Absence check using state equation in 12895 ms returned unknown
Could not prove EG (AND (NOT p3) (NOT p4))
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:08:11] [INFO ] Computed 451 place invariants in 14 ms
[2022-05-19 07:08:14] [INFO ] [Real]Absence check using 451 positive place invariants in 793 ms returned sat
[2022-05-19 07:08:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:08:26] [INFO ] [Real]Absence check using state equation in 12760 ms returned unknown
Could not prove EG (AND (NOT p2) (NOT p4))
Stuttering acceptance computed with spot in 251 ms :[(OR (AND (NOT p0) (NOT p4)) (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (AND (NOT p0) (NOT p4)), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), (AND (NOT p3) (NOT p4))]
Product exploration explored 100000 steps with 23 reset in 861 ms.
Product exploration explored 100000 steps with 23 reset in 1090 ms.
Applying partial POR strategy [false, false, false, false, true, false]
Stuttering acceptance computed with spot in 292 ms :[(OR (AND (NOT p0) (NOT p4)) (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (AND (NOT p0) (NOT p4)), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), (AND (NOT p3) (NOT p4))]
Support contains 6 out of 2654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2654/2654 places, 2604/2604 transitions.
Performed 248 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 248 rules applied. Total rules applied 248 place count 2654 transition count 2604
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 103 Pre rules applied. Total rules applied 248 place count 2654 transition count 2608
Deduced a syphon composed of 351 places in 5 ms
Iterating global reduction 1 with 103 rules applied. Total rules applied 351 place count 2654 transition count 2608
Performed 1047 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1398 places in 3 ms
Iterating global reduction 1 with 1047 rules applied. Total rules applied 1398 place count 2654 transition count 2608
Renaming transitions due to excessive name length > 1024 char.
Discarding 347 places :
Symmetric choice reduction at 1 with 347 rule applications. Total rules 1745 place count 2307 transition count 2261
Deduced a syphon composed of 1051 places in 3 ms
Iterating global reduction 1 with 347 rules applied. Total rules applied 2092 place count 2307 transition count 2261
Deduced a syphon composed of 1051 places in 2 ms
Applied a total of 2092 rules in 1054 ms. Remains 2307 /2654 variables (removed 347) and now considering 2261/2604 (removed 343) transitions.
[2022-05-19 07:08:30] [INFO ] Redundant transitions in 262 ms returned [2260]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2260 rows 2307 cols
[2022-05-19 07:08:30] [INFO ] Computed 451 place invariants in 25 ms
[2022-05-19 07:08:32] [INFO ] Dead Transitions using invariants and state equation in 1332 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2307/2654 places, 2260/2604 transitions.
Deduced a syphon composed of 1051 places in 2 ms
Applied a total of 0 rules in 82 ms. Remains 2307 /2307 variables (removed 0) and now considering 2260/2260 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2307/2654 places, 2260/2604 transitions.
Product exploration explored 100000 steps with 28 reset in 892 ms.
Product exploration explored 100000 steps with 31 reset in 975 ms.
Built C files in :
/tmp/ltsmin10035786575780212620
[2022-05-19 07:08:34] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10035786575780212620
Running compilation step : cd /tmp/ltsmin10035786575780212620;'/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/ltsmin10035786575780212620;'/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/ltsmin10035786575780212620;'/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 6 out of 2654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2654/2654 places, 2604/2604 transitions.
Applied a total of 0 rules in 124 ms. Remains 2654 /2654 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:08:37] [INFO ] Computed 451 place invariants in 9 ms
[2022-05-19 07:08:38] [INFO ] Implicit Places using invariants in 873 ms returned []
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:08:38] [INFO ] Computed 451 place invariants in 8 ms
[2022-05-19 07:08:41] [INFO ] Implicit Places using invariants and state equation in 2891 ms returned []
Implicit Place search using SMT with State Equation took 3765 ms to find 0 implicit places.
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:08:41] [INFO ] Computed 451 place invariants in 7 ms
[2022-05-19 07:08:42] [INFO ] Dead Transitions using invariants and state equation in 1521 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2654/2654 places, 2604/2604 transitions.
Built C files in :
/tmp/ltsmin11535464264756108323
[2022-05-19 07:08:42] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11535464264756108323
Running compilation step : cd /tmp/ltsmin11535464264756108323;'/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/ltsmin11535464264756108323;'/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/ltsmin11535464264756108323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 07:08:45] [INFO ] Flatten gal took : 66 ms
[2022-05-19 07:08:45] [INFO ] Flatten gal took : 65 ms
[2022-05-19 07:08:45] [INFO ] Time to serialize gal into /tmp/LTL12073713920524092297.gal : 12 ms
[2022-05-19 07:08:45] [INFO ] Time to serialize properties into /tmp/LTL8391362605378998349.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/LTL12073713920524092297.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8391362605378998349.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/LTL1207371...267
Read 1 LTL properties
Checking formula 0 : !(((F((G("(p939==1)"))&&(F("(((p1135==1)&&(p1146==1))&&(p1170==1))"))))U((X(((G("(p1040==1)"))&&("(p1135==1)"))&&("((p1146==1)&&(p1170...185
Formula 0 simplified : !(F(G"(p939==1)" & F"(((p1135==1)&&(p1146==1))&&(p1170==1))") U (X("((p1146==1)&&(p1170==1))" & "(p1135==1)" & G"(p1040==1)") | F"(p...165
Detected timeout of ITS tools.
[2022-05-19 07:09:00] [INFO ] Flatten gal took : 69 ms
[2022-05-19 07:09:00] [INFO ] Applying decomposition
[2022-05-19 07:09:00] [INFO ] Flatten gal took : 68 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/graph12252753852334903828.txt' '-o' '/tmp/graph12252753852334903828.bin' '-w' '/tmp/graph12252753852334903828.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12252753852334903828.bin' '-l' '-1' '-v' '-w' '/tmp/graph12252753852334903828.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:09:01] [INFO ] Decomposing Gal with order
[2022-05-19 07:09:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:09:01] [INFO ] Removed a total of 1150 redundant transitions.
[2022-05-19 07:09:01] [INFO ] Flatten gal took : 123 ms
[2022-05-19 07:09:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2022-05-19 07:09:01] [INFO ] Time to serialize gal into /tmp/LTL13571195365843497636.gal : 21 ms
[2022-05-19 07:09:01] [INFO ] Time to serialize properties into /tmp/LTL9298334167050911168.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/LTL13571195365843497636.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9298334167050911168.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/LTL1357119...246
Read 1 LTL properties
Checking formula 0 : !(((F((G("(i14.i0.u317.p939==1)"))&&(F("(((i18.i5.u384.p1135==1)&&(i18.i3.u388.p1146==1))&&(i18.i5.u394.p1170==1))"))))U((X(((G("(i16....293
Formula 0 simplified : !(F(G"(i14.i0.u317.p939==1)" & F"(((i18.i5.u384.p1135==1)&&(i18.i3.u388.p1146==1))&&(i18.i5.u394.p1170==1))") U (X("((i18.i3.u388.p1...273
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12028892608516185020
[2022-05-19 07:09:16] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12028892608516185020
Running compilation step : cd /tmp/ltsmin12028892608516185020;'/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/ltsmin12028892608516185020;'/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/ltsmin12028892608516185020;'/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 ShieldIIPs-PT-050B-LTLFireability-07 finished in 291855 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(F(p0)))||X(X(p1)))))'
Support contains 2 out of 2660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2660/2660 places, 2610/2610 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2654 transition count 2604
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2654 transition count 2604
Applied a total of 12 rules in 298 ms. Remains 2654 /2660 variables (removed 6) and now considering 2604/2610 (removed 6) transitions.
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:09:19] [INFO ] Computed 451 place invariants in 15 ms
[2022-05-19 07:09:20] [INFO ] Implicit Places using invariants in 843 ms returned []
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:09:20] [INFO ] Computed 451 place invariants in 7 ms
[2022-05-19 07:09:23] [INFO ] Implicit Places using invariants and state equation in 2756 ms returned []
Implicit Place search using SMT with State Equation took 3602 ms to find 0 implicit places.
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:09:23] [INFO ] Computed 451 place invariants in 14 ms
[2022-05-19 07:09:25] [INFO ] Dead Transitions using invariants and state equation in 1483 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2654/2660 places, 2604/2610 transitions.
Finished structural reductions, in 1 iterations. Remains : 2654/2660 places, 2604/2610 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1178 0), p1:(EQ s715 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][false, false, false, false]]
Product exploration explored 100000 steps with 93 reset in 616 ms.
Product exploration explored 100000 steps with 91 reset in 720 ms.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Detected a total of 600/2654 stabilizing places and 600/2604 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 264 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 1035 steps, including 0 resets, run visited all 2 properties in 22 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 272 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 2654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2654/2654 places, 2604/2604 transitions.
Applied a total of 0 rules in 124 ms. Remains 2654 /2654 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:09:27] [INFO ] Computed 451 place invariants in 15 ms
[2022-05-19 07:09:28] [INFO ] Implicit Places using invariants in 903 ms returned []
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:09:28] [INFO ] Computed 451 place invariants in 7 ms
[2022-05-19 07:09:31] [INFO ] Implicit Places using invariants and state equation in 2860 ms returned []
Implicit Place search using SMT with State Equation took 3766 ms to find 0 implicit places.
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:09:31] [INFO ] Computed 451 place invariants in 16 ms
[2022-05-19 07:09:33] [INFO ] Dead Transitions using invariants and state equation in 1521 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2654/2654 places, 2604/2604 transitions.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Detected a total of 600/2654 stabilizing places and 600/2604 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 218 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 769 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=69 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 100 reset in 652 ms.
Product exploration explored 100000 steps with 102 reset in 745 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 2654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2654/2654 places, 2604/2604 transitions.
Performed 249 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 249 rules applied. Total rules applied 249 place count 2654 transition count 2604
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 102 Pre rules applied. Total rules applied 249 place count 2654 transition count 2608
Deduced a syphon composed of 351 places in 6 ms
Iterating global reduction 1 with 102 rules applied. Total rules applied 351 place count 2654 transition count 2608
Performed 1049 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1400 places in 3 ms
Iterating global reduction 1 with 1049 rules applied. Total rules applied 1400 place count 2654 transition count 2608
Renaming transitions due to excessive name length > 1024 char.
Discarding 349 places :
Symmetric choice reduction at 1 with 349 rule applications. Total rules 1749 place count 2305 transition count 2259
Deduced a syphon composed of 1051 places in 3 ms
Iterating global reduction 1 with 349 rules applied. Total rules applied 2098 place count 2305 transition count 2259
Deduced a syphon composed of 1051 places in 2 ms
Applied a total of 2098 rules in 743 ms. Remains 2305 /2654 variables (removed 349) and now considering 2259/2604 (removed 345) transitions.
[2022-05-19 07:09:36] [INFO ] Redundant transitions in 167 ms returned [2258]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2258 rows 2305 cols
[2022-05-19 07:09:36] [INFO ] Computed 451 place invariants in 24 ms
[2022-05-19 07:09:38] [INFO ] Dead Transitions using invariants and state equation in 1244 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2305/2654 places, 2258/2604 transitions.
Deduced a syphon composed of 1051 places in 2 ms
Applied a total of 0 rules in 95 ms. Remains 2305 /2305 variables (removed 0) and now considering 2258/2258 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2305/2654 places, 2258/2604 transitions.
Product exploration explored 100000 steps with 104 reset in 578 ms.
Product exploration explored 100000 steps with 96 reset in 706 ms.
Built C files in :
/tmp/ltsmin14170126173949556743
[2022-05-19 07:09:39] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14170126173949556743
Running compilation step : cd /tmp/ltsmin14170126173949556743;'/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/ltsmin14170126173949556743;'/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/ltsmin14170126173949556743;'/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 2 out of 2654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2654/2654 places, 2604/2604 transitions.
Applied a total of 0 rules in 127 ms. Remains 2654 /2654 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:09:42] [INFO ] Computed 451 place invariants in 15 ms
[2022-05-19 07:09:43] [INFO ] Implicit Places using invariants in 832 ms returned []
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:09:43] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 07:09:46] [INFO ] Implicit Places using invariants and state equation in 2746 ms returned []
Implicit Place search using SMT with State Equation took 3580 ms to find 0 implicit places.
// Phase 1: matrix 2604 rows 2654 cols
[2022-05-19 07:09:46] [INFO ] Computed 451 place invariants in 13 ms
[2022-05-19 07:09:47] [INFO ] Dead Transitions using invariants and state equation in 1568 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2654/2654 places, 2604/2604 transitions.
Built C files in :
/tmp/ltsmin11500424773854805802
[2022-05-19 07:09:47] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11500424773854805802
Running compilation step : cd /tmp/ltsmin11500424773854805802;'/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/ltsmin11500424773854805802;'/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/ltsmin11500424773854805802;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 07:09:51] [INFO ] Flatten gal took : 71 ms
[2022-05-19 07:09:51] [INFO ] Flatten gal took : 78 ms
[2022-05-19 07:09:51] [INFO ] Time to serialize gal into /tmp/LTL3901561871628672808.gal : 7 ms
[2022-05-19 07:09:51] [INFO ] Time to serialize properties into /tmp/LTL13704991990578029460.ltl : 74 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/LTL3901561871628672808.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13704991990578029460.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/LTL3901561...267
Read 1 LTL properties
Checking formula 0 : !((G((F(X(F("(p1325==0)"))))||(X(X("(p802==1)"))))))
Formula 0 simplified : !G(FXF"(p1325==0)" | XX"(p802==1)")
Detected timeout of ITS tools.
[2022-05-19 07:10:06] [INFO ] Flatten gal took : 65 ms
[2022-05-19 07:10:06] [INFO ] Applying decomposition
[2022-05-19 07:10:06] [INFO ] Flatten gal took : 69 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/graph3369296357630147406.txt' '-o' '/tmp/graph3369296357630147406.bin' '-w' '/tmp/graph3369296357630147406.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3369296357630147406.bin' '-l' '-1' '-v' '-w' '/tmp/graph3369296357630147406.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:10:06] [INFO ] Decomposing Gal with order
[2022-05-19 07:10:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:10:06] [INFO ] Removed a total of 1150 redundant transitions.
[2022-05-19 07:10:06] [INFO ] Flatten gal took : 113 ms
[2022-05-19 07:10:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2022-05-19 07:10:06] [INFO ] Time to serialize gal into /tmp/LTL15202806925315939450.gal : 17 ms
[2022-05-19 07:10:06] [INFO ] Time to serialize properties into /tmp/LTL2765342888407496944.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/LTL15202806925315939450.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2765342888407496944.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/LTL1520280...246
Read 1 LTL properties
Checking formula 0 : !((G((F(X(F("(i21.i2.u442.p1325==0)"))))||(X(X("(i12.i2.u272.p802==1)"))))))
Formula 0 simplified : !G(FXF"(i21.i2.u442.p1325==0)" | XX"(i12.i2.u272.p802==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15829261108587574048
[2022-05-19 07:10:22] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15829261108587574048
Running compilation step : cd /tmp/ltsmin15829261108587574048;'/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/ltsmin15829261108587574048;'/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/ltsmin15829261108587574048;'/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 ShieldIIPs-PT-050B-LTLFireability-08 finished in 65396 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2660/2660 places, 2610/2610 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2659 transition count 2358
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2408 transition count 2358
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2408 transition count 2107
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2157 transition count 2107
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1011 place count 2150 transition count 2100
Iterating global reduction 2 with 7 rules applied. Total rules applied 1018 place count 2150 transition count 2100
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1018 place count 2150 transition count 2096
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1026 place count 2146 transition count 2096
Performed 893 Post agglomeration using F-continuation condition.Transition count delta: 893
Deduced a syphon composed of 893 places in 3 ms
Reduce places removed 893 places and 0 transitions.
Iterating global reduction 2 with 1786 rules applied. Total rules applied 2812 place count 1253 transition count 1203
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2814 place count 1251 transition count 1201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2815 place count 1250 transition count 1201
Applied a total of 2815 rules in 405 ms. Remains 1250 /2660 variables (removed 1410) and now considering 1201/2610 (removed 1409) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 07:10:25] [INFO ] Computed 450 place invariants in 5 ms
[2022-05-19 07:10:25] [INFO ] Implicit Places using invariants in 524 ms returned []
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 07:10:25] [INFO ] Computed 450 place invariants in 3 ms
[2022-05-19 07:10:27] [INFO ] Implicit Places using invariants and state equation in 1286 ms returned []
Implicit Place search using SMT with State Equation took 1815 ms to find 0 implicit places.
[2022-05-19 07:10:27] [INFO ] Redundant transitions in 112 ms returned [1200]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2022-05-19 07:10:27] [INFO ] Computed 450 place invariants in 2 ms
[2022-05-19 07:10:27] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/2660 places, 1200/2610 transitions.
Applied a total of 0 rules in 28 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1250/2660 places, 1200/2610 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s226 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2491 steps with 0 reset in 20 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-10 finished in 3034 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(X(p1))))))'
Support contains 4 out of 2660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2660/2660 places, 2610/2610 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2652 transition count 2602
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2652 transition count 2602
Applied a total of 16 rules in 263 ms. Remains 2652 /2660 variables (removed 8) and now considering 2602/2610 (removed 8) transitions.
// Phase 1: matrix 2602 rows 2652 cols
[2022-05-19 07:10:28] [INFO ] Computed 451 place invariants in 15 ms
[2022-05-19 07:10:29] [INFO ] Implicit Places using invariants in 802 ms returned []
// Phase 1: matrix 2602 rows 2652 cols
[2022-05-19 07:10:29] [INFO ] Computed 451 place invariants in 17 ms
[2022-05-19 07:10:31] [INFO ] Implicit Places using invariants and state equation in 2778 ms returned []
Implicit Place search using SMT with State Equation took 3582 ms to find 0 implicit places.
// Phase 1: matrix 2602 rows 2652 cols
[2022-05-19 07:10:31] [INFO ] Computed 451 place invariants in 14 ms
[2022-05-19 07:10:33] [INFO ] Dead Transitions using invariants and state equation in 1579 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2652/2660 places, 2602/2610 transitions.
Finished structural reductions, in 1 iterations. Remains : 2652/2660 places, 2602/2610 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 1}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s1736 1), p1:(OR (NEQ s2413 1) (NEQ s2423 1) (NEQ s2442 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 37 reset in 823 ms.
Stuttering criterion allowed to conclude after 54502 steps with 19 reset in 531 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-11 finished in 6962 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((p1 U p2))))))'
Support contains 2 out of 2660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2660/2660 places, 2610/2610 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2652 transition count 2602
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2652 transition count 2602
Applied a total of 16 rules in 245 ms. Remains 2652 /2660 variables (removed 8) and now considering 2602/2610 (removed 8) transitions.
// Phase 1: matrix 2602 rows 2652 cols
[2022-05-19 07:10:35] [INFO ] Computed 451 place invariants in 16 ms
[2022-05-19 07:10:36] [INFO ] Implicit Places using invariants in 841 ms returned []
// Phase 1: matrix 2602 rows 2652 cols
[2022-05-19 07:10:36] [INFO ] Computed 451 place invariants in 18 ms
[2022-05-19 07:10:38] [INFO ] Implicit Places using invariants and state equation in 2882 ms returned []
Implicit Place search using SMT with State Equation took 3724 ms to find 0 implicit places.
// Phase 1: matrix 2602 rows 2652 cols
[2022-05-19 07:10:39] [INFO ] Computed 451 place invariants in 16 ms
[2022-05-19 07:10:40] [INFO ] Dead Transitions using invariants and state equation in 1628 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2652/2660 places, 2602/2610 transitions.
Finished structural reductions, in 1 iterations. Remains : 2652/2660 places, 2602/2610 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1922 1), p2:(AND (EQ s1518 1) (EQ s1922 1)), p1:(EQ s1518 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 6351 steps with 0 reset in 60 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-12 finished in 5755 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 2660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2660/2660 places, 2610/2610 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2652 transition count 2602
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2652 transition count 2602
Applied a total of 16 rules in 239 ms. Remains 2652 /2660 variables (removed 8) and now considering 2602/2610 (removed 8) transitions.
// Phase 1: matrix 2602 rows 2652 cols
[2022-05-19 07:10:41] [INFO ] Computed 451 place invariants in 16 ms
[2022-05-19 07:10:41] [INFO ] Implicit Places using invariants in 913 ms returned []
// Phase 1: matrix 2602 rows 2652 cols
[2022-05-19 07:10:41] [INFO ] Computed 451 place invariants in 7 ms
[2022-05-19 07:10:44] [INFO ] Implicit Places using invariants and state equation in 2930 ms returned []
Implicit Place search using SMT with State Equation took 3846 ms to find 0 implicit places.
// Phase 1: matrix 2602 rows 2652 cols
[2022-05-19 07:10:44] [INFO ] Computed 451 place invariants in 11 ms
[2022-05-19 07:10:46] [INFO ] Dead Transitions using invariants and state equation in 1604 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2652/2660 places, 2602/2610 transitions.
Finished structural reductions, in 1 iterations. Remains : 2652/2660 places, 2602/2610 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s906 1) (NEQ s974 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3917 steps with 0 reset in 31 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-13 finished in 5851 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((G(p0) U p1)&&(p2 U p0))))))'
Support contains 6 out of 2660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2660/2660 places, 2610/2610 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2652 transition count 2602
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2652 transition count 2602
Applied a total of 16 rules in 263 ms. Remains 2652 /2660 variables (removed 8) and now considering 2602/2610 (removed 8) transitions.
// Phase 1: matrix 2602 rows 2652 cols
[2022-05-19 07:10:46] [INFO ] Computed 451 place invariants in 14 ms
[2022-05-19 07:10:47] [INFO ] Implicit Places using invariants in 827 ms returned []
// Phase 1: matrix 2602 rows 2652 cols
[2022-05-19 07:10:47] [INFO ] Computed 451 place invariants in 12 ms
[2022-05-19 07:10:50] [INFO ] Implicit Places using invariants and state equation in 2868 ms returned []
Implicit Place search using SMT with State Equation took 3696 ms to find 0 implicit places.
// Phase 1: matrix 2602 rows 2652 cols
[2022-05-19 07:10:50] [INFO ] Computed 451 place invariants in 17 ms
[2022-05-19 07:10:52] [INFO ] Dead Transitions using invariants and state equation in 1529 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2652/2660 places, 2602/2610 transitions.
Finished structural reductions, in 1 iterations. Remains : 2652/2660 places, 2602/2610 transitions.
Stuttering acceptance computed with spot in 319 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 6}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 6}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 5}]], initial=7, aps=[p0:(EQ s1824 1), p2:(OR (AND (EQ s281 1) (EQ s289 1) (EQ s311 1)) (EQ s1824 1)), p1:(AND (EQ s1259 1) (EQ s1283 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-15 finished in 5840 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((X(p0)||F(p1))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)&&F(p1))) U (X((G(p3)&&p2))||F(p4))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(F(p0)))||X(X(p1)))))'
Found a SL insensitive property : ShieldIIPs-PT-050B-LTLFireability-08
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 2660 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2660/2660 places, 2610/2610 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 2659 transition count 2359
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 1 with 250 rules applied. Total rules applied 500 place count 2409 transition count 2359
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 500 place count 2409 transition count 2108
Deduced a syphon composed of 251 places in 6 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1002 place count 2158 transition count 2108
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1008 place count 2152 transition count 2102
Iterating global reduction 2 with 6 rules applied. Total rules applied 1014 place count 2152 transition count 2102
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1014 place count 2152 transition count 2099
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1020 place count 2149 transition count 2099
Performed 894 Post agglomeration using F-continuation condition.Transition count delta: 894
Deduced a syphon composed of 894 places in 3 ms
Reduce places removed 894 places and 0 transitions.
Iterating global reduction 2 with 1788 rules applied. Total rules applied 2808 place count 1255 transition count 1205
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2810 place count 1253 transition count 1203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2811 place count 1252 transition count 1203
Applied a total of 2811 rules in 415 ms. Remains 1252 /2660 variables (removed 1408) and now considering 1203/2610 (removed 1407) transitions.
// Phase 1: matrix 1203 rows 1252 cols
[2022-05-19 07:10:53] [INFO ] Computed 450 place invariants in 3 ms
[2022-05-19 07:10:53] [INFO ] Implicit Places using invariants in 558 ms returned []
// Phase 1: matrix 1203 rows 1252 cols
[2022-05-19 07:10:53] [INFO ] Computed 450 place invariants in 4 ms
[2022-05-19 07:10:55] [INFO ] Implicit Places using invariants and state equation in 1271 ms returned []
Implicit Place search using SMT with State Equation took 1831 ms to find 0 implicit places.
// Phase 1: matrix 1203 rows 1252 cols
[2022-05-19 07:10:55] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-19 07:10:55] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1252/2660 places, 1203/2610 transitions.
Finished structural reductions, in 1 iterations. Remains : 1252/2660 places, 1203/2610 transitions.
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s544 0), p1:(EQ s321 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 154 reset in 831 ms.
Product exploration explored 100000 steps with 132 reset in 1006 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1252 stabilizing places and 2/1203 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 260 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 (NOT p1)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 251 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 1252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1252/1252 places, 1203/1203 transitions.
Applied a total of 0 rules in 25 ms. Remains 1252 /1252 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1252 cols
[2022-05-19 07:10:58] [INFO ] Computed 450 place invariants in 5 ms
[2022-05-19 07:10:59] [INFO ] Implicit Places using invariants in 564 ms returned []
// Phase 1: matrix 1203 rows 1252 cols
[2022-05-19 07:10:59] [INFO ] Computed 450 place invariants in 2 ms
[2022-05-19 07:11:00] [INFO ] Implicit Places using invariants and state equation in 1315 ms returned []
Implicit Place search using SMT with State Equation took 1880 ms to find 0 implicit places.
// Phase 1: matrix 1203 rows 1252 cols
[2022-05-19 07:11:00] [INFO ] Computed 450 place invariants in 1 ms
[2022-05-19 07:11:01] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1252/1252 places, 1203/1203 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1252 stabilizing places and 2/1203 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 248 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 (NOT p1)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 307 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 146 reset in 919 ms.
Product exploration explored 100000 steps with 154 reset in 1098 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 1252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1252/1252 places, 1203/1203 transitions.
Applied a total of 0 rules in 50 ms. Remains 1252 /1252 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2022-05-19 07:11:04] [INFO ] Redundant transitions in 203 ms returned [1202]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1202 rows 1252 cols
[2022-05-19 07:11:04] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-19 07:11:05] [INFO ] Dead Transitions using invariants and state equation in 1155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1252/1252 places, 1202/1203 transitions.
Applied a total of 0 rules in 29 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1252/1252 places, 1202/1203 transitions.
Product exploration explored 100000 steps with 104 reset in 903 ms.
Product exploration explored 100000 steps with 122 reset in 1127 ms.
Built C files in :
/tmp/ltsmin4900336535894367803
[2022-05-19 07:11:07] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4900336535894367803
Running compilation step : cd /tmp/ltsmin4900336535894367803;'/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 2339 ms.
Running link step : cd /tmp/ltsmin4900336535894367803;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4900336535894367803;'/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/stateBased18328465441405779520.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1252/1252 places, 1203/1203 transitions.
Applied a total of 0 rules in 27 ms. Remains 1252 /1252 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1252 cols
[2022-05-19 07:11:22] [INFO ] Computed 450 place invariants in 5 ms
[2022-05-19 07:11:23] [INFO ] Implicit Places using invariants in 559 ms returned []
// Phase 1: matrix 1203 rows 1252 cols
[2022-05-19 07:11:23] [INFO ] Computed 450 place invariants in 2 ms
[2022-05-19 07:11:24] [INFO ] Implicit Places using invariants and state equation in 1296 ms returned []
Implicit Place search using SMT with State Equation took 1860 ms to find 0 implicit places.
// Phase 1: matrix 1203 rows 1252 cols
[2022-05-19 07:11:24] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-19 07:11:25] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1252/1252 places, 1203/1203 transitions.
Built C files in :
/tmp/ltsmin16744096397956877625
[2022-05-19 07:11:25] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16744096397956877625
Running compilation step : cd /tmp/ltsmin16744096397956877625;'/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 2393 ms.
Running link step : cd /tmp/ltsmin16744096397956877625;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16744096397956877625;'/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/stateBased1384700309356190136.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 07:11:40] [INFO ] Flatten gal took : 42 ms
[2022-05-19 07:11:40] [INFO ] Flatten gal took : 41 ms
[2022-05-19 07:11:40] [INFO ] Time to serialize gal into /tmp/LTL4580928640173753751.gal : 4 ms
[2022-05-19 07:11:40] [INFO ] Time to serialize properties into /tmp/LTL8793168909226783696.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/LTL4580928640173753751.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8793168909226783696.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/LTL4580928...266
Read 1 LTL properties
Checking formula 0 : !((G((F(X(F("(p1325==0)"))))||(X(X("(p802==1)"))))))
Formula 0 simplified : !G(FXF"(p1325==0)" | XX"(p802==1)")
Detected timeout of ITS tools.
[2022-05-19 07:11:55] [INFO ] Flatten gal took : 44 ms
[2022-05-19 07:11:55] [INFO ] Applying decomposition
[2022-05-19 07:11:55] [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/graph11399568492169277535.txt' '-o' '/tmp/graph11399568492169277535.bin' '-w' '/tmp/graph11399568492169277535.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11399568492169277535.bin' '-l' '-1' '-v' '-w' '/tmp/graph11399568492169277535.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:11:55] [INFO ] Decomposing Gal with order
[2022-05-19 07:11:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:11:55] [INFO ] Removed a total of 799 redundant transitions.
[2022-05-19 07:11:55] [INFO ] Flatten gal took : 61 ms
[2022-05-19 07:11:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 596 labels/synchronizations in 6 ms.
[2022-05-19 07:11:56] [INFO ] Time to serialize gal into /tmp/LTL12064631434842935913.gal : 5 ms
[2022-05-19 07:11:56] [INFO ] Time to serialize properties into /tmp/LTL7066928097121636198.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/LTL12064631434842935913.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7066928097121636198.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/LTL1206463...246
Read 1 LTL properties
Checking formula 0 : !((G((F(X(F("(i12.u195.p1325==0)"))))||(X(X("(i7.u116.p802==1)"))))))
Formula 0 simplified : !G(FXF"(i12.u195.p1325==0)" | XX"(i7.u116.p802==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12650532917557260669
[2022-05-19 07:12:11] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12650532917557260669
Running compilation step : cd /tmp/ltsmin12650532917557260669;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2210 ms.
Running link step : cd /tmp/ltsmin12650532917557260669;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12650532917557260669;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>(X(<>((LTLAPp0==true))))||X(X((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-050B-LTLFireability-08 finished in 93484 ms.
[2022-05-19 07:12:26] [INFO ] Flatten gal took : 86 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12629520291701969720
[2022-05-19 07:12:26] [INFO ] Too many transitions (2610) to apply POR reductions. Disabling POR matrices.
[2022-05-19 07:12:26] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12629520291701969720
Running compilation step : cd /tmp/ltsmin12629520291701969720;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 07:12:26] [INFO ] Applying decomposition
[2022-05-19 07:12:26] [INFO ] Flatten gal took : 68 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/graph6818072012727548598.txt' '-o' '/tmp/graph6818072012727548598.bin' '-w' '/tmp/graph6818072012727548598.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6818072012727548598.bin' '-l' '-1' '-v' '-w' '/tmp/graph6818072012727548598.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:12:26] [INFO ] Decomposing Gal with order
[2022-05-19 07:12:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:12:26] [INFO ] Removed a total of 1150 redundant transitions.
[2022-05-19 07:12:26] [INFO ] Flatten gal took : 117 ms
[2022-05-19 07:12:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2022-05-19 07:12:26] [INFO ] Time to serialize gal into /tmp/LTLFireability10467712656558975822.gal : 19 ms
[2022-05-19 07:12:26] [INFO ] Time to serialize properties into /tmp/LTLFireability1214779421138705582.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/LTLFireability10467712656558975822.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1214779421138705582.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 3 LTL properties
Checking formula 0 : !((F(G(F((X("((i1.i2.u27.p68==1)&&(i1.i2.u28.p70==1))"))||(F("(((i49.i0.u986.p2964==1)&&(i49.i0.u988.p2972==1))&&(i49.i0.u995.p2999==1...165
Formula 0 simplified : !FGF(X"((i1.i2.u27.p68==1)&&(i1.i2.u28.p70==1))" | F"(((i49.i0.u986.p2964==1)&&(i49.i0.u988.p2972==1))&&(i49.i0.u995.p2999==1))")
Compilation finished in 5890 ms.
Running link step : cd /tmp/ltsmin12629520291701969720;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin12629520291701969720;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](<>((X((LTLAPp0==true))||<>((LTLAPp1==true))))))' '--buchi-type=spotba'
LTSmin run took 22015 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin12629520291701969720;'/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' '(<>(([]((LTLAPp2==true))&&<>((LTLAPp3==true)))) U (X(([]((LTLAPp5==true))&&(LTLAPp4==true)))||<>((LTLAPp6==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin12629520291701969720;'/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' '(<>(([]((LTLAPp2==true))&&<>((LTLAPp3==true)))) U (X(([]((LTLAPp5==true))&&(LTLAPp4==true)))||<>((LTLAPp6==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12629520291701969720;'/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(<>((LTLAPp7==true))))||X(X((LTLAPp8==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 07:36:25] [INFO ] Applying decomposition
[2022-05-19 07:36:25] [INFO ] Flatten gal took : 286 ms
[2022-05-19 07:36:26] [INFO ] Decomposing Gal with order
[2022-05-19 07:36:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:36:30] [INFO ] Removed a total of 800 redundant transitions.
[2022-05-19 07:36:31] [INFO ] Flatten gal took : 1472 ms
[2022-05-19 07:36:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 1000 labels/synchronizations in 78 ms.
[2022-05-19 07:36:33] [INFO ] Time to serialize gal into /tmp/LTLFireability12456196620545276450.gal : 40 ms
[2022-05-19 07:36:33] [INFO ] Time to serialize properties into /tmp/LTLFireability3906546877018364672.ltl : 16 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/LTLFireability12456196620545276450.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3906546877018364672.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 2 LTL properties
Checking formula 0 : !(((F((G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u1134.p939==1)"))&...1185
Formula 0 simplified : !(F(G"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u1134.p939==1)" & F"...1165
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin12629520291701969720;'/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(<>((LTLAPp7==true))))||X(X((LTLAPp8==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin12629520291701969720;'/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' '(<>(([]((LTLAPp2==true))&&<>((LTLAPp3==true)))) U (X(([]((LTLAPp5==true))&&(LTLAPp4==true)))||<>((LTLAPp6==true))))' '--buchi-type=spotba'

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="ShieldIIPs-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 ShieldIIPs-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-165286024800156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-050B.tgz
mv ShieldIIPs-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 ;