fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r216-tall-162098204800245
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ShieldIIPs-PT-010A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16236.292 3600000.00 10128964.00 46887.50 F?F?F?F?FTFFTFFF normal

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-162098204800245.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 ShieldIIPs-PT-010A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098204800245
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 117K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 11:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 11:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 17:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 17:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 84K 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 ShieldIIPs-PT-010A-00
FORMULA_NAME ShieldIIPs-PT-010A-01
FORMULA_NAME ShieldIIPs-PT-010A-02
FORMULA_NAME ShieldIIPs-PT-010A-03
FORMULA_NAME ShieldIIPs-PT-010A-04
FORMULA_NAME ShieldIIPs-PT-010A-05
FORMULA_NAME ShieldIIPs-PT-010A-06
FORMULA_NAME ShieldIIPs-PT-010A-07
FORMULA_NAME ShieldIIPs-PT-010A-08
FORMULA_NAME ShieldIIPs-PT-010A-09
FORMULA_NAME ShieldIIPs-PT-010A-10
FORMULA_NAME ShieldIIPs-PT-010A-11
FORMULA_NAME ShieldIIPs-PT-010A-12
FORMULA_NAME ShieldIIPs-PT-010A-13
FORMULA_NAME ShieldIIPs-PT-010A-14
FORMULA_NAME ShieldIIPs-PT-010A-15

=== Now, execution of the tool begins

BK_START 1621063897094

Running Version 0
[2021-05-15 07:31:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-15 07:31:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 07:31:50] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2021-05-15 07:31:50] [INFO ] Transformed 253 places.
[2021-05-15 07:31:50] [INFO ] Transformed 243 transitions.
[2021-05-15 07:31:50] [INFO ] Found NUPN structural information;
[2021-05-15 07:31:50] [INFO ] Parsed PT model containing 253 places and 243 transitions in 101 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 07:31:50] [INFO ] Initial state test concluded for 2 properties.
Support contains 59 out of 253 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 20 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
// Phase 1: matrix 243 rows 253 cols
[2021-05-15 07:31:50] [INFO ] Computed 91 place invariants in 15 ms
[2021-05-15 07:31:50] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 243 rows 253 cols
[2021-05-15 07:31:50] [INFO ] Computed 91 place invariants in 10 ms
[2021-05-15 07:31:51] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
// Phase 1: matrix 243 rows 253 cols
[2021-05-15 07:31:51] [INFO ] Computed 91 place invariants in 5 ms
[2021-05-15 07:31:51] [INFO ] Dead Transitions using invariants and state equation in 161 ms returned []
Finished structural reductions, in 1 iterations. Remains : 253/253 places, 243/243 transitions.
[2021-05-15 07:31:51] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-15 07:31:51] [INFO ] Flatten gal took : 62 ms
FORMULA ShieldIIPs-PT-010A-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010A-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010A-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010A-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 07:31:51] [INFO ] Flatten gal took : 27 ms
[2021-05-15 07:31:51] [INFO ] Input system was already deterministic with 243 transitions.
Finished random walk after 4614 steps, including 8 resets, run visited all 23 properties in 47 ms. (steps per millisecond=98 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 18 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
// Phase 1: matrix 243 rows 253 cols
[2021-05-15 07:31:51] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 07:31:51] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 243 rows 253 cols
[2021-05-15 07:31:51] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 07:31:52] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
// Phase 1: matrix 243 rows 253 cols
[2021-05-15 07:31:52] [INFO ] Computed 91 place invariants in 3 ms
[2021-05-15 07:31:52] [INFO ] Dead Transitions using invariants and state equation in 173 ms returned []
Finished structural reductions, in 1 iterations. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ShieldIIPs-PT-010A-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s8 1) (EQ s22 1)), p1:(OR (NEQ s205 1) (NEQ s218 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-010A-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-00 finished in 875 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 253 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 253/253 places, 243/243 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 253 transition count 242
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 252 transition count 242
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 251 transition count 241
Applied a total of 4 rules in 37 ms. Remains 251 /253 variables (removed 2) and now considering 241/243 (removed 2) transitions.
// Phase 1: matrix 241 rows 251 cols
[2021-05-15 07:31:52] [INFO ] Computed 91 place invariants in 1 ms
[2021-05-15 07:31:52] [INFO ] Implicit Places using invariants in 133 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 136 ms to find 1 implicit places.
[2021-05-15 07:31:52] [INFO ] Redundant transitions in 35 ms returned [233]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[233]
// Phase 1: matrix 240 rows 250 cols
[2021-05-15 07:31:52] [INFO ] Computed 90 place invariants in 1 ms
[2021-05-15 07:31:52] [INFO ] Dead Transitions using invariants and state equation in 142 ms returned []
Starting structural reductions, iteration 1 : 250/253 places, 240/243 transitions.
Applied a total of 0 rules in 12 ms. Remains 250 /250 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2021-05-15 07:31:52] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 240 rows 250 cols
[2021-05-15 07:31:52] [INFO ] Computed 90 place invariants in 2 ms
[2021-05-15 07:31:53] [INFO ] Dead Transitions using invariants and state equation in 143 ms returned []
Finished structural reductions, in 2 iterations. Remains : 250/253 places, 240/243 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-010A-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s151 1) (AND (EQ s236 1) (EQ s237 1) (EQ s249 1))), p1:(OR (EQ s111 0) (EQ s117 0) (EQ s127 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 290 reset in 600 ms.
Product exploration explored 100000 steps with 294 reset in 486 ms.
Knowledge obtained : [(NOT p0), p1]
java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, -F, /tmp/curaut11669096717342505713.hoa, --complement], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:138)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:112)
at fr.lip6.move.gal.application.SpotRunner.buildComplement(SpotRunner.java:532)
at fr.lip6.move.gal.application.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:367)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:174)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 295 reset in 379 ms.
Product exploration explored 100000 steps with 302 reset in 427 ms.
[2021-05-15 07:32:06] [INFO ] Flatten gal took : 22 ms
[2021-05-15 07:32:06] [INFO ] Flatten gal took : 23 ms
[2021-05-15 07:32:06] [INFO ] Time to serialize gal into /tmp/LTL3874033343083825319.gal : 9 ms
[2021-05-15 07:32:06] [INFO ] Time to serialize properties into /tmp/LTL2034449099914135692.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/LTL3874033343083825319.gal, -t, CGAL, -LTL, /tmp/LTL2034449099914135692.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/LTL3874033343083825319.gal -t CGAL -LTL /tmp/LTL2034449099914135692.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("((p151==1)||(((p236==1)&&(p240==1))&&(p252==1)))"))||(G(F("(((p111==0)||(p117==0))||(p127==0))"))))))
Formula 0 simplified : !F(G"((p151==1)||(((p236==1)&&(p240==1))&&(p252==1)))" | GF"(((p111==0)||(p117==0))||(p127==0))")
Detected timeout of ITS tools.
[2021-05-15 07:32:21] [INFO ] Flatten gal took : 25 ms
[2021-05-15 07:32:21] [INFO ] Applying decomposition
[2021-05-15 07:32:21] [INFO ] Flatten gal took : 19 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/graph2085426056735887315.txt, -o, /tmp/graph2085426056735887315.bin, -w, /tmp/graph2085426056735887315.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/graph2085426056735887315.bin, -l, -1, -v, -w, /tmp/graph2085426056735887315.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 07:32:21] [INFO ] Decomposing Gal with order
[2021-05-15 07:32:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 07:32:21] [INFO ] Removed a total of 155 redundant transitions.
[2021-05-15 07:32:21] [INFO ] Flatten gal took : 60 ms
[2021-05-15 07:32:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 148 labels/synchronizations in 18 ms.
[2021-05-15 07:32:21] [INFO ] Time to serialize gal into /tmp/LTL3569016992463640803.gal : 8 ms
[2021-05-15 07:32:21] [INFO ] Time to serialize properties into /tmp/LTL9584928064794084793.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/LTL3569016992463640803.gal, -t, CGAL, -LTL, /tmp/LTL9584928064794084793.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/LTL3569016992463640803.gal -t CGAL -LTL /tmp/LTL9584928064794084793.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G("((i5.i1.u54.p151==1)||(((i9.i1.u85.p236==1)&&(i9.i1.u86.p240==1))&&(i9.i1.u89.p252==1)))"))||(G(F("(((i4.i1.u40.p111==0)||(i4.i1.u42.p117==0))||(i4.i2.u45.p127==0))"))))))
Formula 0 simplified : !F(G"((i5.i1.u54.p151==1)||(((i9.i1.u85.p236==1)&&(i9.i1.u86.p240==1))&&(i9.i1.u89.p252==1)))" | GF"(((i4.i1.u40.p111==0)||(i4.i1.u42.p117==0))||(i4.i2.u45.p127==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3466389497858017944
[2021-05-15 07:32:36] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3466389497858017944
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/ltsmin3466389497858017944]
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/ltsmin3466389497858017944] 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/ltsmin3466389497858017944] 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 ShieldIIPs-PT-010A-01 finished in 45333 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0)) U (p1 U p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 253 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 3 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
// Phase 1: matrix 243 rows 253 cols
[2021-05-15 07:32:37] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 07:32:38] [INFO ] Implicit Places using invariants in 227 ms returned []
// Phase 1: matrix 243 rows 253 cols
[2021-05-15 07:32:38] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 07:32:38] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
// Phase 1: matrix 243 rows 253 cols
[2021-05-15 07:32:38] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 07:32:38] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 1 iterations. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-010A-02 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s228 1) (EQ s249 1)), p1:(EQ s141 1), p0:(AND (EQ s157 1) (EQ s159 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 ShieldIIPs-PT-010A-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-02 finished in 768 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 253/253 places, 243/243 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 253 transition count 242
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 252 transition count 242
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 251 transition count 241
Applied a total of 4 rules in 20 ms. Remains 251 /253 variables (removed 2) and now considering 241/243 (removed 2) transitions.
// Phase 1: matrix 241 rows 251 cols
[2021-05-15 07:32:38] [INFO ] Computed 91 place invariants in 1 ms
[2021-05-15 07:32:38] [INFO ] Implicit Places using invariants in 117 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 118 ms to find 1 implicit places.
[2021-05-15 07:32:38] [INFO ] Redundant transitions in 24 ms returned [233]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[233]
// Phase 1: matrix 240 rows 250 cols
[2021-05-15 07:32:38] [INFO ] Computed 90 place invariants in 1 ms
[2021-05-15 07:32:38] [INFO ] Dead Transitions using invariants and state equation in 136 ms returned []
Starting structural reductions, iteration 1 : 250/253 places, 240/243 transitions.
Applied a total of 0 rules in 9 ms. Remains 250 /250 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2021-05-15 07:32:38] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 240 rows 250 cols
[2021-05-15 07:32:38] [INFO ] Computed 90 place invariants in 1 ms
[2021-05-15 07:32:39] [INFO ] Dead Transitions using invariants and state equation in 150 ms returned []
Finished structural reductions, in 2 iterations. Remains : 250/253 places, 240/243 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010A-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s33 1) (NEQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 293 reset in 428 ms.
Product exploration explored 100000 steps with 296 reset in 435 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 294 reset in 457 ms.
Product exploration explored 100000 steps with 296 reset in 482 ms.
[2021-05-15 07:32:41] [INFO ] Flatten gal took : 17 ms
[2021-05-15 07:32:41] [INFO ] Flatten gal took : 17 ms
[2021-05-15 07:32:41] [INFO ] Time to serialize gal into /tmp/LTL3048815692336151830.gal : 3 ms
[2021-05-15 07:32:41] [INFO ] Time to serialize properties into /tmp/LTL15690406864849479860.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/LTL3048815692336151830.gal, -t, CGAL, -LTL, /tmp/LTL15690406864849479860.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/LTL3048815692336151830.gal -t CGAL -LTL /tmp/LTL15690406864849479860.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((p33==0)||(p48==0))"))))
Formula 0 simplified : !GF"((p33==0)||(p48==0))"
Detected timeout of ITS tools.
[2021-05-15 07:32:56] [INFO ] Flatten gal took : 22 ms
[2021-05-15 07:32:56] [INFO ] Applying decomposition
[2021-05-15 07:32:56] [INFO ] Flatten gal took : 14 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/graph5179937164218358421.txt, -o, /tmp/graph5179937164218358421.bin, -w, /tmp/graph5179937164218358421.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/graph5179937164218358421.bin, -l, -1, -v, -w, /tmp/graph5179937164218358421.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 07:32:56] [INFO ] Decomposing Gal with order
[2021-05-15 07:32:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 07:32:56] [INFO ] Removed a total of 155 redundant transitions.
[2021-05-15 07:32:56] [INFO ] Flatten gal took : 27 ms
[2021-05-15 07:32:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 9 ms.
[2021-05-15 07:32:56] [INFO ] Time to serialize gal into /tmp/LTL61334652814804036.gal : 4 ms
[2021-05-15 07:32:56] [INFO ] Time to serialize properties into /tmp/LTL7508683732303038393.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/LTL61334652814804036.gal, -t, CGAL, -LTL, /tmp/LTL7508683732303038393.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/LTL61334652814804036.gal -t CGAL -LTL /tmp/LTL7508683732303038393.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.i2.u12.p33==0)||(i1.i2.u17.p48==0))"))))
Formula 0 simplified : !GF"((i1.i2.u12.p33==0)||(i1.i2.u17.p48==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6919042654257022474
[2021-05-15 07:33:11] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6919042654257022474
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/ltsmin6919042654257022474]
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/ltsmin6919042654257022474] 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/ltsmin6919042654257022474] 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 ShieldIIPs-PT-010A-03 finished in 33777 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 253 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 253/253 places, 243/243 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 253 transition count 242
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 252 transition count 242
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 251 transition count 241
Applied a total of 4 rules in 32 ms. Remains 251 /253 variables (removed 2) and now considering 241/243 (removed 2) transitions.
// Phase 1: matrix 241 rows 251 cols
[2021-05-15 07:33:12] [INFO ] Computed 91 place invariants in 17 ms
[2021-05-15 07:33:12] [INFO ] Implicit Places using invariants in 145 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 ms to find 1 implicit places.
[2021-05-15 07:33:12] [INFO ] Redundant transitions in 42 ms returned [233]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[233]
// Phase 1: matrix 240 rows 250 cols
[2021-05-15 07:33:12] [INFO ] Computed 90 place invariants in 1 ms
[2021-05-15 07:33:12] [INFO ] Dead Transitions using invariants and state equation in 138 ms returned []
Starting structural reductions, iteration 1 : 250/253 places, 240/243 transitions.
Applied a total of 0 rules in 7 ms. Remains 250 /250 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2021-05-15 07:33:12] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 240 rows 250 cols
[2021-05-15 07:33:12] [INFO ] Computed 90 place invariants in 1 ms
[2021-05-15 07:33:12] [INFO ] Dead Transitions using invariants and state equation in 132 ms returned []
Finished structural reductions, in 2 iterations. Remains : 250/253 places, 240/243 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-010A-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (NEQ s13 1) (NEQ s23 1) (NEQ s27 1) (NEQ s156 1) (NEQ s167 1)) (OR (NEQ s37 1) (NEQ s70 1))), p1:(AND (EQ s13 1) (EQ s23 1) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 373 reset in 444 ms.
Product exploration explored 100000 steps with 374 reset in 428 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 372 reset in 383 ms.
Product exploration explored 100000 steps with 361 reset in 433 ms.
[2021-05-15 07:33:14] [INFO ] Flatten gal took : 12 ms
[2021-05-15 07:33:14] [INFO ] Flatten gal took : 12 ms
[2021-05-15 07:33:14] [INFO ] Time to serialize gal into /tmp/LTL11102033099423420719.gal : 1 ms
[2021-05-15 07:33:14] [INFO ] Time to serialize properties into /tmp/LTL3489494499759579637.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/LTL11102033099423420719.gal, -t, CGAL, -LTL, /tmp/LTL3489494499759579637.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/LTL11102033099423420719.gal -t CGAL -LTL /tmp/LTL3489494499759579637.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G((F("(((p13==1)&&(p23==1))&&(p27==1))"))||("((((((p13==0)||(p23==0))||(p27==0))||(p156==0))||(p167==0))&&((p37==0)||(p70==0)))")))))
Formula 0 simplified : !FG("((((((p13==0)||(p23==0))||(p27==0))||(p156==0))||(p167==0))&&((p37==0)||(p70==0)))" | F"(((p13==1)&&(p23==1))&&(p27==1))")
Detected timeout of ITS tools.
[2021-05-15 07:33:29] [INFO ] Flatten gal took : 13 ms
[2021-05-15 07:33:29] [INFO ] Applying decomposition
[2021-05-15 07:33:29] [INFO ] Flatten gal took : 12 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/graph7705558483057931103.txt, -o, /tmp/graph7705558483057931103.bin, -w, /tmp/graph7705558483057931103.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/graph7705558483057931103.bin, -l, -1, -v, -w, /tmp/graph7705558483057931103.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 07:33:29] [INFO ] Decomposing Gal with order
[2021-05-15 07:33:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 07:33:29] [INFO ] Removed a total of 155 redundant transitions.
[2021-05-15 07:33:29] [INFO ] Flatten gal took : 25 ms
[2021-05-15 07:33:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 148 labels/synchronizations in 9 ms.
[2021-05-15 07:33:29] [INFO ] Time to serialize gal into /tmp/LTL18317632688639012425.gal : 3 ms
[2021-05-15 07:33:29] [INFO ] Time to serialize properties into /tmp/LTL15236806881958600975.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/LTL18317632688639012425.gal, -t, CGAL, -LTL, /tmp/LTL15236806881958600975.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/LTL18317632688639012425.gal -t CGAL -LTL /tmp/LTL15236806881958600975.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G((F("(((i0.i2.u5.p13==1)&&(i0.i2.u8.p23==1))&&(i0.i2.u9.p27==1))"))||("((((((i0.i2.u5.p13==0)||(i0.i2.u8.p23==0))||(i0.i2.u9.p27==0))||(i6.i0.u56.p156==0))||(i6.i0.u60.p167==0))&&((i1.i1.u14.p37==0)||(i2.i1.u26.p70==0)))")))))
Formula 0 simplified : !FG("((((((i0.i2.u5.p13==0)||(i0.i2.u8.p23==0))||(i0.i2.u9.p27==0))||(i6.i0.u56.p156==0))||(i6.i0.u60.p167==0))&&((i1.i1.u14.p37==0)||(i2.i1.u26.p70==0)))" | F"(((i0.i2.u5.p13==1)&&(i0.i2.u8.p23==1))&&(i0.i2.u9.p27==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1510987103706550148
[2021-05-15 07:33:44] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1510987103706550148
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/ltsmin1510987103706550148]
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/ltsmin1510987103706550148] 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/ltsmin1510987103706550148] 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 ShieldIIPs-PT-010A-05 finished in 33632 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 253/253 places, 243/243 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 253 transition count 242
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 252 transition count 242
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 251 transition count 241
Applied a total of 4 rules in 13 ms. Remains 251 /253 variables (removed 2) and now considering 241/243 (removed 2) transitions.
// Phase 1: matrix 241 rows 251 cols
[2021-05-15 07:33:46] [INFO ] Computed 91 place invariants in 1 ms
[2021-05-15 07:33:46] [INFO ] Implicit Places using invariants in 148 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 149 ms to find 1 implicit places.
[2021-05-15 07:33:46] [INFO ] Redundant transitions in 22 ms returned [233]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[233]
// Phase 1: matrix 240 rows 250 cols
[2021-05-15 07:33:46] [INFO ] Computed 90 place invariants in 1 ms
[2021-05-15 07:33:46] [INFO ] Dead Transitions using invariants and state equation in 164 ms returned []
Starting structural reductions, iteration 1 : 250/253 places, 240/243 transitions.
Applied a total of 0 rules in 8 ms. Remains 250 /250 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2021-05-15 07:33:46] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 240 rows 250 cols
[2021-05-15 07:33:46] [INFO ] Computed 90 place invariants in 1 ms
[2021-05-15 07:33:46] [INFO ] Dead Transitions using invariants and state equation in 157 ms returned []
Finished structural reductions, in 2 iterations. Remains : 250/253 places, 240/243 transitions.
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010A-06 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:(OR (NEQ s12 1) (NEQ s45 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 233 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-010A-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-06 finished in 588 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(((p0 U G(p1))||(p0&&F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 2 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
// Phase 1: matrix 243 rows 253 cols
[2021-05-15 07:33:46] [INFO ] Computed 91 place invariants in 1 ms
[2021-05-15 07:33:46] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 243 rows 253 cols
[2021-05-15 07:33:46] [INFO ] Computed 91 place invariants in 1 ms
[2021-05-15 07:33:46] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
// Phase 1: matrix 243 rows 253 cols
[2021-05-15 07:33:47] [INFO ] Computed 91 place invariants in 8 ms
[2021-05-15 07:33:47] [INFO ] Dead Transitions using invariants and state equation in 153 ms returned []
Finished structural reductions, in 1 iterations. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-010A-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s101 1), p0:(EQ s239 0), p2:(EQ s239 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3420 reset in 312 ms.
Product exploration explored 100000 steps with 3395 reset in 355 ms.
Knowledge obtained : [(NOT p1), p0, (NOT p2)]
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 3392 reset in 310 ms.
Product exploration explored 100000 steps with 3454 reset in 356 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 253 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 253/253 places, 243/243 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 253 transition count 246
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 253 transition count 246
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 12 ms. Remains 253 /253 variables (removed 0) and now considering 246/243 (removed -3) transitions.
[2021-05-15 07:33:49] [INFO ] Redundant transitions in 26 ms returned [243]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[243]
// Phase 1: matrix 245 rows 253 cols
[2021-05-15 07:33:49] [INFO ] Computed 91 place invariants in 1 ms
[2021-05-15 07:33:49] [INFO ] Dead Transitions using invariants and state equation in 174 ms returned []
Starting structural reductions, iteration 1 : 253/253 places, 245/243 transitions.
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 0 rules in 10 ms. Remains 253 /253 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2021-05-15 07:33:49] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 245 rows 253 cols
[2021-05-15 07:33:49] [INFO ] Computed 91 place invariants in 8 ms
[2021-05-15 07:33:49] [INFO ] Dead Transitions using invariants and state equation in 155 ms returned []
Finished structural reductions, in 2 iterations. Remains : 253/253 places, 245/243 transitions.
Product exploration explored 100000 steps with 3567 reset in 573 ms.
Product exploration explored 100000 steps with 3573 reset in 507 ms.
[2021-05-15 07:33:50] [INFO ] Flatten gal took : 13 ms
[2021-05-15 07:33:50] [INFO ] Flatten gal took : 12 ms
[2021-05-15 07:33:50] [INFO ] Time to serialize gal into /tmp/LTL1486508546403826476.gal : 1 ms
[2021-05-15 07:33:50] [INFO ] Time to serialize properties into /tmp/LTL17707087898269602222.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/LTL1486508546403826476.gal, -t, CGAL, -LTL, /tmp/LTL17707087898269602222.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/LTL1486508546403826476.gal -t CGAL -LTL /tmp/LTL17707087898269602222.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F((("(p239==0)")U(G("(p101==1)")))||(("(p239==0)")&&(F("(p239==1)"))))))))
Formula 0 simplified : !XXF(("(p239==0)" U G"(p101==1)") | ("(p239==0)" & F"(p239==1)"))
Detected timeout of ITS tools.
[2021-05-15 07:34:05] [INFO ] Flatten gal took : 21 ms
[2021-05-15 07:34:05] [INFO ] Applying decomposition
[2021-05-15 07:34:05] [INFO ] Flatten gal took : 11 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/graph17305718453730413258.txt, -o, /tmp/graph17305718453730413258.bin, -w, /tmp/graph17305718453730413258.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/graph17305718453730413258.bin, -l, -1, -v, -w, /tmp/graph17305718453730413258.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 07:34:05] [INFO ] Decomposing Gal with order
[2021-05-15 07:34:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 07:34:05] [INFO ] Removed a total of 160 redundant transitions.
[2021-05-15 07:34:05] [INFO ] Flatten gal took : 20 ms
[2021-05-15 07:34:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 148 labels/synchronizations in 8 ms.
[2021-05-15 07:34:05] [INFO ] Time to serialize gal into /tmp/LTL15663999888677972429.gal : 3 ms
[2021-05-15 07:34:05] [INFO ] Time to serialize properties into /tmp/LTL890780474004012715.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/LTL15663999888677972429.gal, -t, CGAL, -LTL, /tmp/LTL890780474004012715.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/LTL15663999888677972429.gal -t CGAL -LTL /tmp/LTL890780474004012715.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F((("(i9.i1.u87.p239==0)")U(G("(i3.i2.u36.p101==1)")))||(("(i9.i1.u87.p239==0)")&&(F("(i9.i1.u87.p239==1)"))))))))
Formula 0 simplified : !XXF(("(i9.i1.u87.p239==0)" U G"(i3.i2.u36.p101==1)") | ("(i9.i1.u87.p239==0)" & F"(i9.i1.u87.p239==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3249352888926268638
[2021-05-15 07:34:20] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3249352888926268638
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/ltsmin3249352888926268638]
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/ltsmin3249352888926268638] 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/ltsmin3249352888926268638] 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 ShieldIIPs-PT-010A-07 finished in 35280 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 253 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 3 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
// Phase 1: matrix 243 rows 253 cols
[2021-05-15 07:34:21] [INFO ] Computed 91 place invariants in 0 ms
[2021-05-15 07:34:21] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 243 rows 253 cols
[2021-05-15 07:34:21] [INFO ] Computed 91 place invariants in 1 ms
[2021-05-15 07:34:22] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
// Phase 1: matrix 243 rows 253 cols
[2021-05-15 07:34:22] [INFO ] Computed 91 place invariants in 1 ms
[2021-05-15 07:34:22] [INFO ] Dead Transitions using invariants and state equation in 127 ms returned []
Finished structural reductions, in 1 iterations. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010A-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s171 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-010A-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-08 finished in 593 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 253 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 253/253 places, 243/243 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 252 transition count 241
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 250 transition count 241
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 249 transition count 240
Applied a total of 5 rules in 14 ms. Remains 249 /253 variables (removed 4) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 249 cols
[2021-05-15 07:34:22] [INFO ] Computed 90 place invariants in 1 ms
[2021-05-15 07:34:22] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 240 rows 249 cols
[2021-05-15 07:34:22] [INFO ] Computed 90 place invariants in 2 ms
[2021-05-15 07:34:22] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2021-05-15 07:34:22] [INFO ] Redundant transitions in 22 ms returned [232]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[232]
// Phase 1: matrix 239 rows 249 cols
[2021-05-15 07:34:22] [INFO ] Computed 90 place invariants in 1 ms
[2021-05-15 07:34:22] [INFO ] Dead Transitions using invariants and state equation in 140 ms returned []
Starting structural reductions, iteration 1 : 249/253 places, 239/243 transitions.
Applied a total of 0 rules in 7 ms. Remains 249 /249 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2021-05-15 07:34:22] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 239 rows 249 cols
[2021-05-15 07:34:22] [INFO ] Computed 90 place invariants in 1 ms
[2021-05-15 07:34:23] [INFO ] Dead Transitions using invariants and state equation in 154 ms returned []
Finished structural reductions, in 2 iterations. Remains : 249/253 places, 239/243 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010A-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s215 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 541 steps with 0 reset in 3 ms.
FORMULA ShieldIIPs-PT-010A-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-10 finished in 729 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U (p1&&X(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 1 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
// Phase 1: matrix 243 rows 253 cols
[2021-05-15 07:34:23] [INFO ] Computed 91 place invariants in 1 ms
[2021-05-15 07:34:23] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 243 rows 253 cols
[2021-05-15 07:34:23] [INFO ] Computed 91 place invariants in 1 ms
[2021-05-15 07:34:23] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
// Phase 1: matrix 243 rows 253 cols
[2021-05-15 07:34:23] [INFO ] Computed 91 place invariants in 8 ms
[2021-05-15 07:34:23] [INFO ] Dead Transitions using invariants and state equation in 153 ms returned []
Finished structural reductions, in 1 iterations. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-010A-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p1:(EQ s51 1), p0:(EQ s191 1), p2:(AND (EQ s106 1) (EQ s116 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 7182 steps with 39 reset in 25 ms.
FORMULA ShieldIIPs-PT-010A-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-11 finished in 651 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (G((G(p2)||p1))||(p0&&G(p3)&&(G(p2)||p4)))))], workingDir=/home/mcc/execution]
Support contains 9 out of 253 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 253/253 places, 243/243 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 253 transition count 242
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 252 transition count 242
Applied a total of 2 rules in 8 ms. Remains 252 /253 variables (removed 1) and now considering 242/243 (removed 1) transitions.
// Phase 1: matrix 242 rows 252 cols
[2021-05-15 07:34:23] [INFO ] Computed 91 place invariants in 1 ms
[2021-05-15 07:34:24] [INFO ] Implicit Places using invariants in 138 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 139 ms to find 1 implicit places.
[2021-05-15 07:34:24] [INFO ] Redundant transitions in 24 ms returned [239]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[239]
// Phase 1: matrix 241 rows 251 cols
[2021-05-15 07:34:24] [INFO ] Computed 90 place invariants in 1 ms
[2021-05-15 07:34:24] [INFO ] Dead Transitions using invariants and state equation in 143 ms returned []
Starting structural reductions, iteration 1 : 251/253 places, 241/243 transitions.
Applied a total of 0 rules in 6 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2021-05-15 07:34:24] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 241 rows 251 cols
[2021-05-15 07:34:24] [INFO ] Computed 90 place invariants in 1 ms
[2021-05-15 07:34:24] [INFO ] Dead Transitions using invariants and state equation in 129 ms returned []
Finished structural reductions, in 2 iterations. Remains : 251/253 places, 241/243 transitions.
Stuttering acceptance computed with spot in 328 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3))), true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldIIPs-PT-010A-13 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p1) (NOT p2) p0 (NOT p3)) (AND (NOT p1) (NOT p2) p0 (NOT p4))), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND p1 (NOT p2) p0 (NOT p4)) (AND p1 p0 (NOT p3)) (AND p2 p0 (NOT p3))), acceptance={0, 2} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0 p3 p4), acceptance={0, 1} source=0 dest: 4}, { cond=(OR (AND p1 p0 p3 p4) (AND p2 p0 p3)), acceptance={0} source=0 dest: 4}, { cond=(AND (NOT p1) p2 p0 p3 p4), acceptance={1} source=0 dest: 5}, { cond=(OR (AND (NOT p1) p2 p0 (NOT p3)) (AND (NOT p1) p2 p0 (NOT p4))), acceptance={1, 2} source=0 dest: 6}, { cond=(AND p1 p2 p0 p3 (NOT p4)), acceptance={2} source=0 dest: 6}], [{ cond=true, acceptance={0, 1, 2} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(OR (AND p1 p0 (NOT p3)) (AND p2 p0 (NOT p3))), acceptance={0, 2} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0 p3), acceptance={0, 1} source=4 dest: 4}, { cond=(OR (AND p1 p0 p3) (AND p2 p0 p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p2 p0 p3), acceptance={1} source=4 dest: 5}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={1, 2} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) p3), acceptance={} source=4 dest: 7}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p1) p2 (NOT p0) p3), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND p1 (NOT p2) p0 (NOT p3)), acceptance={0, 2} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0 p3), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p1 (NOT p2) p0 p3), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p2 p0 p3), acceptance={1} source=5 dest: 5}, { cond=(AND p1 p2 p0 p3), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={1, 2} source=5 dest: 6}, { cond=(AND p1 p2 p0 (NOT p3)), acceptance={2} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) p3), acceptance={} source=5 dest: 7}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p1) p2 (NOT p0) p3), acceptance={} source=5 dest: 9}], [{ cond=(OR (AND (NOT p1) (NOT p2) p0 (NOT p3)) (AND (NOT p1) (NOT p2) p0 (NOT p4))), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(OR (AND p1 (NOT p2) p0 (NOT p3)) (AND p1 (NOT p2) p0 (NOT p4))), acceptance={0, 2} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0 p3 p4), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p1 (NOT p2) p0 p3 p4), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p2 p0 p3 p4), acceptance={1} source=6 dest: 5}, { cond=(AND p1 p2 p0 p3 p4), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p1) p2 p0 (NOT p3)) (AND (NOT p1) p2 p0 (NOT p4))), acceptance={1, 2} source=6 dest: 6}, { cond=(OR (AND p1 p2 p0 (NOT p3)) (AND p1 p2 p0 (NOT p4))), acceptance={2} source=6 dest: 6}], [{ cond=(NOT p3), acceptance={} source=7 dest: 1}, { cond=p3, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=8 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=8 dest: 7}, { cond=(AND p1 p3), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=9 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=9 dest: 7}, { cond=(AND p2 p3), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(OR (NEQ s36 1) (NEQ s42 1) (NEQ s51 1)), p2:(OR (NEQ s161 1) (NEQ s165 1) (NEQ s176 1)), p0:(OR (NEQ s36 1) (NEQ s42 1) (NEQ s51 1)), p3:(OR (NEQ s236 1) (NEQ s240 1) (NEQ s250 1)), p4:(OR (NEQ s36 1) (NEQ s42 1) (NEQ s51 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 10388 steps with 18 reset in 55 ms.
FORMULA ShieldIIPs-PT-010A-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-13 finished in 909 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((!p0||(!p0 U p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 253/253 places, 243/243 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 252 transition count 241
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 250 transition count 241
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 249 transition count 240
Applied a total of 5 rules in 10 ms. Remains 249 /253 variables (removed 4) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 249 cols
[2021-05-15 07:34:24] [INFO ] Computed 90 place invariants in 1 ms
[2021-05-15 07:34:24] [INFO ] Implicit Places using invariants in 105 ms returned []
// Phase 1: matrix 240 rows 249 cols
[2021-05-15 07:34:24] [INFO ] Computed 90 place invariants in 1 ms
[2021-05-15 07:34:25] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2021-05-15 07:34:25] [INFO ] Redundant transitions in 23 ms returned [232]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[232]
// Phase 1: matrix 239 rows 249 cols
[2021-05-15 07:34:25] [INFO ] Computed 90 place invariants in 2 ms
[2021-05-15 07:34:25] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Starting structural reductions, iteration 1 : 249/253 places, 239/243 transitions.
Applied a total of 0 rules in 5 ms. Remains 249 /249 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2021-05-15 07:34:25] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 239 rows 249 cols
[2021-05-15 07:34:25] [INFO ] Computed 90 place invariants in 1 ms
[2021-05-15 07:34:25] [INFO ] Dead Transitions using invariants and state equation in 144 ms returned []
Finished structural reductions, in 2 iterations. Remains : 249/253 places, 239/243 transitions.
Stuttering acceptance computed with spot in 25 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-010A-14 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s160 1) (NEQ s164 1) (NEQ s175 1)), p1:(EQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 537 steps with 0 reset in 3 ms.
FORMULA ShieldIIPs-PT-010A-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-14 finished in 712 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9479175005384345077
[2021-05-15 07:34:25] [INFO ] Computing symmetric may disable matrix : 243 transitions.
[2021-05-15 07:34:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 07:34:25] [INFO ] Computing symmetric may enable matrix : 243 transitions.
[2021-05-15 07:34:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 07:34:25] [INFO ] Applying decomposition
[2021-05-15 07:34:25] [INFO ] Flatten gal took : 12 ms
[2021-05-15 07:34:25] [INFO ] Computing Do-Not-Accords matrix : 243 transitions.
[2021-05-15 07:34:25] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 07:34:25] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9479175005384345077
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/ltsmin9479175005384345077]
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/graph3763679493336515335.txt, -o, /tmp/graph3763679493336515335.bin, -w, /tmp/graph3763679493336515335.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/graph3763679493336515335.bin, -l, -1, -v, -w, /tmp/graph3763679493336515335.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 07:34:25] [INFO ] Decomposing Gal with order
[2021-05-15 07:34:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 07:34:25] [INFO ] Removed a total of 160 redundant transitions.
[2021-05-15 07:34:25] [INFO ] Flatten gal took : 19 ms
[2021-05-15 07:34:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 5 ms.
[2021-05-15 07:34:25] [INFO ] Time to serialize gal into /tmp/LTLFireability9069732624547985065.gal : 2 ms
[2021-05-15 07:34:25] [INFO ] Time to serialize properties into /tmp/LTLFireability18194883549461251960.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/LTLFireability9069732624547985065.gal, -t, CGAL, -LTL, /tmp/LTLFireability18194883549461251960.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/LTLFireability9069732624547985065.gal -t CGAL -LTL /tmp/LTLFireability18194883549461251960.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((F((G("((i5.i2.u54.p151==1)||(((i9.i2.u85.p236==1)&&(i9.i2.u87.p240==1))&&(i9.i2.u90.p252==1)))"))||(G(F("(((i4.i1.u40.p111==0)||(i4.i1.u42.p117==0))||(i4.i0.u45.p127==0))"))))))
Formula 0 simplified : !F(G"((i5.i2.u54.p151==1)||(((i9.i2.u85.p236==1)&&(i9.i2.u87.p240==1))&&(i9.i2.u90.p252==1)))" | GF"(((i4.i1.u40.p111==0)||(i4.i1.u42.p117==0))||(i4.i0.u45.p127==0))")
Compilation finished in 1313 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9479175005384345077]
Link finished in 49 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, -p, --pins-guards, --when, --ltl, <>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9479175005384345077]
WARNING : LTSmin timed out (>300 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9479175005384345077]
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/ltsmin9479175005384345077]
WARNING : LTSmin timed out (>300 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9479175005384345077]
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, <>([](((LTLAPp3==true)||<>((LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9479175005384345077]
WARNING : LTSmin timed out (>300 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([](((LTLAPp3==true)||<>((LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9479175005384345077]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(<>((((LTLAPp5==true) U []((LTLAPp6==true)))||((LTLAPp5==true)&&<>((LTLAPp7==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9479175005384345077]
WARNING : LTSmin timed out (>300 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(<>((((LTLAPp5==true) U []((LTLAPp6==true)))||((LTLAPp5==true)&&<>((LTLAPp7==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9479175005384345077]
Retrying LTSmin with larger timeout 2400 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9479175005384345077]
Detected timeout of ITS tools.
[2021-05-15 07:55:17] [INFO ] Applying decomposition
[2021-05-15 07:55:17] [INFO ] Flatten gal took : 22 ms
[2021-05-15 07:55:17] [INFO ] Decomposing Gal with order
[2021-05-15 07:55:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 07:55:17] [INFO ] Removed a total of 170 redundant transitions.
[2021-05-15 07:55:17] [INFO ] Flatten gal took : 50 ms
[2021-05-15 07:55:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 4 ms.
[2021-05-15 07:55:17] [INFO ] Time to serialize gal into /tmp/LTLFireability17711011115483551260.gal : 18 ms
[2021-05-15 07:55:17] [INFO ] Time to serialize properties into /tmp/LTLFireability9896071494927101196.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/LTLFireability17711011115483551260.gal, -t, CGAL, -LTL, /tmp/LTLFireability9896071494927101196.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/LTLFireability17711011115483551260.gal -t CGAL -LTL /tmp/LTLFireability9896071494927101196.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((F((G("((u61.p151==1)||(((u96.p236==1)&&(u98.p240==1))&&(u101.p252==1)))"))||(G(F("(((u46.p111==0)||(u48.p117==0))||(u51.p127==0))"))))))
Formula 0 simplified : !F(G"((u61.p151==1)||(((u96.p236==1)&&(u98.p240==1))&&(u101.p252==1)))" | GF"(((u46.p111==0)||(u48.p117==0))||(u51.p127==0))")
Detected timeout of ITS tools.
[2021-05-15 08:16:09] [INFO ] Flatten gal took : 11 ms
[2021-05-15 08:16:09] [INFO ] Input system was already deterministic with 243 transitions.
[2021-05-15 08:16:09] [INFO ] Transformed 253 places.
[2021-05-15 08:16:09] [INFO ] Transformed 243 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 08:16:17] [INFO ] Time to serialize gal into /tmp/LTLFireability15965010917458202476.gal : 2 ms
[2021-05-15 08:16:17] [INFO ] Time to serialize properties into /tmp/LTLFireability10193716907856650555.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/LTLFireability15965010917458202476.gal, -t, CGAL, -LTL, /tmp/LTLFireability10193716907856650555.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/LTLFireability15965010917458202476.gal -t CGAL -LTL /tmp/LTLFireability10193716907856650555.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G("((p151==1)||(((p236==1)&&(p240==1))&&(p252==1)))"))||(G(F("(((p111==0)||(p117==0))||(p127==0))"))))))
Formula 0 simplified : !F(G"((p151==1)||(((p236==1)&&(p240==1))&&(p252==1)))" | GF"(((p111==0)||(p117==0))||(p127==0))")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Initializing POR dependencies: labels 251, guards 243
pins2lts-mc-linux64( 3/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.163: LTL layer: formula: <>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true)))))
pins2lts-mc-linux64( 4/ 8), 0.163: "<>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.164: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.345: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.386: There are 252 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.386: State length is 254, there are 249 groups
pins2lts-mc-linux64( 0/ 8), 0.386: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.386: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.386: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.386: Visible groups: 26 / 249, labels: 2 / 252
pins2lts-mc-linux64( 0/ 8), 0.386: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.387: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.513: [Blue] ~120 levels ~960 states ~3888 transitions
pins2lts-mc-linux64( 3/ 8), 0.530: [Blue] ~240 levels ~1920 states ~9624 transitions
pins2lts-mc-linux64( 3/ 8), 0.553: [Blue] ~450 levels ~3840 states ~15952 transitions
pins2lts-mc-linux64( 2/ 8), 0.579: [Blue] ~558 levels ~7680 states ~22728 transitions
pins2lts-mc-linux64( 2/ 8), 0.627: [Blue] ~558 levels ~15360 states ~35224 transitions
pins2lts-mc-linux64( 2/ 8), 0.725: [Blue] ~558 levels ~30720 states ~63864 transitions
pins2lts-mc-linux64( 2/ 8), 0.993: [Blue] ~558 levels ~61440 states ~121656 transitions
pins2lts-mc-linux64( 2/ 8), 1.401: [Blue] ~558 levels ~122880 states ~224344 transitions
pins2lts-mc-linux64( 2/ 8), 2.314: [Blue] ~558 levels ~245760 states ~450392 transitions
pins2lts-mc-linux64( 2/ 8), 4.162: [Blue] ~558 levels ~491520 states ~904008 transitions
pins2lts-mc-linux64( 2/ 8), 8.593: [Blue] ~558 levels ~983040 states ~1941064 transitions
pins2lts-mc-linux64( 2/ 8), 16.911: [Blue] ~559 levels ~1966080 states ~3899096 transitions
pins2lts-mc-linux64( 2/ 8), 33.968: [Blue] ~560 levels ~3932160 states ~7935960 transitions
pins2lts-mc-linux64( 2/ 8), 67.999: [Blue] ~578 levels ~7864320 states ~15770752 transitions
pins2lts-mc-linux64( 2/ 8), 138.161: [Blue] ~578 levels ~15728640 states ~31074704 transitions
pins2lts-mc-linux64( 2/ 8), 277.063: [Blue] ~578 levels ~31457280 states ~64094832 transitions
pins2lts-mc-linux64( 2/ 8), 559.520: [Blue] ~578 levels ~62914560 states ~127653096 transitions
pins2lts-mc-linux64( 2/ 8), 1135.897: [Blue] ~578 levels ~125829120 states ~257557688 transitions
pins2lts-mc-linux64( 0/ 8), 1496.333: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1496.358:
pins2lts-mc-linux64( 0/ 8), 1496.358: Explored 116118922 states 338347692 transitions, fanout: 2.914
pins2lts-mc-linux64( 0/ 8), 1496.358: Total exploration time 1495.950 sec (1495.930 sec minimum, 1495.939 sec on average)
pins2lts-mc-linux64( 0/ 8), 1496.358: States per second: 77622, Transitions per second: 226176
pins2lts-mc-linux64( 0/ 8), 1496.358:
pins2lts-mc-linux64( 0/ 8), 1496.358: State space has 116137743 states, 16125527 are accepting
pins2lts-mc-linux64( 0/ 8), 1496.358: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1496.358: blue states: 116118922 (99.98%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1496.358: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1496.358: all-red states: 16518995 (14.22%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1496.358:
pins2lts-mc-linux64( 0/ 8), 1496.358: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 1496.358:
pins2lts-mc-linux64( 0/ 8), 1496.358: Queue width: 8B, total height: 4942, memory: 0.04MB
pins2lts-mc-linux64( 0/ 8), 1496.358: Tree memory: 1142.1MB, 10.3 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 1496.358: Tree fill ratio (roots/leafs): 86.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1496.358: Stored 244 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1496.358: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1496.358: Est. total memory use: 1142.1MB (~1024.0MB 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, <>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9479175005384345077]
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, <>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9479175005384345077]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -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 LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/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="ShieldIIPs-PT-010A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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