Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r102-smll-162075331200140.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 FlexibleBarrier-PT-20b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331200140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 114K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 11:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 11:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 19:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 19:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.5M May 5 16:51 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 FlexibleBarrier-PT-20b-00
FORMULA_NAME FlexibleBarrier-PT-20b-01
FORMULA_NAME FlexibleBarrier-PT-20b-02
FORMULA_NAME FlexibleBarrier-PT-20b-03
FORMULA_NAME FlexibleBarrier-PT-20b-04
FORMULA_NAME FlexibleBarrier-PT-20b-05
FORMULA_NAME FlexibleBarrier-PT-20b-06
FORMULA_NAME FlexibleBarrier-PT-20b-07
FORMULA_NAME FlexibleBarrier-PT-20b-08
FORMULA_NAME FlexibleBarrier-PT-20b-09
FORMULA_NAME FlexibleBarrier-PT-20b-10
FORMULA_NAME FlexibleBarrier-PT-20b-11
FORMULA_NAME FlexibleBarrier-PT-20b-12
FORMULA_NAME FlexibleBarrier-PT-20b-13
FORMULA_NAME FlexibleBarrier-PT-20b-14
FORMULA_NAME FlexibleBarrier-PT-20b-15

=== Now, execution of the tool begins

BK_START 1621178172644

Running Version 0
[2021-05-16 15:16:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 15:16:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 15:16:15] [INFO ] Load time of PNML (sax parser for PT used): 476 ms
[2021-05-16 15:16:16] [INFO ] Transformed 5372 places.
[2021-05-16 15:16:16] [INFO ] Transformed 6193 transitions.
[2021-05-16 15:16:16] [INFO ] Found NUPN structural information;
[2021-05-16 15:16:16] [INFO ] Parsed PT model containing 5372 places and 6193 transitions in 603 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 15:16:16] [INFO ] Initial state test concluded for 2 properties.
FORMULA FlexibleBarrier-PT-20b-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 5372 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Discarding 2251 places :
Symmetric choice reduction at 0 with 2251 rule applications. Total rules 2251 place count 3121 transition count 3942
Iterating global reduction 0 with 2251 rules applied. Total rules applied 4502 place count 3121 transition count 3942
Discarding 1069 places :
Symmetric choice reduction at 0 with 1069 rule applications. Total rules 5571 place count 2052 transition count 2873
Iterating global reduction 0 with 1069 rules applied. Total rules applied 6640 place count 2052 transition count 2873
Discarding 683 places :
Symmetric choice reduction at 0 with 683 rule applications. Total rules 7323 place count 1369 transition count 2190
Iterating global reduction 0 with 683 rules applied. Total rules applied 8006 place count 1369 transition count 2190
Ensure Unique test removed 331 transitions
Reduce isomorphic transitions removed 331 transitions.
Iterating post reduction 0 with 331 rules applied. Total rules applied 8337 place count 1369 transition count 1859
Applied a total of 8337 rules in 1917 ms. Remains 1369 /5372 variables (removed 4003) and now considering 1859/6193 (removed 4334) transitions.
// Phase 1: matrix 1859 rows 1369 cols
[2021-05-16 15:16:18] [INFO ] Computed 22 place invariants in 89 ms
[2021-05-16 15:16:19] [INFO ] Implicit Places using invariants in 1565 ms returned []
// Phase 1: matrix 1859 rows 1369 cols
[2021-05-16 15:16:19] [INFO ] Computed 22 place invariants in 54 ms
[2021-05-16 15:16:22] [INFO ] Implicit Places using invariants and state equation in 2504 ms returned []
Implicit Place search using SMT with State Equation took 4114 ms to find 0 implicit places.
// Phase 1: matrix 1859 rows 1369 cols
[2021-05-16 15:16:22] [INFO ] Computed 22 place invariants in 36 ms
[2021-05-16 15:16:23] [INFO ] Dead Transitions using invariants and state equation in 1446 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1369/5372 places, 1859/6193 transitions.
[2021-05-16 15:16:24] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-16 15:16:24] [INFO ] Flatten gal took : 249 ms
FORMULA FlexibleBarrier-PT-20b-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 15:16:24] [INFO ] Flatten gal took : 138 ms
[2021-05-16 15:16:24] [INFO ] Input system was already deterministic with 1859 transitions.
Incomplete random walk after 100000 steps, including 736 resets, run finished after 547 ms. (steps per millisecond=182 ) properties (out of 26) seen :9
Running SMT prover for 17 properties.
// Phase 1: matrix 1859 rows 1369 cols
[2021-05-16 15:16:25] [INFO ] Computed 22 place invariants in 32 ms
[2021-05-16 15:16:25] [INFO ] [Real]Absence check using 22 positive place invariants in 34 ms returned sat
[2021-05-16 15:16:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:16:26] [INFO ] [Real]Absence check using state equation in 912 ms returned sat
[2021-05-16 15:16:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:16:27] [INFO ] [Nat]Absence check using 22 positive place invariants in 31 ms returned sat
[2021-05-16 15:16:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:16:28] [INFO ] [Nat]Absence check using state equation in 887 ms returned sat
[2021-05-16 15:16:28] [INFO ] Computed and/alt/rep : 1814/4126/1814 causal constraints (skipped 44 transitions) in 214 ms.
[2021-05-16 15:16:47] [INFO ] Deduced a trap composed of 7 places in 1047 ms of which 7 ms to minimize.
[2021-05-16 15:16:47] [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 at index 0
[2021-05-16 15:16:48] [INFO ] [Real]Absence check using 22 positive place invariants in 30 ms returned sat
[2021-05-16 15:16:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:16:48] [INFO ] [Real]Absence check using state equation in 800 ms returned sat
[2021-05-16 15:16:49] [INFO ] Computed and/alt/rep : 1814/4126/1814 causal constraints (skipped 44 transitions) in 260 ms.
[2021-05-16 15:16:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:16:50] [INFO ] [Nat]Absence check using 22 positive place invariants in 30 ms returned sat
[2021-05-16 15:16:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:16:50] [INFO ] [Nat]Absence check using state equation in 753 ms returned sat
[2021-05-16 15:16:51] [INFO ] Computed and/alt/rep : 1814/4126/1814 causal constraints (skipped 44 transitions) in 476 ms.
[2021-05-16 15:17:10] [INFO ] Deduced a trap composed of 7 places in 1122 ms of which 4 ms to minimize.
[2021-05-16 15:17:10] [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 at index 1
[2021-05-16 15:17:11] [INFO ] [Real]Absence check using 22 positive place invariants in 44 ms returned sat
[2021-05-16 15:17:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:17:12] [INFO ] [Real]Absence check using state equation in 1067 ms returned sat
[2021-05-16 15:17:12] [INFO ] Deduced a trap composed of 61 places in 165 ms of which 2 ms to minimize.
[2021-05-16 15:17:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2021-05-16 15:17:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:17:13] [INFO ] [Nat]Absence check using 22 positive place invariants in 31 ms returned sat
[2021-05-16 15:17:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:17:13] [INFO ] [Nat]Absence check using state equation in 847 ms returned sat
[2021-05-16 15:17:14] [INFO ] Deduced a trap composed of 61 places in 193 ms of which 3 ms to minimize.
[2021-05-16 15:17:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
[2021-05-16 15:17:14] [INFO ] Computed and/alt/rep : 1814/4126/1814 causal constraints (skipped 44 transitions) in 212 ms.
[2021-05-16 15:17:32] [INFO ] Added : 665 causal constraints over 133 iterations in 18508 ms. Result :unknown
[2021-05-16 15:17:32] [INFO ] [Real]Absence check using 22 positive place invariants in 29 ms returned sat
[2021-05-16 15:17:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:17:33] [INFO ] [Real]Absence check using state equation in 787 ms returned sat
[2021-05-16 15:17:34] [INFO ] Deduced a trap composed of 83 places in 298 ms of which 3 ms to minimize.
[2021-05-16 15:17:34] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 1 ms to minimize.
[2021-05-16 15:17:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 731 ms
[2021-05-16 15:17:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:17:34] [INFO ] [Nat]Absence check using 22 positive place invariants in 30 ms returned sat
[2021-05-16 15:17:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:17:35] [INFO ] [Nat]Absence check using state equation in 913 ms returned sat
[2021-05-16 15:17:36] [INFO ] Deduced a trap composed of 83 places in 387 ms of which 1 ms to minimize.
[2021-05-16 15:17:36] [INFO ] Deduced a trap composed of 164 places in 374 ms of which 2 ms to minimize.
[2021-05-16 15:17:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1017 ms
[2021-05-16 15:17:36] [INFO ] Computed and/alt/rep : 1814/4126/1814 causal constraints (skipped 44 transitions) in 116 ms.
[2021-05-16 15:17:54] [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 at index 3
[2021-05-16 15:17:54] [INFO ] [Real]Absence check using 22 positive place invariants in 41 ms returned sat
[2021-05-16 15:17:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:17:55] [INFO ] [Real]Absence check using state equation in 973 ms returned sat
[2021-05-16 15:17:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:17:56] [INFO ] [Nat]Absence check using 22 positive place invariants in 27 ms returned sat
[2021-05-16 15:17:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:17:56] [INFO ] [Nat]Absence check using state equation in 755 ms returned sat
[2021-05-16 15:17:57] [INFO ] Deduced a trap composed of 164 places in 883 ms of which 1 ms to minimize.
[2021-05-16 15:17:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1052 ms
[2021-05-16 15:17:58] [INFO ] Computed and/alt/rep : 1814/4126/1814 causal constraints (skipped 44 transitions) in 104 ms.
3timeout
^^^^^^^^
(error "Invalid token: 3timeout")
[2021-05-16 15:18:17] [INFO ] Deduced a trap composed of 7 places in 1186 ms of which 1 ms to minimize.
[2021-05-16 15:18:17] [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 at index 4
[2021-05-16 15:18:17] [INFO ] [Real]Absence check using 22 positive place invariants in 33 ms returned sat
[2021-05-16 15:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:18:18] [INFO ] [Real]Absence check using state equation in 847 ms returned sat
[2021-05-16 15:18:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:18:18] [INFO ] [Nat]Absence check using 22 positive place invariants in 29 ms returned sat
[2021-05-16 15:18:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:18:19] [INFO ] [Nat]Absence check using state equation in 785 ms returned sat
[2021-05-16 15:18:19] [INFO ] Computed and/alt/rep : 1814/4126/1814 causal constraints (skipped 44 transitions) in 120 ms.
[2021-05-16 15:18:36] [INFO ] Added : 742 causal constraints over 149 iterations in 16966 ms. Result :sat
[2021-05-16 15:18:36] [INFO ] [Real]Absence check using 22 positive place invariants in 44 ms returned sat
[2021-05-16 15:18:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:18:37] [INFO ] [Real]Absence check using state equation in 882 ms returned sat
[2021-05-16 15:18:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:18:37] [INFO ] [Nat]Absence check using 22 positive place invariants in 28 ms returned sat
[2021-05-16 15:18:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:18:38] [INFO ] [Nat]Absence check using state equation in 786 ms returned sat
[2021-05-16 15:18:38] [INFO ] Computed and/alt/rep : 1814/4126/1814 causal constraints (skipped 44 transitions) in 123 ms.
[2021-05-16 15:18:58] [INFO ] Deduced a trap composed of 7 places in 1046 ms of which 2 ms to minimize.
[2021-05-16 15:18:58] [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 at index 6
[2021-05-16 15:18:58] [INFO ] [Real]Absence check using 22 positive place invariants in 29 ms returned sat
[2021-05-16 15:18:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:18:59] [INFO ] [Real]Absence check using state equation in 879 ms returned sat
[2021-05-16 15:18:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:19:00] [INFO ] [Nat]Absence check using 22 positive place invariants in 29 ms returned sat
[2021-05-16 15:19:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:19:01] [INFO ] [Nat]Absence check using state equation in 916 ms returned sat
[2021-05-16 15:19:01] [INFO ] Computed and/alt/rep : 1814/4126/1814 causal constraints (skipped 44 transitions) in 172 ms.
[2021-05-16 15:19:21] [INFO ] Deduced a trap composed of 7 places in 1252 ms of which 2 ms to minimize.
[2021-05-16 15:19:21] [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 at index 7
[2021-05-16 15:19:21] [INFO ] [Real]Absence check using 22 positive place invariants in 29 ms returned sat
[2021-05-16 15:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:19:22] [INFO ] [Real]Absence check using state equation in 1013 ms returned sat
[2021-05-16 15:19:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:19:22] [INFO ] [Nat]Absence check using 22 positive place invariants in 29 ms returned sat
[2021-05-16 15:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:19:23] [INFO ] [Nat]Absence check using state equation in 936 ms returned sat
[2021-05-16 15:19:23] [INFO ] Computed and/alt/rep : 1814/4126/1814 causal constraints (skipped 44 transitions) in 192 ms.
[2021-05-16 15:19:41] [INFO ] Added : 750 causal constraints over 150 iterations in 17751 ms. Result :sat
[2021-05-16 15:19:41] [INFO ] [Real]Absence check using 22 positive place invariants in 42 ms returned sat
[2021-05-16 15:19:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:19:42] [INFO ] [Real]Absence check using state equation in 909 ms returned sat
[2021-05-16 15:19:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:19:43] [INFO ] [Nat]Absence check using 22 positive place invariants in 29 ms returned sat
[2021-05-16 15:19:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:19:43] [INFO ] [Nat]Absence check using state equation in 937 ms returned sat
[2021-05-16 15:19:44] [INFO ] Deduced a trap composed of 180 places in 182 ms of which 1 ms to minimize.
[2021-05-16 15:19:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 371 ms
[2021-05-16 15:19:44] [INFO ] Computed and/alt/rep : 1814/4126/1814 causal constraints (skipped 44 transitions) in 202 ms.
[2021-05-16 15:20:04] [INFO ] Deduced a trap composed of 7 places in 1242 ms of which 2 ms to minimize.
[2021-05-16 15:20:04] [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 at index 9
[2021-05-16 15:20:04] [INFO ] [Real]Absence check using 22 positive place invariants in 39 ms returned sat
[2021-05-16 15:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:20:05] [INFO ] [Real]Absence check using state equation in 841 ms returned sat
[2021-05-16 15:20:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:20:05] [INFO ] [Nat]Absence check using 22 positive place invariants in 27 ms returned sat
[2021-05-16 15:20:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:20:06] [INFO ] [Nat]Absence check using state equation in 779 ms returned sat
[2021-05-16 15:20:07] [INFO ] Deduced a trap composed of 178 places in 1016 ms of which 1 ms to minimize.
[2021-05-16 15:20:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1208 ms
[2021-05-16 15:20:07] [INFO ] Computed and/alt/rep : 1814/4126/1814 causal constraints (skipped 44 transitions) in 162 ms.
[2021-05-16 15:20:25] [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 at index 10
[2021-05-16 15:20:25] [INFO ] [Real]Absence check using 22 positive place invariants in 28 ms returned sat
[2021-05-16 15:20:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:20:26] [INFO ] [Real]Absence check using state equation in 828 ms returned sat
[2021-05-16 15:20:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:20:26] [INFO ] [Nat]Absence check using 22 positive place invariants in 29 ms returned sat
[2021-05-16 15:20:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:20:27] [INFO ] [Nat]Absence check using state equation in 836 ms returned sat
[2021-05-16 15:20:27] [INFO ] Computed and/alt/rep : 1814/4126/1814 causal constraints (skipped 44 transitions) in 154 ms.
[2021-05-16 15:20:45] [INFO ] Added : 753 causal constraints over 151 iterations in 18506 ms. Result :sat
[2021-05-16 15:20:46] [INFO ] [Real]Absence check using 22 positive place invariants in 43 ms returned sat
[2021-05-16 15:20:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:20:47] [INFO ] [Real]Absence check using state equation in 840 ms returned sat
[2021-05-16 15:20:47] [INFO ] Computed and/alt/rep : 1814/4126/1814 causal constraints (skipped 44 transitions) in 152 ms.
[2021-05-16 15:20:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:20:47] [INFO ] [Nat]Absence check using 22 positive place invariants in 29 ms returned sat
[2021-05-16 15:20:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:20:48] [INFO ] [Nat]Absence check using state equation in 771 ms returned sat
[2021-05-16 15:20:48] [INFO ] Computed and/alt/rep : 1814/4126/1814 causal constraints (skipped 44 transitions) in 118 ms.
[2021-05-16 15:21:04] [INFO ] Added : 682 causal constraints over 137 iterations in 15921 ms. Result :sat
[2021-05-16 15:21:04] [INFO ] [Real]Absence check using 22 positive place invariants in 42 ms returned sat
[2021-05-16 15:21:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:21:05] [INFO ] [Real]Absence check using state equation in 788 ms returned sat
[2021-05-16 15:21:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:21:06] [INFO ] [Nat]Absence check using 22 positive place invariants in 28 ms returned sat
[2021-05-16 15:21:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:21:06] [INFO ] [Nat]Absence check using state equation in 967 ms returned sat
[2021-05-16 15:21:07] [INFO ] Computed and/alt/rep : 1814/4126/1814 causal constraints (skipped 44 transitions) in 131 ms.
[2021-05-16 15:21:24] [INFO ] Added : 744 causal constraints over 149 iterations in 17092 ms. Result :sat
[2021-05-16 15:21:24] [INFO ] [Real]Absence check using 22 positive place invariants in 46 ms returned sat
[2021-05-16 15:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:21:25] [INFO ] [Real]Absence check using state equation in 987 ms returned sat
[2021-05-16 15:21:25] [INFO ] Computed and/alt/rep : 1814/4126/1814 causal constraints (skipped 44 transitions) in 122 ms.
[2021-05-16 15:21:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:21:26] [INFO ] [Nat]Absence check using 22 positive place invariants in 31 ms returned sat
[2021-05-16 15:21:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:21:27] [INFO ] [Nat]Absence check using state equation in 910 ms returned sat
[2021-05-16 15:21:27] [INFO ] Computed and/alt/rep : 1814/4126/1814 causal constraints (skipped 44 transitions) in 170 ms.
[2021-05-16 15:21:46] [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: Broken pipe ... while checking expression at index 14
[2021-05-16 15:21:46] [INFO ] [Real]Absence check using 22 positive place invariants in 30 ms returned sat
[2021-05-16 15:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:21:47] [INFO ] [Real]Absence check using state equation in 919 ms returned sat
[2021-05-16 15:21:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:21:47] [INFO ] [Nat]Absence check using 22 positive place invariants in 29 ms returned sat
[2021-05-16 15:21:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:21:48] [INFO ] [Nat]Absence check using state equation in 896 ms returned sat
[2021-05-16 15:21:48] [INFO ] Computed and/alt/rep : 1814/4126/1814 causal constraints (skipped 44 transitions) in 176 ms.
[2021-05-16 15:22:08] [INFO ] Deduced a trap composed of 7 places in 1336 ms of which 2 ms to minimize.
[2021-05-16 15:22:08] [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 at index 15
[2021-05-16 15:22:09] [INFO ] [Real]Absence check using 22 positive place invariants in 29 ms returned sat
[2021-05-16 15:22:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:22:09] [INFO ] [Real]Absence check using state equation in 902 ms returned sat
[2021-05-16 15:22:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:22:10] [INFO ] [Nat]Absence check using 22 positive place invariants in 33 ms returned sat
[2021-05-16 15:22:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:22:11] [INFO ] [Nat]Absence check using state equation in 741 ms returned sat
[2021-05-16 15:22:11] [INFO ] Computed and/alt/rep : 1814/4126/1814 causal constraints (skipped 44 transitions) in 117 ms.
[2021-05-16 15:22:31] [INFO ] Deduced a trap composed of 7 places in 974 ms of which 2 ms to minimize.
[2021-05-16 15:22:31] [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 at index 16
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1369 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1369/1369 places, 1859/1859 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 1329 transition count 1819
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 1329 transition count 1819
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 87 place count 1329 transition count 1812
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 118 place count 1298 transition count 1781
Iterating global reduction 1 with 31 rules applied. Total rules applied 149 place count 1298 transition count 1781
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 167 place count 1298 transition count 1763
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 174 place count 1291 transition count 1756
Iterating global reduction 2 with 7 rules applied. Total rules applied 181 place count 1291 transition count 1756
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 185 place count 1291 transition count 1752
Applied a total of 185 rules in 276 ms. Remains 1291 /1369 variables (removed 78) and now considering 1752/1859 (removed 107) transitions.
// Phase 1: matrix 1752 rows 1291 cols
[2021-05-16 15:22:31] [INFO ] Computed 22 place invariants in 63 ms
[2021-05-16 15:22:32] [INFO ] Implicit Places using invariants in 1267 ms returned []
// Phase 1: matrix 1752 rows 1291 cols
[2021-05-16 15:22:32] [INFO ] Computed 22 place invariants in 29 ms
[2021-05-16 15:22:35] [INFO ] Implicit Places using invariants and state equation in 2507 ms returned []
Implicit Place search using SMT with State Equation took 3776 ms to find 0 implicit places.
// Phase 1: matrix 1752 rows 1291 cols
[2021-05-16 15:22:35] [INFO ] Computed 22 place invariants in 29 ms
[2021-05-16 15:22:37] [INFO ] Dead Transitions using invariants and state equation in 1981 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1291/1369 places, 1752/1859 transitions.
Stuttering acceptance computed with spot in 291 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-00 automaton TGBA [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 s1077 1), p0:(OR (EQ s1175 0) (EQ s783 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 732 reset in 664 ms.
Product exploration explored 100000 steps with 736 reset in 522 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 193 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 732 reset in 462 ms.
Product exploration explored 100000 steps with 737 reset in 420 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 180 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 1291 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1291/1291 places, 1752/1752 transitions.
Graph (trivial) has 1225 edges and 1291 vertex of which 121 / 1291 are part of one of the 20 SCC in 11 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 1190 transition count 1650
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 61 Pre rules applied. Total rules applied 79 place count 1190 transition count 2170
Deduced a syphon composed of 139 places in 2 ms
Iterating global reduction 1 with 61 rules applied. Total rules applied 140 place count 1190 transition count 2170
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 234 place count 1096 transition count 2076
Deduced a syphon composed of 83 places in 2 ms
Iterating global reduction 1 with 94 rules applied. Total rules applied 328 place count 1096 transition count 2076
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 167 places in 1 ms
Iterating global reduction 1 with 84 rules applied. Total rules applied 412 place count 1096 transition count 2096
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 454 place count 1054 transition count 2054
Deduced a syphon composed of 125 places in 2 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 496 place count 1054 transition count 2054
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -120
Deduced a syphon composed of 165 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 536 place count 1054 transition count 2174
Deduced a syphon composed of 165 places in 1 ms
Drop transitions removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 1 with 80 rules applied. Total rules applied 616 place count 1054 transition count 2094
Deduced a syphon composed of 165 places in 1 ms
Applied a total of 616 rules in 1256 ms. Remains 1054 /1291 variables (removed 237) and now considering 2094/1752 (removed -342) transitions.
[2021-05-16 15:22:41] [INFO ] Redundant transitions in 259 ms returned []
[2021-05-16 15:22:41] [INFO ] Flow matrix only has 2017 transitions (discarded 77 similar events)
// Phase 1: matrix 2017 rows 1054 cols
[2021-05-16 15:22:41] [INFO ] Computed 22 place invariants in 51 ms
[2021-05-16 15:22:43] [INFO ] Dead Transitions using invariants and state equation in 1552 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1054/1291 places, 2094/1752 transitions.
Product exploration explored 100000 steps with 3389 reset in 2181 ms.
Product exploration explored 100000 steps with 3396 reset in 1680 ms.
[2021-05-16 15:22:47] [INFO ] Flatten gal took : 136 ms
[2021-05-16 15:22:47] [INFO ] Flatten gal took : 97 ms
[2021-05-16 15:22:47] [INFO ] Time to serialize gal into /tmp/LTL3303938320072036118.gal : 32 ms
[2021-05-16 15:22:47] [INFO ] Time to serialize properties into /tmp/LTL12161241104229972779.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3303938320072036118.gal, -t, CGAL, -LTL, /tmp/LTL12161241104229972779.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3303938320072036118.gal -t CGAL -LTL /tmp/LTL12161241104229972779.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("((p4812==0)||(p3073==1))"))||(G("(p4323==1)")))))
Formula 0 simplified : !X(G"((p4812==0)||(p3073==1))" | G"(p4323==1)")
Detected timeout of ITS tools.
[2021-05-16 15:23:02] [INFO ] Flatten gal took : 72 ms
[2021-05-16 15:23:02] [INFO ] Applying decomposition
[2021-05-16 15:23:02] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5585983340174674361.txt, -o, /tmp/graph5585983340174674361.bin, -w, /tmp/graph5585983340174674361.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5585983340174674361.bin, -l, -1, -v, -w, /tmp/graph5585983340174674361.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 15:23:03] [INFO ] Decomposing Gal with order
[2021-05-16 15:23:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:23:04] [INFO ] Removed a total of 518 redundant transitions.
[2021-05-16 15:23:04] [INFO ] Flatten gal took : 882 ms
[2021-05-16 15:23:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 77 ms.
[2021-05-16 15:23:04] [INFO ] Time to serialize gal into /tmp/LTL668265201265656630.gal : 27 ms
[2021-05-16 15:23:04] [INFO ] Time to serialize properties into /tmp/LTL17928058526515099910.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL668265201265656630.gal, -t, CGAL, -LTL, /tmp/LTL17928058526515099910.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL668265201265656630.gal -t CGAL -LTL /tmp/LTL17928058526515099910.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G("((u213.p4812==0)||(i17.u183.p3073==1))"))||(G("(u213.p4323==1)")))))
Formula 0 simplified : !X(G"((u213.p4812==0)||(i17.u183.p3073==1))" | G"(u213.p4323==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4492212693989710419
[2021-05-16 15:23:19] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4492212693989710419
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4492212693989710419]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4492212693989710419] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4492212693989710419] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property FlexibleBarrier-PT-20b-00 finished in 49527 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((X(p0)||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1369 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1369/1369 places, 1859/1859 transitions.
Graph (trivial) has 1305 edges and 1369 vertex of which 121 / 1369 are part of one of the 20 SCC in 3 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 107 place count 1267 transition count 1650
Reduce places removed 106 places and 0 transitions.
Iterating post reduction 1 with 106 rules applied. Total rules applied 213 place count 1161 transition count 1650
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 213 place count 1161 transition count 1601
Deduced a syphon composed of 49 places in 4 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 311 place count 1112 transition count 1601
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 390 place count 1033 transition count 1522
Iterating global reduction 2 with 79 rules applied. Total rules applied 469 place count 1033 transition count 1522
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 476 place count 1033 transition count 1515
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 476 place count 1033 transition count 1514
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 478 place count 1032 transition count 1514
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 493 place count 1017 transition count 1499
Iterating global reduction 3 with 15 rules applied. Total rules applied 508 place count 1017 transition count 1499
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 523 place count 1017 transition count 1484
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 2 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 767 place count 895 transition count 1362
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 774 place count 888 transition count 1355
Iterating global reduction 4 with 7 rules applied. Total rules applied 781 place count 888 transition count 1355
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 788 place count 888 transition count 1348
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 808 place count 888 transition count 1328
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 809 place count 887 transition count 1327
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 810 place count 886 transition count 1326
Applied a total of 810 rules in 1172 ms. Remains 886 /1369 variables (removed 483) and now considering 1326/1859 (removed 533) transitions.
[2021-05-16 15:23:21] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
// Phase 1: matrix 1287 rows 886 cols
[2021-05-16 15:23:21] [INFO ] Computed 22 place invariants in 31 ms
[2021-05-16 15:23:22] [INFO ] Implicit Places using invariants in 709 ms returned []
[2021-05-16 15:23:22] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
// Phase 1: matrix 1287 rows 886 cols
[2021-05-16 15:23:22] [INFO ] Computed 22 place invariants in 30 ms
[2021-05-16 15:23:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 15:23:24] [INFO ] Implicit Places using invariants and state equation in 1718 ms returned []
Implicit Place search using SMT with State Equation took 2429 ms to find 0 implicit places.
[2021-05-16 15:23:24] [INFO ] Redundant transitions in 110 ms returned []
[2021-05-16 15:23:24] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
// Phase 1: matrix 1287 rows 886 cols
[2021-05-16 15:23:24] [INFO ] Computed 22 place invariants in 31 ms
[2021-05-16 15:23:25] [INFO ] Dead Transitions using invariants and state equation in 1442 ms returned []
Finished structural reductions, in 1 iterations. Remains : 886/1369 places, 1326/1859 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-20b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s719 1), p1:(EQ s670 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-01 finished in 5273 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1369 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1369/1369 places, 1859/1859 transitions.
Graph (trivial) has 1306 edges and 1369 vertex of which 121 / 1369 are part of one of the 20 SCC in 2 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 107 place count 1267 transition count 1650
Reduce places removed 106 places and 0 transitions.
Iterating post reduction 1 with 106 rules applied. Total rules applied 213 place count 1161 transition count 1650
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 213 place count 1161 transition count 1601
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 311 place count 1112 transition count 1601
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 390 place count 1033 transition count 1522
Iterating global reduction 2 with 79 rules applied. Total rules applied 469 place count 1033 transition count 1522
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 476 place count 1033 transition count 1515
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 476 place count 1033 transition count 1514
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 478 place count 1032 transition count 1514
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 494 place count 1016 transition count 1498
Iterating global reduction 3 with 16 rules applied. Total rules applied 510 place count 1016 transition count 1498
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 526 place count 1016 transition count 1482
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 770 place count 894 transition count 1360
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 776 place count 888 transition count 1354
Iterating global reduction 4 with 6 rules applied. Total rules applied 782 place count 888 transition count 1354
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 788 place count 888 transition count 1348
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 808 place count 888 transition count 1328
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 809 place count 887 transition count 1327
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 810 place count 886 transition count 1326
Applied a total of 810 rules in 735 ms. Remains 886 /1369 variables (removed 483) and now considering 1326/1859 (removed 533) transitions.
[2021-05-16 15:23:26] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
// Phase 1: matrix 1287 rows 886 cols
[2021-05-16 15:23:26] [INFO ] Computed 22 place invariants in 31 ms
[2021-05-16 15:23:27] [INFO ] Implicit Places using invariants in 707 ms returned []
[2021-05-16 15:23:27] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
// Phase 1: matrix 1287 rows 886 cols
[2021-05-16 15:23:27] [INFO ] Computed 22 place invariants in 32 ms
[2021-05-16 15:23:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 15:23:29] [INFO ] Implicit Places using invariants and state equation in 1861 ms returned []
Implicit Place search using SMT with State Equation took 2570 ms to find 0 implicit places.
[2021-05-16 15:23:29] [INFO ] Redundant transitions in 31 ms returned []
[2021-05-16 15:23:29] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
// Phase 1: matrix 1287 rows 886 cols
[2021-05-16 15:23:29] [INFO ] Computed 22 place invariants in 31 ms
[2021-05-16 15:23:30] [INFO ] Dead Transitions using invariants and state equation in 983 ms returned []
Finished structural reductions, in 1 iterations. Remains : 886/1369 places, 1326/1859 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s327 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-03 finished in 4419 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X((p1&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1369 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1369/1369 places, 1859/1859 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 1333 transition count 1823
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 1333 transition count 1823
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 79 place count 1333 transition count 1816
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 106 place count 1306 transition count 1789
Iterating global reduction 1 with 27 rules applied. Total rules applied 133 place count 1306 transition count 1789
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 150 place count 1306 transition count 1772
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 155 place count 1301 transition count 1767
Iterating global reduction 2 with 5 rules applied. Total rules applied 160 place count 1301 transition count 1767
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 163 place count 1301 transition count 1764
Applied a total of 163 rules in 233 ms. Remains 1301 /1369 variables (removed 68) and now considering 1764/1859 (removed 95) transitions.
// Phase 1: matrix 1764 rows 1301 cols
[2021-05-16 15:23:30] [INFO ] Computed 22 place invariants in 31 ms
[2021-05-16 15:23:31] [INFO ] Implicit Places using invariants in 812 ms returned []
// Phase 1: matrix 1764 rows 1301 cols
[2021-05-16 15:23:31] [INFO ] Computed 22 place invariants in 32 ms
[2021-05-16 15:23:33] [INFO ] Implicit Places using invariants and state equation in 2431 ms returned []
Implicit Place search using SMT with State Equation took 3244 ms to find 0 implicit places.
// Phase 1: matrix 1764 rows 1301 cols
[2021-05-16 15:23:33] [INFO ] Computed 22 place invariants in 29 ms
[2021-05-16 15:23:35] [INFO ] Dead Transitions using invariants and state equation in 1720 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1301/1369 places, 1764/1859 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), true]
Running random walk in product with property : FlexibleBarrier-PT-20b-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (EQ s1089 0) (EQ s655 1)), p1:(OR (EQ s1294 1) (EQ s703 0) (EQ s933 1)), p2:(EQ s1294 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 734 reset in 367 ms.
Stack based approach found an accepted trace after 94185 steps with 692 reset with depth 10 and stack size 10 in 447 ms.
FORMULA FlexibleBarrier-PT-20b-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-04 finished in 6248 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((X(p0)&&G((G(p1) U p2)))||G(p0)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 1369 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1369/1369 places, 1859/1859 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 1334 transition count 1824
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 1334 transition count 1824
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 74 place count 1334 transition count 1820
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 103 place count 1305 transition count 1791
Iterating global reduction 1 with 29 rules applied. Total rules applied 132 place count 1305 transition count 1791
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 149 place count 1305 transition count 1774
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 155 place count 1299 transition count 1768
Iterating global reduction 2 with 6 rules applied. Total rules applied 161 place count 1299 transition count 1768
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 164 place count 1299 transition count 1765
Applied a total of 164 rules in 225 ms. Remains 1299 /1369 variables (removed 70) and now considering 1765/1859 (removed 94) transitions.
// Phase 1: matrix 1765 rows 1299 cols
[2021-05-16 15:23:36] [INFO ] Computed 22 place invariants in 29 ms
[2021-05-16 15:23:37] [INFO ] Implicit Places using invariants in 792 ms returned []
// Phase 1: matrix 1765 rows 1299 cols
[2021-05-16 15:23:37] [INFO ] Computed 22 place invariants in 38 ms
[2021-05-16 15:23:39] [INFO ] Implicit Places using invariants and state equation in 2009 ms returned []
Implicit Place search using SMT with State Equation took 2813 ms to find 0 implicit places.
// Phase 1: matrix 1765 rows 1299 cols
[2021-05-16 15:23:39] [INFO ] Computed 22 place invariants in 28 ms
[2021-05-16 15:23:41] [INFO ] Dead Transitions using invariants and state equation in 1699 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1299/1369 places, 1765/1859 transitions.
Stuttering acceptance computed with spot in 378 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-05 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0, 2} source=0 dest: 2}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1, 2} source=0 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=0 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1, 2} source=0 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=0 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0, 2} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1, 2} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1, 2} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=2 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0, 2} source=2 dest: 2}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1, 2} source=2 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1, 2} source=2 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0, 2} source=3 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1, 2} source=3 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=3 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={1, 2} source=3 dest: 5}, { cond=(AND p2 p1 p0), acceptance={1} source=3 dest: 5}, { cond=(AND p2 p1 (NOT p0)), acceptance={2} source=3 dest: 6}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1, 2} source=4 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0, 2} source=5 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1, 2} source=5 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={1, 2} source=5 dest: 5}, { cond=(AND p2 p1 (NOT p0)), acceptance={2} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0, 2} source=6 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1, 2} source=6 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=6 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={2} source=6 dest: 6}, { cond=(AND p2 p1 p0), acceptance={} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 0}]], initial=7, aps=[p2:(OR (EQ s481 0) (EQ s29 1)), p1:(AND (NEQ s403 0) (NEQ s531 1)), p0:(AND (NEQ s161 0) (NEQ s167 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 733 reset in 457 ms.
Product exploration explored 100000 steps with 731 reset in 577 ms.
Knowledge obtained : [p2, (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 383 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 733 reset in 439 ms.
Product exploration explored 100000 steps with 734 reset in 447 ms.
[2021-05-16 15:23:44] [INFO ] Flatten gal took : 63 ms
[2021-05-16 15:23:44] [INFO ] Flatten gal took : 67 ms
[2021-05-16 15:23:44] [INFO ] Time to serialize gal into /tmp/LTL15814150426916124018.gal : 13 ms
[2021-05-16 15:23:44] [INFO ] Time to serialize properties into /tmp/LTL3380116061219160766.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15814150426916124018.gal, -t, CGAL, -LTL, /tmp/LTL3380116061219160766.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15814150426916124018.gal -t CGAL -LTL /tmp/LTL3380116061219160766.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((p579!=0)&&(p653!=1))"))||((X("((p579!=0)&&(p653!=1))"))&&(G((G("((p1587!=0)&&(p2085!=1))"))U("((p1858==0)||(p112==1))"))))))))
Formula 0 simplified : !XF(G"((p579!=0)&&(p653!=1))" | (X"((p579!=0)&&(p653!=1))" & G(G"((p1587!=0)&&(p2085!=1))" U "((p1858==0)||(p112==1))")))
Detected timeout of ITS tools.
[2021-05-16 15:23:59] [INFO ] Flatten gal took : 60 ms
[2021-05-16 15:23:59] [INFO ] Applying decomposition
[2021-05-16 15:23:59] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16672043307256823645.txt, -o, /tmp/graph16672043307256823645.bin, -w, /tmp/graph16672043307256823645.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16672043307256823645.bin, -l, -1, -v, -w, /tmp/graph16672043307256823645.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 15:23:59] [INFO ] Decomposing Gal with order
[2021-05-16 15:23:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:24:00] [INFO ] Removed a total of 509 redundant transitions.
[2021-05-16 15:24:00] [INFO ] Flatten gal took : 338 ms
[2021-05-16 15:24:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 59 ms.
[2021-05-16 15:24:00] [INFO ] Time to serialize gal into /tmp/LTL1983826477544439984.gal : 29 ms
[2021-05-16 15:24:00] [INFO ] Time to serialize properties into /tmp/LTL3513032992457505969.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1983826477544439984.gal, -t, CGAL, -LTL, /tmp/LTL3513032992457505969.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1983826477544439984.gal -t CGAL -LTL /tmp/LTL3513032992457505969.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((i6.u39.p579!=0)&&(i6.u47.p653!=1))"))||((X("((i6.u39.p579!=0)&&(i6.u47.p653!=1))"))&&(G((G("((i11.u91.p1587!=0)&&(i14.i0.i0.u130.p2085!=1))"))U("((i13.u112.p1858==0)||(i2.u17.p112==1))"))))))))
Formula 0 simplified : !XF(G"((i6.u39.p579!=0)&&(i6.u47.p653!=1))" | (X"((i6.u39.p579!=0)&&(i6.u47.p653!=1))" & G(G"((i11.u91.p1587!=0)&&(i14.i0.i0.u130.p2085!=1))" U "((i13.u112.p1858==0)||(i2.u17.p112==1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8910457342452544757
[2021-05-16 15:24:15] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8910457342452544757
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8910457342452544757]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8910457342452544757] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8910457342452544757] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property FlexibleBarrier-PT-20b-05 finished in 40084 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(p0)&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1369 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1369/1369 places, 1859/1859 transitions.
Graph (trivial) has 1299 edges and 1369 vertex of which 121 / 1369 are part of one of the 20 SCC in 3 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 1267 transition count 1655
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 203 place count 1166 transition count 1655
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 203 place count 1166 transition count 1606
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 301 place count 1117 transition count 1606
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 377 place count 1041 transition count 1530
Iterating global reduction 2 with 76 rules applied. Total rules applied 453 place count 1041 transition count 1530
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 460 place count 1041 transition count 1523
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 476 place count 1025 transition count 1507
Iterating global reduction 3 with 16 rules applied. Total rules applied 492 place count 1025 transition count 1507
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 507 place count 1025 transition count 1492
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 1 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 4 with 246 rules applied. Total rules applied 753 place count 902 transition count 1369
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 760 place count 895 transition count 1362
Iterating global reduction 4 with 7 rules applied. Total rules applied 767 place count 895 transition count 1362
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 774 place count 895 transition count 1355
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 794 place count 895 transition count 1335
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 795 place count 894 transition count 1334
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 796 place count 893 transition count 1333
Applied a total of 796 rules in 854 ms. Remains 893 /1369 variables (removed 476) and now considering 1333/1859 (removed 526) transitions.
[2021-05-16 15:24:17] [INFO ] Flow matrix only has 1294 transitions (discarded 39 similar events)
// Phase 1: matrix 1294 rows 893 cols
[2021-05-16 15:24:17] [INFO ] Computed 22 place invariants in 32 ms
[2021-05-16 15:24:18] [INFO ] Implicit Places using invariants in 697 ms returned []
[2021-05-16 15:24:18] [INFO ] Flow matrix only has 1294 transitions (discarded 39 similar events)
// Phase 1: matrix 1294 rows 893 cols
[2021-05-16 15:24:18] [INFO ] Computed 22 place invariants in 30 ms
[2021-05-16 15:24:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 15:24:19] [INFO ] Implicit Places using invariants and state equation in 1754 ms returned []
Implicit Place search using SMT with State Equation took 2455 ms to find 0 implicit places.
[2021-05-16 15:24:20] [INFO ] Redundant transitions in 30 ms returned []
[2021-05-16 15:24:20] [INFO ] Flow matrix only has 1294 transitions (discarded 39 similar events)
// Phase 1: matrix 1294 rows 893 cols
[2021-05-16 15:24:20] [INFO ] Computed 22 place invariants in 29 ms
[2021-05-16 15:24:21] [INFO ] Dead Transitions using invariants and state equation in 1233 ms returned []
Finished structural reductions, in 1 iterations. Remains : 893/1369 places, 1333/1859 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-07 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (NEQ s748 0) (NEQ s542 1)), p0:(AND (NEQ s417 0) (NEQ s535 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-07 finished in 4710 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1369 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1369/1369 places, 1859/1859 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 1330 transition count 1820
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 1330 transition count 1820
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 84 place count 1330 transition count 1814
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 116 place count 1298 transition count 1782
Iterating global reduction 1 with 32 rules applied. Total rules applied 148 place count 1298 transition count 1782
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 167 place count 1298 transition count 1763
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 174 place count 1291 transition count 1756
Iterating global reduction 2 with 7 rules applied. Total rules applied 181 place count 1291 transition count 1756
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 185 place count 1291 transition count 1752
Applied a total of 185 rules in 257 ms. Remains 1291 /1369 variables (removed 78) and now considering 1752/1859 (removed 107) transitions.
// Phase 1: matrix 1752 rows 1291 cols
[2021-05-16 15:24:21] [INFO ] Computed 22 place invariants in 28 ms
[2021-05-16 15:24:22] [INFO ] Implicit Places using invariants in 1121 ms returned []
// Phase 1: matrix 1752 rows 1291 cols
[2021-05-16 15:24:22] [INFO ] Computed 22 place invariants in 28 ms
[2021-05-16 15:24:24] [INFO ] Implicit Places using invariants and state equation in 1941 ms returned []
Implicit Place search using SMT with State Equation took 3069 ms to find 0 implicit places.
// Phase 1: matrix 1752 rows 1291 cols
[2021-05-16 15:24:24] [INFO ] Computed 22 place invariants in 47 ms
[2021-05-16 15:24:26] [INFO ] Dead Transitions using invariants and state equation in 1418 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1291/1369 places, 1752/1859 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (EQ s876 0) (EQ s396 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-08 finished in 4947 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&((p1&&F(p0)) U X(p2))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 1369 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1369/1369 places, 1859/1859 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 1333 transition count 1823
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 1333 transition count 1823
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 78 place count 1333 transition count 1817
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 106 place count 1305 transition count 1789
Iterating global reduction 1 with 28 rules applied. Total rules applied 134 place count 1305 transition count 1789
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 152 place count 1305 transition count 1771
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 158 place count 1299 transition count 1765
Iterating global reduction 2 with 6 rules applied. Total rules applied 164 place count 1299 transition count 1765
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 168 place count 1299 transition count 1761
Applied a total of 168 rules in 253 ms. Remains 1299 /1369 variables (removed 70) and now considering 1761/1859 (removed 98) transitions.
// Phase 1: matrix 1761 rows 1299 cols
[2021-05-16 15:24:26] [INFO ] Computed 22 place invariants in 28 ms
[2021-05-16 15:24:27] [INFO ] Implicit Places using invariants in 1029 ms returned []
// Phase 1: matrix 1761 rows 1299 cols
[2021-05-16 15:24:27] [INFO ] Computed 22 place invariants in 29 ms
[2021-05-16 15:24:29] [INFO ] Implicit Places using invariants and state equation in 1996 ms returned []
Implicit Place search using SMT with State Equation took 3029 ms to find 0 implicit places.
// Phase 1: matrix 1761 rows 1299 cols
[2021-05-16 15:24:29] [INFO ] Computed 22 place invariants in 27 ms
[2021-05-16 15:24:31] [INFO ] Dead Transitions using invariants and state equation in 1673 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1299/1369 places, 1761/1859 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s758 0) (EQ s1072 1)), p1:(OR (EQ s1226 0) (EQ s597 1)), p2:(OR (EQ s1001 0) (EQ s204 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 844 ms.
Product exploration explored 100000 steps with 33333 reset in 846 ms.
Knowledge obtained : [p0, p1, p2]
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 1028 ms.
Product exploration explored 100000 steps with 33333 reset in 996 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 6 out of 1299 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1299/1299 places, 1761/1761 transitions.
Graph (trivial) has 1227 edges and 1299 vertex of which 121 / 1299 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 1198 transition count 1659
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 60 Pre rules applied. Total rules applied 78 place count 1198 transition count 1779
Deduced a syphon composed of 137 places in 2 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 138 place count 1198 transition count 1779
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 233 place count 1103 transition count 1684
Deduced a syphon composed of 81 places in 2 ms
Iterating global reduction 1 with 95 rules applied. Total rules applied 328 place count 1103 transition count 1684
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 329 place count 1102 transition count 1683
Deduced a syphon composed of 81 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 330 place count 1102 transition count 1683
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 186 places in 0 ms
Iterating global reduction 1 with 105 rules applied. Total rules applied 435 place count 1102 transition count 1723
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 478 place count 1059 transition count 1680
Deduced a syphon composed of 143 places in 1 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 521 place count 1059 transition count 1680
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 163 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 541 place count 1059 transition count 1760
Deduced a syphon composed of 163 places in 0 ms
Drop transitions removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 1 with 80 rules applied. Total rules applied 621 place count 1059 transition count 1680
Deduced a syphon composed of 163 places in 0 ms
Applied a total of 621 rules in 557 ms. Remains 1059 /1299 variables (removed 240) and now considering 1680/1761 (removed 81) transitions.
[2021-05-16 15:24:36] [INFO ] Redundant transitions in 47 ms returned []
[2021-05-16 15:24:36] [INFO ] Flow matrix only has 1622 transitions (discarded 58 similar events)
// Phase 1: matrix 1622 rows 1059 cols
[2021-05-16 15:24:36] [INFO ] Computed 22 place invariants in 53 ms
[2021-05-16 15:24:37] [INFO ] Dead Transitions using invariants and state equation in 1051 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1059/1299 places, 1680/1761 transitions.
Product exploration explored 100000 steps with 33333 reset in 783 ms.
Product exploration explored 100000 steps with 33333 reset in 808 ms.
[2021-05-16 15:24:39] [INFO ] Flatten gal took : 58 ms
[2021-05-16 15:24:39] [INFO ] Flatten gal took : 52 ms
[2021-05-16 15:24:39] [INFO ] Time to serialize gal into /tmp/LTL517742714841462619.gal : 10 ms
[2021-05-16 15:24:39] [INFO ] Time to serialize properties into /tmp/LTL3511878424022794265.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL517742714841462619.gal, -t, CGAL, -LTL, /tmp/LTL3511878424022794265.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL517742714841462619.gal -t CGAL -LTL /tmp/LTL3511878424022794265.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(((("((p5026==0)||(p2346==1))")&&(F("((p3025==0)||(p4270==1))")))U(X("((p3926==0)||(p815==1))")))&&("((p3025==0)||(p4270==1))")))))
Formula 0 simplified : !XF("((p3025==0)||(p4270==1))" & (("((p5026==0)||(p2346==1))" & F"((p3025==0)||(p4270==1))") U X"((p3926==0)||(p815==1))"))
Detected timeout of ITS tools.
[2021-05-16 15:24:54] [INFO ] Flatten gal took : 47 ms
[2021-05-16 15:24:54] [INFO ] Applying decomposition
[2021-05-16 15:24:54] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph103495491115392909.txt, -o, /tmp/graph103495491115392909.bin, -w, /tmp/graph103495491115392909.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph103495491115392909.bin, -l, -1, -v, -w, /tmp/graph103495491115392909.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 15:24:54] [INFO ] Decomposing Gal with order
[2021-05-16 15:24:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:24:55] [INFO ] Removed a total of 521 redundant transitions.
[2021-05-16 15:24:55] [INFO ] Flatten gal took : 300 ms
[2021-05-16 15:24:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 20 ms.
[2021-05-16 15:24:55] [INFO ] Time to serialize gal into /tmp/LTL8614028017748766198.gal : 16 ms
[2021-05-16 15:24:55] [INFO ] Time to serialize properties into /tmp/LTL9074919945034177866.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8614028017748766198.gal, -t, CGAL, -LTL, /tmp/LTL9074919945034177866.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8614028017748766198.gal -t CGAL -LTL /tmp/LTL9074919945034177866.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(((("((i20.u215.p5026==0)||(i12.u137.p2346==1))")&&(F("((i16.u182.p3025==0)||(i0.u214.p4270==1))")))U(X("((i20.u213.p3926==0)||(i4.u52.p815==1))")))&&("((i16.u182.p3025==0)||(i0.u214.p4270==1))")))))
Formula 0 simplified : !XF("((i16.u182.p3025==0)||(i0.u214.p4270==1))" & (("((i20.u215.p5026==0)||(i12.u137.p2346==1))" & F"((i16.u182.p3025==0)||(i0.u214.p4270==1))") U X"((i20.u213.p3926==0)||(i4.u52.p815==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13366730691183189097
[2021-05-16 15:25:10] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13366730691183189097
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13366730691183189097]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13366730691183189097] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13366730691183189097] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property FlexibleBarrier-PT-20b-09 finished in 44935 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p0) U p1)&&X(F(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1369 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1369/1369 places, 1859/1859 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 1332 transition count 1822
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 1332 transition count 1822
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 81 place count 1332 transition count 1815
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 109 place count 1304 transition count 1787
Iterating global reduction 1 with 28 rules applied. Total rules applied 137 place count 1304 transition count 1787
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 152 place count 1304 transition count 1772
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 159 place count 1297 transition count 1765
Iterating global reduction 2 with 7 rules applied. Total rules applied 166 place count 1297 transition count 1765
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 170 place count 1297 transition count 1761
Applied a total of 170 rules in 353 ms. Remains 1297 /1369 variables (removed 72) and now considering 1761/1859 (removed 98) transitions.
// Phase 1: matrix 1761 rows 1297 cols
[2021-05-16 15:25:11] [INFO ] Computed 22 place invariants in 47 ms
[2021-05-16 15:25:12] [INFO ] Implicit Places using invariants in 1336 ms returned []
// Phase 1: matrix 1761 rows 1297 cols
[2021-05-16 15:25:13] [INFO ] Computed 22 place invariants in 47 ms
[2021-05-16 15:25:15] [INFO ] Implicit Places using invariants and state equation in 2299 ms returned []
Implicit Place search using SMT with State Equation took 3639 ms to find 0 implicit places.
// Phase 1: matrix 1761 rows 1297 cols
[2021-05-16 15:25:15] [INFO ] Computed 22 place invariants in 31 ms
[2021-05-16 15:25:17] [INFO ] Dead Transitions using invariants and state equation in 1840 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1297/1369 places, 1761/1859 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-20b-11 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s219 1), p0:(AND (NEQ s1104 0) (NEQ s999 1)), p2:(OR (EQ s856 0) (EQ s862 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 135 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-11 finished in 6041 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&X(X(F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1369 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1369/1369 places, 1859/1859 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 1331 transition count 1821
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 1331 transition count 1821
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 82 place count 1331 transition count 1815
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 112 place count 1301 transition count 1785
Iterating global reduction 1 with 30 rules applied. Total rules applied 142 place count 1301 transition count 1785
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 159 place count 1301 transition count 1768
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 166 place count 1294 transition count 1761
Iterating global reduction 2 with 7 rules applied. Total rules applied 173 place count 1294 transition count 1761
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 177 place count 1294 transition count 1757
Applied a total of 177 rules in 216 ms. Remains 1294 /1369 variables (removed 75) and now considering 1757/1859 (removed 102) transitions.
// Phase 1: matrix 1757 rows 1294 cols
[2021-05-16 15:25:17] [INFO ] Computed 22 place invariants in 28 ms
[2021-05-16 15:25:18] [INFO ] Implicit Places using invariants in 902 ms returned []
// Phase 1: matrix 1757 rows 1294 cols
[2021-05-16 15:25:18] [INFO ] Computed 22 place invariants in 46 ms
[2021-05-16 15:25:20] [INFO ] Implicit Places using invariants and state equation in 2110 ms returned []
Implicit Place search using SMT with State Equation took 3034 ms to find 0 implicit places.
// Phase 1: matrix 1757 rows 1294 cols
[2021-05-16 15:25:20] [INFO ] Computed 22 place invariants in 28 ms
[2021-05-16 15:25:22] [INFO ] Dead Transitions using invariants and state equation in 1795 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1294/1369 places, 1757/1859 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-20b-12 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p1:(NEQ s217 1), p0:(OR (EQ s433 0) (EQ s1117 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 527 ms.
Product exploration explored 100000 steps with 20000 reset in 535 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 351 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 20000 reset in 485 ms.
Product exploration explored 100000 steps with 20000 reset in 487 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Support contains 3 out of 1294 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1294/1294 places, 1757/1757 transitions.
Graph (trivial) has 1229 edges and 1294 vertex of which 121 / 1294 are part of one of the 20 SCC in 2 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 1193 transition count 1655
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 61 Pre rules applied. Total rules applied 80 place count 1193 transition count 2175
Deduced a syphon composed of 140 places in 2 ms
Iterating global reduction 1 with 61 rules applied. Total rules applied 141 place count 1193 transition count 2175
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 238 place count 1096 transition count 2078
Deduced a syphon composed of 82 places in 2 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 335 place count 1096 transition count 2078
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 1 with 84 rules applied. Total rules applied 419 place count 1096 transition count 2098
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 461 place count 1054 transition count 2056
Deduced a syphon composed of 124 places in 0 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 503 place count 1054 transition count 2056
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -120
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 543 place count 1054 transition count 2176
Deduced a syphon composed of 164 places in 0 ms
Drop transitions removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 1 with 80 rules applied. Total rules applied 623 place count 1054 transition count 2096
Deduced a syphon composed of 164 places in 0 ms
Applied a total of 623 rules in 505 ms. Remains 1054 /1294 variables (removed 240) and now considering 2096/1757 (removed -339) transitions.
[2021-05-16 15:25:26] [INFO ] Redundant transitions in 74 ms returned []
[2021-05-16 15:25:26] [INFO ] Flow matrix only has 2019 transitions (discarded 77 similar events)
// Phase 1: matrix 2019 rows 1054 cols
[2021-05-16 15:25:26] [INFO ] Computed 22 place invariants in 45 ms
[2021-05-16 15:25:27] [INFO ] Dead Transitions using invariants and state equation in 1745 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1054/1294 places, 2096/1757 transitions.
Product exploration explored 100000 steps with 20000 reset in 2995 ms.
Product exploration explored 100000 steps with 20000 reset in 2904 ms.
[2021-05-16 15:25:33] [INFO ] Flatten gal took : 43 ms
[2021-05-16 15:25:33] [INFO ] Flatten gal took : 42 ms
[2021-05-16 15:25:33] [INFO ] Time to serialize gal into /tmp/LTL5083103728963843525.gal : 13 ms
[2021-05-16 15:25:33] [INFO ] Time to serialize properties into /tmp/LTL891244089872619929.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5083103728963843525.gal, -t, CGAL, -LTL, /tmp/LTL891244089872619929.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5083103728963843525.gal -t CGAL -LTL /tmp/LTL891244089872619929.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((X(X(F("(p864!=1)"))))&&("((p1721==0)||(p4507==1))")))))
Formula 0 simplified : !XX("((p1721==0)||(p4507==1))" & XXF"(p864!=1)")
Detected timeout of ITS tools.
[2021-05-16 15:25:48] [INFO ] Flatten gal took : 42 ms
[2021-05-16 15:25:48] [INFO ] Applying decomposition
[2021-05-16 15:25:48] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1058628936093834506.txt, -o, /tmp/graph1058628936093834506.bin, -w, /tmp/graph1058628936093834506.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1058628936093834506.bin, -l, -1, -v, -w, /tmp/graph1058628936093834506.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 15:25:49] [INFO ] Decomposing Gal with order
[2021-05-16 15:25:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:25:49] [INFO ] Removed a total of 504 redundant transitions.
[2021-05-16 15:25:49] [INFO ] Flatten gal took : 281 ms
[2021-05-16 15:25:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 17 ms.
[2021-05-16 15:25:49] [INFO ] Time to serialize gal into /tmp/LTL12687974413090113928.gal : 16 ms
[2021-05-16 15:25:49] [INFO ] Time to serialize properties into /tmp/LTL8261921100220800956.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12687974413090113928.gal, -t, CGAL, -LTL, /tmp/LTL8261921100220800956.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12687974413090113928.gal -t CGAL -LTL /tmp/LTL8261921100220800956.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X((X(X(F("(i4.u50.p864!=1)"))))&&("((i9.u103.p1721==0)||(u211.p4507==1))")))))
Formula 0 simplified : !XX("((i9.u103.p1721==0)||(u211.p4507==1))" & XXF"(i4.u50.p864!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16872713661860275478
[2021-05-16 15:26:04] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16872713661860275478
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16872713661860275478]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16872713661860275478] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16872713661860275478] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property FlexibleBarrier-PT-20b-12 finished in 48336 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1369 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1369/1369 places, 1859/1859 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 1329 transition count 1819
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 1329 transition count 1819
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 87 place count 1329 transition count 1812
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 118 place count 1298 transition count 1781
Iterating global reduction 1 with 31 rules applied. Total rules applied 149 place count 1298 transition count 1781
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 167 place count 1298 transition count 1763
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 174 place count 1291 transition count 1756
Iterating global reduction 2 with 7 rules applied. Total rules applied 181 place count 1291 transition count 1756
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 185 place count 1291 transition count 1752
Applied a total of 185 rules in 275 ms. Remains 1291 /1369 variables (removed 78) and now considering 1752/1859 (removed 107) transitions.
// Phase 1: matrix 1752 rows 1291 cols
[2021-05-16 15:26:05] [INFO ] Computed 22 place invariants in 29 ms
[2021-05-16 15:26:06] [INFO ] Implicit Places using invariants in 1004 ms returned []
// Phase 1: matrix 1752 rows 1291 cols
[2021-05-16 15:26:07] [INFO ] Computed 22 place invariants in 71 ms
[2021-05-16 15:26:09] [INFO ] Implicit Places using invariants and state equation in 2426 ms returned []
Implicit Place search using SMT with State Equation took 3460 ms to find 0 implicit places.
// Phase 1: matrix 1752 rows 1291 cols
[2021-05-16 15:26:09] [INFO ] Computed 22 place invariants in 37 ms
[2021-05-16 15:26:11] [INFO ] Dead Transitions using invariants and state equation in 1708 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1291/1369 places, 1752/1859 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s885 0) (NEQ s868 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 22835 steps with 168 reset in 110 ms.
FORMULA FlexibleBarrier-PT-20b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-13 finished in 5789 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||(p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1369 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1369/1369 places, 1859/1859 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 1331 transition count 1821
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 1331 transition count 1821
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 82 place count 1331 transition count 1815
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 112 place count 1301 transition count 1785
Iterating global reduction 1 with 30 rules applied. Total rules applied 142 place count 1301 transition count 1785
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 159 place count 1301 transition count 1768
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 166 place count 1294 transition count 1761
Iterating global reduction 2 with 7 rules applied. Total rules applied 173 place count 1294 transition count 1761
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 177 place count 1294 transition count 1757
Applied a total of 177 rules in 258 ms. Remains 1294 /1369 variables (removed 75) and now considering 1757/1859 (removed 102) transitions.
// Phase 1: matrix 1757 rows 1294 cols
[2021-05-16 15:26:11] [INFO ] Computed 22 place invariants in 27 ms
[2021-05-16 15:26:13] [INFO ] Implicit Places using invariants in 1463 ms returned []
// Phase 1: matrix 1757 rows 1294 cols
[2021-05-16 15:26:13] [INFO ] Computed 22 place invariants in 27 ms
[2021-05-16 15:26:15] [INFO ] Implicit Places using invariants and state equation in 1852 ms returned []
Implicit Place search using SMT with State Equation took 3330 ms to find 0 implicit places.
// Phase 1: matrix 1757 rows 1294 cols
[2021-05-16 15:26:15] [INFO ] Computed 22 place invariants in 29 ms
[2021-05-16 15:26:16] [INFO ] Dead Transitions using invariants and state equation in 1512 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1294/1369 places, 1757/1859 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-20b-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s82 1) (OR (EQ s866 0) (EQ s345 1))), p2:(AND (NEQ s82 1) (NEQ s792 0)), p1:(NEQ s792 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 138 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-14 finished in 5202 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3223804902380135500
[2021-05-16 15:26:16] [INFO ] Too many transitions (1859) to apply POR reductions. Disabling POR matrices.
[2021-05-16 15:26:16] [INFO ] Applying decomposition
[2021-05-16 15:26:16] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3223804902380135500
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3223804902380135500]
[2021-05-16 15:26:16] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13359021706707033627.txt, -o, /tmp/graph13359021706707033627.bin, -w, /tmp/graph13359021706707033627.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13359021706707033627.bin, -l, -1, -v, -w, /tmp/graph13359021706707033627.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 15:26:17] [INFO ] Decomposing Gal with order
[2021-05-16 15:26:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:26:17] [INFO ] Removed a total of 559 redundant transitions.
[2021-05-16 15:26:17] [INFO ] Flatten gal took : 381 ms
[2021-05-16 15:26:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 39 ms.
[2021-05-16 15:26:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality2821869013276725409.gal : 21 ms
[2021-05-16 15:26:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality7801928079046016714.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality2821869013276725409.gal, -t, CGAL, -LTL, /tmp/LTLCardinality7801928079046016714.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality2821869013276725409.gal -t CGAL -LTL /tmp/LTLCardinality7801928079046016714.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((X((G("((i22.u235.p4812==0)||(i19.i1.i0.u185.p3073==1))"))||(G("(i22.u235.p4323==1)")))))
Formula 0 simplified : !X(G"((i22.u235.p4812==0)||(i19.i1.i0.u185.p3073==1))" | G"(i22.u235.p4323==1)")
Compilation finished in 29897 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3223804902380135500]
Link finished in 92 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([]((LTLAPp0==true))||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin3223804902380135500]
WARNING : LTSmin timed out (>300 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([]((LTLAPp0==true))||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin3223804902380135500]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(((X((LTLAPp2==true))&&[](([]((LTLAPp3==true)) U (LTLAPp4==true))))||[]((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3223804902380135500]
WARNING : LTSmin timed out (>300 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(((X((LTLAPp2==true))&&[](([]((LTLAPp3==true)) U (LTLAPp4==true))))||[]((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3223804902380135500]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(((LTLAPp5==true)&&(((LTLAPp6==true)&&<>((LTLAPp5==true))) U X((LTLAPp7==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3223804902380135500]
LTSmin run took 774 ms.
FORMULA FlexibleBarrier-PT-20b-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(((LTLAPp8==true)&&X(X(<>((LTLAPp9==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3223804902380135500]
LTSmin run took 908 ms.
FORMULA FlexibleBarrier-PT-20b-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 2400 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([]((LTLAPp0==true))||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin3223804902380135500]
Detected timeout of ITS tools.
[2021-05-16 15:49:38] [INFO ] Applying decomposition
[2021-05-16 15:49:38] [INFO ] Flatten gal took : 138 ms
[2021-05-16 15:49:38] [INFO ] Decomposing Gal with order
[2021-05-16 15:49:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:49:39] [INFO ] Removed a total of 521 redundant transitions.
[2021-05-16 15:49:39] [INFO ] Flatten gal took : 653 ms
[2021-05-16 15:49:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 1847 labels/synchronizations in 634 ms.
[2021-05-16 15:49:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality18222122763995283307.gal : 34 ms
[2021-05-16 15:49:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality12172867178879547152.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality18222122763995283307.gal, -t, CGAL, -LTL, /tmp/LTLCardinality12172867178879547152.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality18222122763995283307.gal -t CGAL -LTL /tmp/LTLCardinality12172867178879547152.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((X((G("((i1.u41.p4812==0)||(i0.i0.i0.i0.u36.p3073==1))"))||(G("(i1.u41.p4323==1)")))))
Formula 0 simplified : !X(G"((i1.u41.p4812==0)||(i0.i0.i0.i0.u36.p3073==1))" | G"(i1.u41.p4323==1)")
Detected timeout of ITS tools.
[2021-05-16 16:13:03] [INFO ] Flatten gal took : 627 ms
[2021-05-16 16:13:09] [INFO ] Input system was already deterministic with 1859 transitions.
[2021-05-16 16:13:09] [INFO ] Transformed 1369 places.
[2021-05-16 16:13:09] [INFO ] Transformed 1859 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-16 16:13:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality16024406735828312277.gal : 77 ms
[2021-05-16 16:13:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality8814552778401071461.ltl : 10 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality16024406735828312277.gal, -t, CGAL, -LTL, /tmp/LTLCardinality8814552778401071461.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality16024406735828312277.gal -t CGAL -LTL /tmp/LTLCardinality8814552778401071461.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G("((p4812==0)||(p3073==1))"))||(G("(p4323==1)")))))
Formula 0 simplified : !X(G"((p4812==0)||(p3073==1))" | G"(p4323==1)")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.024: LTL layer: formula: X(([]((LTLAPp0==true))||[]((LTLAPp1==true))))
pins2lts-mc-linux64( 2/ 8), 0.025: "X(([]((LTLAPp0==true))||[]((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.032: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.050: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.487: DFS-FIFO for weak LTL, using special progress label 1870
pins2lts-mc-linux64( 0/ 8), 0.488: There are 1871 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.488: State length is 1370, there are 1869 groups
pins2lts-mc-linux64( 0/ 8), 0.488: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.488: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.488: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.488: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.797: ~1 levels ~960 states ~6040 transitions
pins2lts-mc-linux64( 4/ 8), 0.949: ~1 levels ~1920 states ~11368 transitions
pins2lts-mc-linux64( 5/ 8), 1.224: ~1 levels ~3840 states ~29280 transitions
pins2lts-mc-linux64( 1/ 8), 1.745: ~1 levels ~7680 states ~32416 transitions
pins2lts-mc-linux64( 1/ 8), 2.821: ~1 levels ~15360 states ~60624 transitions
pins2lts-mc-linux64( 1/ 8), 4.920: ~1 levels ~30720 states ~118424 transitions
pins2lts-mc-linux64( 1/ 8), 8.843: ~1 levels ~61440 states ~220240 transitions
pins2lts-mc-linux64( 1/ 8), 17.226: ~1 levels ~122880 states ~496656 transitions
pins2lts-mc-linux64( 1/ 8), 33.995: ~1 levels ~245760 states ~1173528 transitions
pins2lts-mc-linux64( 1/ 8), 68.776: ~1 levels ~491520 states ~2547112 transitions
pins2lts-mc-linux64( 1/ 8), 139.661: ~1 levels ~983040 states ~5783672 transitions
pins2lts-mc-linux64( 1/ 8), 279.121: ~1 levels ~1966080 states ~11752864 transitions
pins2lts-mc-linux64( 1/ 8), 572.247: ~1 levels ~3932160 states ~25049088 transitions
pins2lts-mc-linux64( 1/ 8), 1164.208: ~1 levels ~7864320 states ~54032152 transitions
pins2lts-mc-linux64( 7/ 8), 2209.343: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2214.631:
pins2lts-mc-linux64( 0/ 8), 2214.631: mean standard work distribution: 5.2% (states) 11.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 2214.634:
pins2lts-mc-linux64( 0/ 8), 2214.634: Explored 13564556 states 127018219 transitions, fanout: 9.364
pins2lts-mc-linux64( 0/ 8), 2214.634: Total exploration time 2214.110 sec (2208.850 sec minimum, 2209.917 sec on average)
pins2lts-mc-linux64( 0/ 8), 2214.634: States per second: 6126, Transitions per second: 57368
pins2lts-mc-linux64( 0/ 8), 2214.634:
pins2lts-mc-linux64( 0/ 8), 2214.634: Progress states detected: 31379089
pins2lts-mc-linux64( 0/ 8), 2214.634: Redundant explorations: -56.7721
pins2lts-mc-linux64( 0/ 8), 2214.634:
pins2lts-mc-linux64( 0/ 8), 2214.634: Queue width: 8B, total height: 28515914, memory: 217.56MB
pins2lts-mc-linux64( 0/ 8), 2214.634: Tree memory: 495.4MB, 16.6 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 2214.635: Tree fill ratio (roots/leafs): 23.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 2214.636: Stored 1886 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2214.656: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2214.656: Est. total memory use: 713.0MB (~1241.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([]((LTLAPp0==true))||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin3223804902380135500]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([]((LTLAPp0==true))||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin3223804902380135500]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="FlexibleBarrier-PT-20b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-20b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r102-smll-162075331200140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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