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.r216-tall-162098205200500.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPt-PT-100A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205200500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 892K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 12:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 12:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 539K May 5 16:52 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621116466411

Running Version 0
[2021-05-15 22:07:48] [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-15 22:07:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 22:07:48] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2021-05-15 22:07:48] [INFO ] Transformed 1903 places.
[2021-05-15 22:07:48] [INFO ] Transformed 1403 transitions.
[2021-05-15 22:07:48] [INFO ] Found NUPN structural information;
[2021-05-15 22:07:48] [INFO ] Parsed PT model containing 1903 places and 1403 transitions in 217 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 22:07:48] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-100A-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 1903 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 237 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2021-05-15 22:07:48] [INFO ] Computed 901 place invariants in 34 ms
[2021-05-15 22:07:49] [INFO ] Implicit Places using invariants in 1179 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2021-05-15 22:07:49] [INFO ] Computed 901 place invariants in 8 ms
[2021-05-15 22:07:52] [INFO ] Implicit Places using invariants and state equation in 2570 ms returned []
Implicit Place search using SMT with State Equation took 3784 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2021-05-15 22:07:52] [INFO ] Computed 901 place invariants in 7 ms
[2021-05-15 22:07:53] [INFO ] Dead Transitions using invariants and state equation in 1212 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
[2021-05-15 22:07:53] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-15 22:07:54] [INFO ] Flatten gal took : 290 ms
FORMULA ShieldIIPt-PT-100A-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 22:07:54] [INFO ] Flatten gal took : 159 ms
[2021-05-15 22:07:54] [INFO ] Input system was already deterministic with 1402 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1775 ms. (steps per millisecond=56 ) properties (out of 18) seen :9
Running SMT prover for 9 properties.
// Phase 1: matrix 1402 rows 1903 cols
[2021-05-15 22:07:56] [INFO ] Computed 901 place invariants in 6 ms
[2021-05-15 22:07:56] [INFO ] [Real]Absence check using 901 positive place invariants in 161 ms returned sat
[2021-05-15 22:07:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 22:07:57] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2021-05-15 22:07:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 22:07:57] [INFO ] [Nat]Absence check using 901 positive place invariants in 167 ms returned sat
[2021-05-15 22:07:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 22:07:58] [INFO ] [Nat]Absence check using state equation in 615 ms returned sat
[2021-05-15 22:07:58] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints (skipped 0 transitions) in 91 ms.
[2021-05-15 22:08:17] [INFO ] Added : 730 causal constraints over 146 iterations in 18870 ms. Result :unknown
[2021-05-15 22:08:17] [INFO ] [Real]Absence check using 901 positive place invariants in 160 ms returned sat
[2021-05-15 22:08:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 22:08:18] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2021-05-15 22:08:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 22:08:18] [INFO ] [Nat]Absence check using 901 positive place invariants in 150 ms returned sat
[2021-05-15 22:08:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 22:08:19] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2021-05-15 22:08:19] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints (skipped 0 transitions) in 65 ms.
[2021-05-15 22:08:39] [INFO ] Deduced a trap composed of 3 places in 1132 ms of which 4 ms to minimize.
[2021-05-15 22:08:39] [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-15 22:08:40] [INFO ] [Real]Absence check using 901 positive place invariants in 159 ms returned sat
[2021-05-15 22:08:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 22:08:40] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2021-05-15 22:08:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 22:08:41] [INFO ] [Nat]Absence check using 901 positive place invariants in 159 ms returned sat
[2021-05-15 22:08:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 22:08:41] [INFO ] [Nat]Absence check using state equation in 607 ms returned sat
[2021-05-15 22:08:41] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints (skipped 0 transitions) in 74 ms.
[2021-05-15 22:09:00] [INFO ] Added : 660 causal constraints over 132 iterations in 18925 ms. Result :unknown
[2021-05-15 22:09:01] [INFO ] [Real]Absence check using 901 positive place invariants in 157 ms returned sat
[2021-05-15 22:09:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 22:09:01] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2021-05-15 22:09:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 22:09:02] [INFO ] [Nat]Absence check using 901 positive place invariants in 159 ms returned sat
[2021-05-15 22:09:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 22:09:02] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2021-05-15 22:09:03] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints (skipped 0 transitions) in 65 ms.
[2021-05-15 22:09:21] [INFO ] Added : 640 causal constraints over 128 iterations in 18948 ms. Result :unknown
[2021-05-15 22:09:22] [INFO ] [Real]Absence check using 901 positive place invariants in 154 ms returned sat
[2021-05-15 22:09:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 22:09:22] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2021-05-15 22:09:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 22:09:23] [INFO ] [Nat]Absence check using 901 positive place invariants in 156 ms returned sat
[2021-05-15 22:09:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 22:09:23] [INFO ] [Nat]Absence check using state equation in 630 ms returned sat
[2021-05-15 22:09:24] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints (skipped 0 transitions) in 61 ms.
[2021-05-15 22:09:42] [INFO ] Added : 670 causal constraints over 134 iterations in 18916 ms. Result :unknown
[2021-05-15 22:09:43] [INFO ] [Real]Absence check using 901 positive place invariants in 159 ms returned sat
[2021-05-15 22:09:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 22:09:43] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2021-05-15 22:09:44] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints (skipped 0 transitions) in 74 ms.
[2021-05-15 22:09:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 22:09:44] [INFO ] [Nat]Absence check using 901 positive place invariants in 159 ms returned sat
[2021-05-15 22:09:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 22:09:45] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2021-05-15 22:09:45] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints (skipped 0 transitions) in 72 ms.
[2021-05-15 22:10:04] [INFO ] Added : 615 causal constraints over 123 iterations in 18942 ms. Result :unknown
[2021-05-15 22:10:04] [INFO ] [Real]Absence check using 901 positive place invariants in 160 ms returned sat
[2021-05-15 22:10:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 22:10:05] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2021-05-15 22:10:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 22:10:05] [INFO ] [Nat]Absence check using 901 positive place invariants in 179 ms returned sat
[2021-05-15 22:10:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 22:10:06] [INFO ] [Nat]Absence check using state equation in 949 ms returned sat
[2021-05-15 22:10:06] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints (skipped 0 transitions) in 72 ms.
[2021-05-15 22:10:25] [INFO ] Added : 635 causal constraints over 127 iterations in 18568 ms. Result :unknown
[2021-05-15 22:10:25] [INFO ] [Real]Absence check using 901 positive place invariants in 154 ms returned sat
[2021-05-15 22:10:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 22:10:26] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2021-05-15 22:10:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 22:10:26] [INFO ] [Nat]Absence check using 901 positive place invariants in 159 ms returned sat
[2021-05-15 22:10:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 22:10:27] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2021-05-15 22:10:27] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints (skipped 0 transitions) in 70 ms.
[2021-05-15 22:10:47] [INFO ] Deduced a trap composed of 3 places in 1102 ms of which 2 ms to minimize.
[2021-05-15 22:10: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 7
[2021-05-15 22:10:48] [INFO ] [Real]Absence check using 901 positive place invariants in 157 ms returned sat
[2021-05-15 22:10:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 22:10:48] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2021-05-15 22:10:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 22:10:49] [INFO ] [Nat]Absence check using 901 positive place invariants in 158 ms returned sat
[2021-05-15 22:10:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 22:10:49] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2021-05-15 22:10:49] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints (skipped 0 transitions) in 70 ms.
[2021-05-15 22:11:09] [INFO ] Deduced a trap composed of 3 places in 1089 ms of which 2 ms to minimize.
[2021-05-15 22:11:09] [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 8
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||X((p1 U p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 99 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2021-05-15 22:11:09] [INFO ] Computed 901 place invariants in 4 ms
[2021-05-15 22:11:11] [INFO ] Implicit Places using invariants in 1192 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2021-05-15 22:11:11] [INFO ] Computed 901 place invariants in 4 ms
[2021-05-15 22:11:13] [INFO ] Implicit Places using invariants and state equation in 2448 ms returned []
Implicit Place search using SMT with State Equation took 3643 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2021-05-15 22:11:13] [INFO ] Computed 901 place invariants in 6 ms
[2021-05-15 22:11:14] [INFO ] Dead Transitions using invariants and state equation in 1055 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-100A-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s606 1), p2:(AND (OR (EQ s1250 0) (EQ s76 1)) (EQ s606 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 7293 ms.
Product exploration explored 100000 steps with 50000 reset in 7308 ms.
Knowledge obtained : [(NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 7067 ms.
Product exploration explored 100000 steps with 50000 reset in 7283 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 1903 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1402
Deduced a syphon composed of 1 places in 4 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1903 transition count 1402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 4 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1903 transition count 1402
Deduced a syphon composed of 2 places in 4 ms
Applied a total of 2 rules in 344 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2021-05-15 22:11:44] [INFO ] Redundant transitions in 96 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2021-05-15 22:11:44] [INFO ] Computed 901 place invariants in 3 ms
[2021-05-15 22:11:45] [INFO ] Dead Transitions using invariants and state equation in 1058 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Product exploration explored 100000 steps with 50000 reset in 7170 ms.
Product exploration explored 100000 steps with 50000 reset in 7347 ms.
[2021-05-15 22:12:00] [INFO ] Flatten gal took : 118 ms
[2021-05-15 22:12:00] [INFO ] Flatten gal took : 114 ms
[2021-05-15 22:12:00] [INFO ] Time to serialize gal into /tmp/LTL7844907933904324995.gal : 46 ms
[2021-05-15 22:12:00] [INFO ] Time to serialize properties into /tmp/LTL9379998336933425873.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/LTL7844907933904324995.gal, -t, CGAL, -LTL, /tmp/LTL9379998336933425873.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/LTL7844907933904324995.gal -t CGAL -LTL /tmp/LTL9379998336933425873.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p606==1)")||(X(("((p1250==0)||(p76==1))")U("(((p1250==0)||(p76==1))&&(p606==1))")))))))
Formula 0 simplified : !XF("(p606==1)" | X("((p1250==0)||(p76==1))" U "(((p1250==0)||(p76==1))&&(p606==1))"))
Detected timeout of ITS tools.
[2021-05-15 22:12:15] [INFO ] Flatten gal took : 109 ms
[2021-05-15 22:12:15] [INFO ] Applying decomposition
[2021-05-15 22:12:15] [INFO ] Flatten gal took : 108 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/graph13808055807142970321.txt, -o, /tmp/graph13808055807142970321.bin, -w, /tmp/graph13808055807142970321.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/graph13808055807142970321.bin, -l, -1, -v, -w, /tmp/graph13808055807142970321.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 22:12:16] [INFO ] Decomposing Gal with order
[2021-05-15 22:12:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 22:12:16] [INFO ] Removed a total of 300 redundant transitions.
[2021-05-15 22:12:16] [INFO ] Flatten gal took : 148 ms
[2021-05-15 22:12:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 172 ms.
[2021-05-15 22:12:16] [INFO ] Time to serialize gal into /tmp/LTL8534959381965816109.gal : 30 ms
[2021-05-15 22:12:16] [INFO ] Time to serialize properties into /tmp/LTL205170600750217403.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/LTL8534959381965816109.gal, -t, CGAL, -LTL, /tmp/LTL205170600750217403.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/LTL8534959381965816109.gal -t CGAL -LTL /tmp/LTL205170600750217403.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i13.i1.i3.u254.p606==1)")||(X(("((i26.i0.i3.u525.p1250==0)||(i1.i1.i2.u31.p76==1))")U("(((i26.i0.i3.u525.p1250==0)||(i1.i1.i2.u31.p76==1))&&(i13.i1.i3.u254.p606==1))")))))))
Formula 0 simplified : !XF("(i13.i1.i3.u254.p606==1)" | X("((i26.i0.i3.u525.p1250==0)||(i1.i1.i2.u31.p76==1))" U "(((i26.i0.i3.u525.p1250==0)||(i1.i1.i2.u31.p76==1))&&(i13.i1.i3.u254.p606==1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
176 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.01101,66864,1,0,97533,989,4264,200490,116,7584,8342
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-100A-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-100A-02 finished in 69139 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U p1))], workingDir=/home/mcc/execution]
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 180 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2021-05-15 22:12:19] [INFO ] Computed 901 place invariants in 5 ms
[2021-05-15 22:12:20] [INFO ] Implicit Places using invariants in 1223 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1228 ms to find 2 implicit places.
[2021-05-15 22:12:20] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 1400 rows 1899 cols
[2021-05-15 22:12:20] [INFO ] Computed 899 place invariants in 3 ms
[2021-05-15 22:12:21] [INFO ] Dead Transitions using invariants and state equation in 1042 ms returned []
Starting structural reductions, iteration 1 : 1899/1903 places, 1400/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 99 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2021-05-15 22:12:21] [INFO ] Computed 899 place invariants in 4 ms
[2021-05-15 22:12:22] [INFO ] Implicit Places using invariants in 1197 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1199 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 1897/1903 places, 1399/1402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 132 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2021-05-15 22:12:22] [INFO ] Computed 898 place invariants in 3 ms
[2021-05-15 22:12:24] [INFO ] Implicit Places using invariants in 1183 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2021-05-15 22:12:24] [INFO ] Computed 898 place invariants in 12 ms
[2021-05-15 22:12:26] [INFO ] Implicit Places using invariants and state equation in 2469 ms returned []
Implicit Place search using SMT with State Equation took 3654 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 1896/1903 places, 1398/1402 transitions.
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-100A-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s781 1), p0:(OR (EQ s1753 0) (EQ s1574 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50000 reset in 6558 ms.
Product exploration explored 100000 steps with 50000 reset in 6738 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 30 ms :[true, (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 6594 ms.
Product exploration explored 100000 steps with 50000 reset in 6717 ms.
[2021-05-15 22:12:53] [INFO ] Flatten gal took : 110 ms
[2021-05-15 22:12:53] [INFO ] Flatten gal took : 109 ms
[2021-05-15 22:12:53] [INFO ] Time to serialize gal into /tmp/LTL17630672600132025380.gal : 7 ms
[2021-05-15 22:12:53] [INFO ] Time to serialize properties into /tmp/LTL15212228842813125744.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/LTL17630672600132025380.gal, -t, CGAL, -LTL, /tmp/LTL15212228842813125744.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/LTL17630672600132025380.gal -t CGAL -LTL /tmp/LTL15212228842813125744.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("((p1753==0)||(p1574==1))")U("(p781==1)")))
Formula 0 simplified : !("((p1753==0)||(p1574==1))" U "(p781==1)")
Detected timeout of ITS tools.
[2021-05-15 22:13:08] [INFO ] Flatten gal took : 101 ms
[2021-05-15 22:13:08] [INFO ] Applying decomposition
[2021-05-15 22:13:08] [INFO ] Flatten gal took : 105 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/graph2550474891313364118.txt, -o, /tmp/graph2550474891313364118.bin, -w, /tmp/graph2550474891313364118.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/graph2550474891313364118.bin, -l, -1, -v, -w, /tmp/graph2550474891313364118.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 22:13:08] [INFO ] Decomposing Gal with order
[2021-05-15 22:13:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 22:13:09] [INFO ] Removed a total of 299 redundant transitions.
[2021-05-15 22:13:09] [INFO ] Flatten gal took : 104 ms
[2021-05-15 22:13:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 61 ms.
[2021-05-15 22:13:09] [INFO ] Time to serialize gal into /tmp/LTL16778532150475765020.gal : 20 ms
[2021-05-15 22:13:09] [INFO ] Time to serialize properties into /tmp/LTL4924795107600283122.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/LTL16778532150475765020.gal, -t, CGAL, -LTL, /tmp/LTL4924795107600283122.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/LTL16778532150475765020.gal -t CGAL -LTL /tmp/LTL4924795107600283122.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((("((i39.u738.p1753==0)||(i35.i0.i1.u662.p1574==1))")U("(i17.i1.i0.u328.p781==1)")))
Formula 0 simplified : !("((i39.u738.p1753==0)||(i35.i0.i1.u662.p1574==1))" U "(i17.i1.i0.u328.p781==1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
180 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.05387,65364,1,0,92898,538,4447,197191,118,2470,8752
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-100A-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-100A-03 finished in 52482 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0&&X(p1)))&&((!p1 U p2)||F(p3))))], workingDir=/home/mcc/execution]
Support contains 7 out of 1903 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 37 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2021-05-15 22:13:11] [INFO ] Computed 901 place invariants in 3 ms
[2021-05-15 22:13:12] [INFO ] Implicit Places using invariants in 1116 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2021-05-15 22:13:12] [INFO ] Computed 901 place invariants in 3 ms
[2021-05-15 22:13:15] [INFO ] Implicit Places using invariants and state equation in 2466 ms returned []
Implicit Place search using SMT with State Equation took 3583 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2021-05-15 22:13:15] [INFO ] Computed 901 place invariants in 3 ms
[2021-05-15 22:13:16] [INFO ] Dead Transitions using invariants and state equation in 1079 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (NOT p3)), true]
Running random walk in product with property : ShieldIIPt-PT-100A-04 automaton TGBA [mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND p0 p2) (AND p0 p3)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND p0 p2 p1) (AND p0 p1 p3)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p1 p3), acceptance={0} source=3 dest: 0}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s1638 0) (EQ s889 1)), p1:(AND (NEQ s80 0) (NEQ s1408 1)), p2:(AND (OR (EQ s1291 0) (EQ s331 1)) (OR (EQ s1427 0) (EQ s331 1))), p3:(OR (EQ s1291 0) (EQ s331 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-100A-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100A-04 finished in 4858 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1903 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1902 transition count 1400
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1900 transition count 1400
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1898 transition count 1399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 1898 transition count 1398
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1897 transition count 1398
Applied a total of 8 rules in 142 ms. Remains 1897 /1903 variables (removed 6) and now considering 1398/1402 (removed 4) transitions.
// Phase 1: matrix 1398 rows 1897 cols
[2021-05-15 22:13:16] [INFO ] Computed 899 place invariants in 3 ms
[2021-05-15 22:13:17] [INFO ] Implicit Places using invariants in 1218 ms returned [1886]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1219 ms to find 1 implicit places.
[2021-05-15 22:13:17] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2021-05-15 22:13:17] [INFO ] Computed 898 place invariants in 3 ms
[2021-05-15 22:13:18] [INFO ] Dead Transitions using invariants and state equation in 1115 ms returned []
Starting structural reductions, iteration 1 : 1896/1903 places, 1398/1402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1895 transition count 1397
Applied a total of 2 rules in 104 ms. Remains 1895 /1896 variables (removed 1) and now considering 1397/1398 (removed 1) transitions.
// Phase 1: matrix 1397 rows 1895 cols
[2021-05-15 22:13:18] [INFO ] Computed 898 place invariants in 2 ms
[2021-05-15 22:13:19] [INFO ] Implicit Places using invariants in 1112 ms returned []
// Phase 1: matrix 1397 rows 1895 cols
[2021-05-15 22:13:19] [INFO ] Computed 898 place invariants in 2 ms
[2021-05-15 22:13:21] [INFO ] Implicit Places using invariants and state equation in 1997 ms returned []
Implicit Place search using SMT with State Equation took 3111 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1895/1903 places, 1397/1402 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100A-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1507 0) (EQ s367 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1464 ms.
Product exploration explored 100000 steps with 0 reset in 1972 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1482 ms.
Stack based approach found an accepted trace after 8937 steps with 0 reset with depth 8938 and stack size 3737 in 163 ms.
FORMULA ShieldIIPt-PT-100A-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100A-05 finished in 14383 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (p1||G(p0)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1903 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 38 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2021-05-15 22:13:30] [INFO ] Computed 901 place invariants in 3 ms
[2021-05-15 22:13:31] [INFO ] Implicit Places using invariants in 1169 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2021-05-15 22:13:31] [INFO ] Computed 901 place invariants in 3 ms
[2021-05-15 22:13:34] [INFO ] Implicit Places using invariants and state equation in 2424 ms returned []
Implicit Place search using SMT with State Equation took 3595 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2021-05-15 22:13:34] [INFO ] Computed 901 place invariants in 4 ms
[2021-05-15 22:13:35] [INFO ] Dead Transitions using invariants and state equation in 1066 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-100A-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NEQ s1198 0) (NEQ s1742 1) (OR (NEQ s1501 0) (NEQ s927 1) (NEQ s308 1))), p0:(OR (NEQ s1501 0) (NEQ s927 1) (NEQ s308 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1423 ms.
Product exploration explored 100000 steps with 0 reset in 1853 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 53 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1427 ms.
Product exploration explored 100000 steps with 0 reset in 1852 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 52 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 1903 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1402
Deduced a syphon composed of 1 places in 3 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1903 transition count 1402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1903 transition count 1402
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 125 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2021-05-15 22:13:45] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2021-05-15 22:13:45] [INFO ] Computed 901 place invariants in 4 ms
[2021-05-15 22:13:46] [INFO ] Dead Transitions using invariants and state equation in 1062 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Product exploration explored 100000 steps with 0 reset in 1451 ms.
Product exploration explored 100000 steps with 0 reset in 1844 ms.
[2021-05-15 22:13:49] [INFO ] Flatten gal took : 101 ms
[2021-05-15 22:13:50] [INFO ] Flatten gal took : 107 ms
[2021-05-15 22:13:50] [INFO ] Time to serialize gal into /tmp/LTL8426012208164941171.gal : 4 ms
[2021-05-15 22:13:50] [INFO ] Time to serialize properties into /tmp/LTL9141805540509626449.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/LTL8426012208164941171.gal, -t, CGAL, -LTL, /tmp/LTL9141805540509626449.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/LTL8426012208164941171.gal -t CGAL -LTL /tmp/LTL9141805540509626449.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(((p1501==1)||(p927==0))||(p308==0))")U((G("(((p1501==1)||(p927==0))||(p308==0))"))||("(((p1198==1)&&(p1742==0))&&(((p1501==1)||(p927==0))||(p308==0)))")))))
Formula 0 simplified : !X("(((p1501==1)||(p927==0))||(p308==0))" U ("(((p1198==1)&&(p1742==0))&&(((p1501==1)||(p927==0))||(p308==0)))" | G"(((p1501==1)||(p927==0))||(p308==0))"))
Detected timeout of ITS tools.
[2021-05-15 22:14:05] [INFO ] Flatten gal took : 99 ms
[2021-05-15 22:14:05] [INFO ] Applying decomposition
[2021-05-15 22:14:05] [INFO ] Flatten gal took : 100 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/graph12445630013669894389.txt, -o, /tmp/graph12445630013669894389.bin, -w, /tmp/graph12445630013669894389.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/graph12445630013669894389.bin, -l, -1, -v, -w, /tmp/graph12445630013669894389.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 22:14:05] [INFO ] Decomposing Gal with order
[2021-05-15 22:14:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 22:14:05] [INFO ] Removed a total of 300 redundant transitions.
[2021-05-15 22:14:05] [INFO ] Flatten gal took : 89 ms
[2021-05-15 22:14:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 56 ms.
[2021-05-15 22:14:10] [INFO ] Time to serialize gal into /tmp/LTL2633229242657537916.gal : 4641 ms
[2021-05-15 22:14:10] [INFO ] Time to serialize properties into /tmp/LTL1913387832396556537.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/LTL2633229242657537916.gal, -t, CGAL, -LTL, /tmp/LTL1913387832396556537.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/LTL2633229242657537916.gal -t CGAL -LTL /tmp/LTL1913387832396556537.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(((i33.i1.i1.u631.p1501==1)||(i20.i0.i2.u389.p927==0))||(i6.i0.i1.u129.p308==0))")U((G("(((i33.i1.i1.u631.p1501==1)||(i20.i0.i2.u389.p927==0))||(i6.i0.i1.u129.p308==0))"))||("(((i26.i1.i2.u504.p1198==1)&&(i39.i0.i0.u732.p1742==0))&&(((i33.i1.i1.u631.p1501==1)||(i20.i0.i2.u389.p927==0))||(i6.i0.i1.u129.p308==0)))")))))
Formula 0 simplified : !X("(((i33.i1.i1.u631.p1501==1)||(i20.i0.i2.u389.p927==0))||(i6.i0.i1.u129.p308==0))" U ("(((i26.i1.i2.u504.p1198==1)&&(i39.i0.i0.u732.p1742==0))&&(((i33.i1.i1.u631.p1501==1)||(i20.i0.i2.u389.p927==0))||(i6.i0.i1.u129.p308==0)))" | G"(((i33.i1.i1.u631.p1501==1)||(i20.i0.i2.u389.p927==0))||(i6.i0.i1.u129.p308==0))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin287007639158037878
[2021-05-15 22:14:25] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin287007639158037878
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/ltsmin287007639158037878]
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/ltsmin287007639158037878] 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/ltsmin287007639158037878] 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 ShieldIIPt-PT-100A-06 finished in 55800 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1903 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 191 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2021-05-15 22:14:26] [INFO ] Computed 901 place invariants in 15 ms
[2021-05-15 22:14:27] [INFO ] Implicit Places using invariants in 1254 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1256 ms to find 2 implicit places.
[2021-05-15 22:14:27] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1400 rows 1899 cols
[2021-05-15 22:14:27] [INFO ] Computed 899 place invariants in 26 ms
[2021-05-15 22:14:28] [INFO ] Dead Transitions using invariants and state equation in 1009 ms returned []
Starting structural reductions, iteration 1 : 1899/1903 places, 1400/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 73 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2021-05-15 22:14:29] [INFO ] Computed 899 place invariants in 3 ms
[2021-05-15 22:14:30] [INFO ] Implicit Places using invariants in 1176 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1177 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 1897/1903 places, 1399/1402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 90 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2021-05-15 22:14:30] [INFO ] Computed 898 place invariants in 3 ms
[2021-05-15 22:14:31] [INFO ] Implicit Places using invariants in 1168 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2021-05-15 22:14:31] [INFO ] Computed 898 place invariants in 2 ms
[2021-05-15 22:14:33] [INFO ] Implicit Places using invariants and state equation in 2474 ms returned []
Implicit Place search using SMT with State Equation took 3643 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 1896/1903 places, 1398/1402 transitions.
Stuttering acceptance computed with spot in 1739 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-100A-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NEQ s1178 0) (NEQ s1855 1)), p1:(AND (EQ s1855 0) (EQ s1178 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1416 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 1 ms.
FORMULA ShieldIIPt-PT-100A-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100A-07 finished in 10638 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))&&(X(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1903 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 36 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2021-05-15 22:14:37] [INFO ] Computed 901 place invariants in 3 ms
[2021-05-15 22:14:38] [INFO ] Implicit Places using invariants in 1127 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2021-05-15 22:14:38] [INFO ] Computed 901 place invariants in 3 ms
[2021-05-15 22:14:40] [INFO ] Implicit Places using invariants and state equation in 2501 ms returned []
Implicit Place search using SMT with State Equation took 3645 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2021-05-15 22:14:40] [INFO ] Computed 901 place invariants in 3 ms
[2021-05-15 22:14:41] [INFO ] Dead Transitions using invariants and state equation in 1065 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 7445 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-100A-10 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (NEQ s1555 0) (NEQ s1782 1)), p0:(AND (NEQ s901 0) (NEQ s793 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-100A-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100A-10 finished in 12220 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 1903 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 98 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2021-05-15 22:14:49] [INFO ] Computed 901 place invariants in 3 ms
[2021-05-15 22:14:50] [INFO ] Implicit Places using invariants in 1207 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1208 ms to find 2 implicit places.
[2021-05-15 22:14:50] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1400 rows 1899 cols
[2021-05-15 22:14:50] [INFO ] Computed 899 place invariants in 2 ms
[2021-05-15 22:14:51] [INFO ] Dead Transitions using invariants and state equation in 1006 ms returned []
Starting structural reductions, iteration 1 : 1899/1903 places, 1400/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 58 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2021-05-15 22:14:51] [INFO ] Computed 899 place invariants in 2 ms
[2021-05-15 22:14:52] [INFO ] Implicit Places using invariants in 1161 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1162 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 1897/1903 places, 1399/1402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 93 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2021-05-15 22:14:52] [INFO ] Computed 898 place invariants in 3 ms
[2021-05-15 22:14:54] [INFO ] Implicit Places using invariants in 1213 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2021-05-15 22:14:54] [INFO ] Computed 898 place invariants in 2 ms
[2021-05-15 22:14:56] [INFO ] Implicit Places using invariants and state equation in 2447 ms returned []
Implicit Place search using SMT with State Equation took 3661 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 1896/1903 places, 1398/1402 transitions.
Stuttering acceptance computed with spot in 7341 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100A-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}]], initial=1, aps=[p0:(NEQ s891 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-100A-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100A-13 finished in 14669 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1903 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 96 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2021-05-15 22:15:04] [INFO ] Computed 901 place invariants in 3 ms
[2021-05-15 22:15:05] [INFO ] Implicit Places using invariants in 1185 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1187 ms to find 2 implicit places.
[2021-05-15 22:15:05] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1400 rows 1899 cols
[2021-05-15 22:15:05] [INFO ] Computed 899 place invariants in 3 ms
[2021-05-15 22:15:06] [INFO ] Dead Transitions using invariants and state equation in 1007 ms returned []
Starting structural reductions, iteration 1 : 1899/1903 places, 1400/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 57 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2021-05-15 22:15:06] [INFO ] Computed 899 place invariants in 3 ms
[2021-05-15 22:15:07] [INFO ] Implicit Places using invariants in 1171 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1172 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 1897/1903 places, 1399/1402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 90 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2021-05-15 22:15:07] [INFO ] Computed 898 place invariants in 3 ms
[2021-05-15 22:15:08] [INFO ] Implicit Places using invariants in 1168 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2021-05-15 22:15:08] [INFO ] Computed 898 place invariants in 3 ms
[2021-05-15 22:15:11] [INFO ] Implicit Places using invariants and state equation in 2427 ms returned []
Implicit Place search using SMT with State Equation took 3597 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 1896/1903 places, 1398/1402 transitions.
Stuttering acceptance computed with spot in 8092 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100A-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s860 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1401 ms.
Product exploration explored 100000 steps with 0 reset in 1809 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1393 ms.
Product exploration explored 100000 steps with 0 reset in 1792 ms.
[2021-05-15 22:15:25] [INFO ] Flatten gal took : 97 ms
[2021-05-15 22:15:26] [INFO ] Flatten gal took : 98 ms
[2021-05-15 22:15:26] [INFO ] Time to serialize gal into /tmp/LTL17300260827101666734.gal : 4 ms
[2021-05-15 22:15:26] [INFO ] Time to serialize properties into /tmp/LTL4945319352037044645.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/LTL17300260827101666734.gal, -t, CGAL, -LTL, /tmp/LTL4945319352037044645.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/LTL17300260827101666734.gal -t CGAL -LTL /tmp/LTL4945319352037044645.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(p860==1)"))))
Formula 0 simplified : !FG"(p860==1)"
Detected timeout of ITS tools.
[2021-05-15 22:15:41] [INFO ] Flatten gal took : 98 ms
[2021-05-15 22:15:41] [INFO ] Applying decomposition
[2021-05-15 22:15:41] [INFO ] Flatten gal took : 98 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/graph6338674182513333528.txt, -o, /tmp/graph6338674182513333528.bin, -w, /tmp/graph6338674182513333528.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/graph6338674182513333528.bin, -l, -1, -v, -w, /tmp/graph6338674182513333528.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 22:15:41] [INFO ] Decomposing Gal with order
[2021-05-15 22:15:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 22:15:41] [INFO ] Removed a total of 299 redundant transitions.
[2021-05-15 22:15:41] [INFO ] Flatten gal took : 83 ms
[2021-05-15 22:15:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 68 ms.
[2021-05-15 22:15:49] [INFO ] Time to serialize gal into /tmp/LTL7307773919496031211.gal : 7363 ms
[2021-05-15 22:15:49] [INFO ] Time to serialize properties into /tmp/LTL10739908080964000408.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/LTL7307773919496031211.gal, -t, CGAL, -LTL, /tmp/LTL10739908080964000408.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/LTL7307773919496031211.gal -t CGAL -LTL /tmp/LTL10739908080964000408.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("(i19.i1.i2.u362.p860==1)"))))
Formula 0 simplified : !FG"(i19.i1.i2.u362.p860==1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18010199610833579136
[2021-05-15 22:16:04] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18010199610833579136
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/ltsmin18010199610833579136]
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/ltsmin18010199610833579136] 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/ltsmin18010199610833579136] 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 ShieldIIPt-PT-100A-14 finished in 61179 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7074927154691281123
[2021-05-15 22:16:05] [INFO ] Computing symmetric may disable matrix : 1402 transitions.
[2021-05-15 22:16:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 22:16:05] [INFO ] Computing symmetric may enable matrix : 1402 transitions.
[2021-05-15 22:16:05] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 22:16:05] [INFO ] Applying decomposition
[2021-05-15 22:16:05] [INFO ] Flatten gal took : 126 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/graph3957524404288820353.txt, -o, /tmp/graph3957524404288820353.bin, -w, /tmp/graph3957524404288820353.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/graph3957524404288820353.bin, -l, -1, -v, -w, /tmp/graph3957524404288820353.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 22:16:05] [INFO ] Decomposing Gal with order
[2021-05-15 22:16:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 22:16:05] [INFO ] Computing Do-Not-Accords matrix : 1402 transitions.
[2021-05-15 22:16:05] [INFO ] Computation of Completed DNA matrix. took 58 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 22:16:05] [INFO ] Built C files in 558ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7074927154691281123
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/ltsmin7074927154691281123]
[2021-05-15 22:16:05] [INFO ] Removed a total of 300 redundant transitions.
[2021-05-15 22:16:05] [INFO ] Flatten gal took : 131 ms
[2021-05-15 22:16:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 56 ms.
[2021-05-15 22:16:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality1031039891070915657.gal : 13 ms
[2021-05-15 22:16:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality17709403134723221346.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/LTLCardinality1031039891070915657.gal, -t, CGAL, -LTL, /tmp/LTLCardinality17709403134723221346.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/LTLCardinality1031039891070915657.gal -t CGAL -LTL /tmp/LTLCardinality17709403134723221346.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((X(("((!((i34.i1.i2.u631.p1501==0)&&(i21.i0.i3.u389.p927==1)))||(i6.i1.i1.u129.p308!=1))")U(("((!((i28.u504.p1198==0)||(i41.i0.i0.u732.p1742==1)))&&((!((i34.i1.i2.u631.p1501==0)&&(i21.i0.i3.u389.p927==1)))||(i6.i1.i1.u129.p308!=1)))")||(G("((!((i34.i1.i2.u631.p1501==0)&&(i21.i0.i3.u389.p927==1)))||(i6.i1.i1.u129.p308!=1))"))))))
Formula 0 simplified : !X("((!((i34.i1.i2.u631.p1501==0)&&(i21.i0.i3.u389.p927==1)))||(i6.i1.i1.u129.p308!=1))" U ("((!((i28.u504.p1198==0)||(i41.i0.i0.u732.p1742==1)))&&((!((i34.i1.i2.u631.p1501==0)&&(i21.i0.i3.u389.p927==1)))||(i6.i1.i1.u129.p308!=1)))" | G"((!((i34.i1.i2.u631.p1501==0)&&(i21.i0.i3.u389.p927==1)))||(i6.i1.i1.u129.p308!=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 15728 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7074927154691281123]
Link finished in 89 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) U ((LTLAPp1==true)||[]((LTLAPp0==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7074927154691281123]
WARNING : LTSmin timed out (>400 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) U ((LTLAPp1==true)||[]((LTLAPp0==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7074927154691281123]
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, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7074927154691281123]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
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: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.094: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.102: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.128: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.158: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.170: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.170: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.179: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.179: Initializing POR dependencies: labels 1405, guards 1402
pins2lts-mc-linux64( 7/ 8), 0.189: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 28.774: LTL layer: formula: <>([]((LTLAPp2==true)))
pins2lts-mc-linux64( 0/ 8), 28.774: "<>([]((LTLAPp2==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 28.775: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 28.802: buchi has 2 states
pins2lts-mc-linux64( 0/ 8), 30.196: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 30.293: There are 1406 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 30.293: State length is 1904, there are 1406 groups
pins2lts-mc-linux64( 0/ 8), 30.293: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 30.293: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 30.293: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 30.293: Visible groups: 3 / 1406, labels: 1 / 1406
pins2lts-mc-linux64( 0/ 8), 30.293: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 30.293: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 30.470: [Blue] ~120 levels ~960 states ~2104 transitions
pins2lts-mc-linux64( 5/ 8), 30.561: [Blue] ~240 levels ~1920 states ~4184 transitions
pins2lts-mc-linux64( 4/ 8), 30.714: [Blue] ~476 levels ~3840 states ~7688 transitions
pins2lts-mc-linux64( 4/ 8), 31.008: [Blue] ~950 levels ~7680 states ~15936 transitions
pins2lts-mc-linux64( 4/ 8), 31.689: [Blue] ~1891 levels ~15360 states ~32296 transitions
pins2lts-mc-linux64( 4/ 8), 33.150: [Blue] ~3802 levels ~30720 states ~68032 transitions
pins2lts-mc-linux64( 4/ 8), 36.039: [Blue] ~7623 levels ~61440 states ~140904 transitions
pins2lts-mc-linux64( 5/ 8), 41.778: [Blue] ~15330 levels ~122880 states ~297368 transitions
pins2lts-mc-linux64( 5/ 8), 55.236: [Blue] ~30682 levels ~245760 states ~594864 transitions
pins2lts-mc-linux64( 5/ 8), 85.141: [Blue] ~61378 levels ~491520 states ~1194760 transitions
pins2lts-mc-linux64( 0/ 8), 141.943: [Blue] ~122860 levels ~983040 states ~2854728 transitions
pins2lts-mc-linux64( 0/ 8), 260.378: [Blue] ~245727 levels ~1966080 states ~5552704 transitions
pins2lts-mc-linux64( 7/ 8), 371.784: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 372.094:
pins2lts-mc-linux64( 0/ 8), 372.094: Explored 2569794 states 8400209 transitions, fanout: 3.269
pins2lts-mc-linux64( 0/ 8), 372.094: Total exploration time 341.780 sec (341.490 sec minimum, 341.580 sec on average)
pins2lts-mc-linux64( 0/ 8), 372.094: States per second: 7519, Transitions per second: 24578
pins2lts-mc-linux64( 0/ 8), 372.094:
pins2lts-mc-linux64( 0/ 8), 372.094: State space has 11047360 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 372.094: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 372.094: blue states: 2569794 (23.26%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 372.094: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 372.094: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 372.094:
pins2lts-mc-linux64( 0/ 8), 372.094: Total memory used for local state coloring: 39.2MB
pins2lts-mc-linux64( 0/ 8), 372.094:
pins2lts-mc-linux64( 0/ 8), 372.094: Queue width: 8B, total height: 2569146, memory: 19.60MB
pins2lts-mc-linux64( 0/ 8), 372.094: Tree memory: 340.3MB, 32.3 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 372.094: Tree fill ratio (roots/leafs): 8.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 372.094: Stored 1429 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 372.094: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 372.094: Est. total memory use: 359.9MB (~1043.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, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7074927154691281123]
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, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7074927154691281123]
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:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-15 22:38:51] [INFO ] Applying decomposition
[2021-05-15 22:38:51] [INFO ] Flatten gal took : 113 ms
[2021-05-15 22:38:51] [INFO ] Decomposing Gal with order
[2021-05-15 22:38:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 22:38:51] [INFO ] Removed a total of 400 redundant transitions.
[2021-05-15 22:38:51] [INFO ] Flatten gal took : 86 ms
[2021-05-15 22:38:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 51 ms.
[2021-05-15 22:38:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality9267226355271902388.gal : 12 ms
[2021-05-15 22:38:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality4852180032466173535.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/LTLCardinality9267226355271902388.gal, -t, CGAL, -LTL, /tmp/LTLCardinality4852180032466173535.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/LTLCardinality9267226355271902388.gal -t CGAL -LTL /tmp/LTLCardinality4852180032466173535.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((X(("((!((u790.p1501==0)&&(u488.p927==1)))||(u162.p308!=1))")U(("((!((u631.p1198==0)||(u917.p1742==1)))&&((!((u790.p1501==0)&&(u488.p927==1)))||(u162.p308!=1)))")||(G("((!((u790.p1501==0)&&(u488.p927==1)))||(u162.p308!=1))"))))))
Formula 0 simplified : !X("((!((u790.p1501==0)&&(u488.p927==1)))||(u162.p308!=1))" U ("((!((u631.p1198==0)||(u917.p1742==1)))&&((!((u790.p1501==0)&&(u488.p927==1)))||(u162.p308!=1)))" | G"((!((u790.p1501==0)&&(u488.p927==1)))||(u162.p308!=1))"))
Detected timeout of ITS tools.
[2021-05-15 23:01:53] [INFO ] Flatten gal took : 845 ms
[2021-05-15 23:01:54] [INFO ] Input system was already deterministic with 1402 transitions.
[2021-05-15 23:01:54] [INFO ] Transformed 1903 places.
[2021-05-15 23:01:54] [INFO ] Transformed 1402 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-15 23:01:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality6641149372677900571.gal : 7 ms
[2021-05-15 23:01:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality4459802439760102985.ltl : 2 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/LTLCardinality6641149372677900571.gal, -t, CGAL, -LTL, /tmp/LTLCardinality4459802439760102985.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/LTLCardinality6641149372677900571.gal -t CGAL -LTL /tmp/LTLCardinality4459802439760102985.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(("((!((p1501==0)&&(p927==1)))||(p308!=1))")U(("((!((p1198==0)||(p1742==1)))&&((!((p1501==0)&&(p927==1)))||(p308!=1)))")||(G("((!((p1501==0)&&(p927==1)))||(p308!=1))"))))))
Formula 0 simplified : !X("((!((p1501==0)&&(p927==1)))||(p308!=1))" U ("((!((p1198==0)||(p1742==1)))&&((!((p1501==0)&&(p927==1)))||(p308!=1)))" | G"((!((p1501==0)&&(p927==1)))||(p308!=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-100A, 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 r216-tall-162098205200500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-100A.tgz
mv ShieldIIPt-PT-100A 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 ;