About the Execution of ITS-Tools for ShieldRVs-PT-010B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7686.464 | 3600000.00 | 13784908.00 | 1089.90 | ?FFFFFF?FFFFFFT? | 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.r235-smll-162106564400093.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVs-PT-010B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-smll-162106564400093
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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.0K Mar 28 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 12:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 12:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 18:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 18:42 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 122K 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 ShieldRVs-PT-010B-00
FORMULA_NAME ShieldRVs-PT-010B-01
FORMULA_NAME ShieldRVs-PT-010B-02
FORMULA_NAME ShieldRVs-PT-010B-03
FORMULA_NAME ShieldRVs-PT-010B-04
FORMULA_NAME ShieldRVs-PT-010B-05
FORMULA_NAME ShieldRVs-PT-010B-06
FORMULA_NAME ShieldRVs-PT-010B-07
FORMULA_NAME ShieldRVs-PT-010B-08
FORMULA_NAME ShieldRVs-PT-010B-09
FORMULA_NAME ShieldRVs-PT-010B-10
FORMULA_NAME ShieldRVs-PT-010B-11
FORMULA_NAME ShieldRVs-PT-010B-12
FORMULA_NAME ShieldRVs-PT-010B-13
FORMULA_NAME ShieldRVs-PT-010B-14
FORMULA_NAME ShieldRVs-PT-010B-15
=== Now, execution of the tool begins
BK_START 1621138549673
Running Version 0
[2021-05-16 04:15:52] [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-16 04:15:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 04:15:52] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2021-05-16 04:15:52] [INFO ] Transformed 403 places.
[2021-05-16 04:15:52] [INFO ] Transformed 453 transitions.
[2021-05-16 04:15:52] [INFO ] Found NUPN structural information;
[2021-05-16 04:15:52] [INFO ] Parsed PT model containing 403 places and 453 transitions in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 04:15:52] [INFO ] Initial state test concluded for 2 properties.
FORMULA ShieldRVs-PT-010B-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-010B-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 453/453 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 346 transition count 396
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 346 transition count 396
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 345 transition count 395
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 345 transition count 395
Applied a total of 116 rules in 106 ms. Remains 345 /403 variables (removed 58) and now considering 395/453 (removed 58) transitions.
// Phase 1: matrix 395 rows 345 cols
[2021-05-16 04:15:52] [INFO ] Computed 41 place invariants in 31 ms
[2021-05-16 04:15:52] [INFO ] Implicit Places using invariants in 368 ms returned []
// Phase 1: matrix 395 rows 345 cols
[2021-05-16 04:15:52] [INFO ] Computed 41 place invariants in 5 ms
[2021-05-16 04:15:53] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
// Phase 1: matrix 395 rows 345 cols
[2021-05-16 04:15:53] [INFO ] Computed 41 place invariants in 4 ms
[2021-05-16 04:15:53] [INFO ] Dead Transitions using invariants and state equation in 331 ms returned []
Finished structural reductions, in 1 iterations. Remains : 345/403 places, 395/453 transitions.
[2021-05-16 04:15:54] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-16 04:15:54] [INFO ] Flatten gal took : 99 ms
FORMULA ShieldRVs-PT-010B-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-010B-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 04:15:54] [INFO ] Flatten gal took : 49 ms
[2021-05-16 04:15:54] [INFO ] Input system was already deterministic with 395 transitions.
Incomplete random walk after 100000 steps, including 224 resets, run finished after 386 ms. (steps per millisecond=259 ) properties (out of 26) seen :23
Running SMT prover for 3 properties.
// Phase 1: matrix 395 rows 345 cols
[2021-05-16 04:15:54] [INFO ] Computed 41 place invariants in 6 ms
[2021-05-16 04:15:54] [INFO ] [Real]Absence check using 41 positive place invariants in 32 ms returned sat
[2021-05-16 04:15:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:15:55] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2021-05-16 04:15:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:15:55] [INFO ] [Nat]Absence check using 41 positive place invariants in 25 ms returned sat
[2021-05-16 04:15:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 04:15:55] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2021-05-16 04:15:55] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 5 ms to minimize.
[2021-05-16 04:15:55] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 1 ms to minimize.
[2021-05-16 04:15:56] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 1 ms to minimize.
[2021-05-16 04:15:56] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 3 ms to minimize.
[2021-05-16 04:15:56] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 2 ms to minimize.
[2021-05-16 04:15:56] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 1 ms to minimize.
[2021-05-16 04:15:56] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2021-05-16 04:15:56] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2021-05-16 04:15:57] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2021-05-16 04:15:57] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2021-05-16 04:15:57] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2021-05-16 04:15:57] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1759 ms
[2021-05-16 04:15:57] [INFO ] Computed and/alt/rep : 394/1210/394 causal constraints (skipped 0 transitions) in 37 ms.
[2021-05-16 04:16:01] [INFO ] Added : 365 causal constraints over 76 iterations in 4593 ms. Result :sat
[2021-05-16 04:16:01] [INFO ] [Real]Absence check using 41 positive place invariants in 26 ms returned sat
[2021-05-16 04:16:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:16:02] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2021-05-16 04:16:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:16:02] [INFO ] [Nat]Absence check using 41 positive place invariants in 17 ms returned unsat
[2021-05-16 04:16:02] [INFO ] [Real]Absence check using 41 positive place invariants in 13 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2021-05-16 04:16:02] [INFO ] Initial state test concluded for 1 properties.
FORMULA ShieldRVs-PT-010B-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F((p1||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 345 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 345/345 places, 395/395 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 334 transition count 384
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 334 transition count 384
Applied a total of 22 rules in 41 ms. Remains 334 /345 variables (removed 11) and now considering 384/395 (removed 11) transitions.
// Phase 1: matrix 384 rows 334 cols
[2021-05-16 04:16:02] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-16 04:16:02] [INFO ] Implicit Places using invariants in 160 ms returned []
// Phase 1: matrix 384 rows 334 cols
[2021-05-16 04:16:02] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-16 04:16:03] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
// Phase 1: matrix 384 rows 334 cols
[2021-05-16 04:16:03] [INFO ] Computed 41 place invariants in 6 ms
[2021-05-16 04:16:03] [INFO ] Dead Transitions using invariants and state equation in 285 ms returned []
Finished structural reductions, in 1 iterations. Remains : 334/345 places, 384/395 transitions.
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-010B-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s40 1), p1:(EQ s241 1), p2:(EQ s154 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4104 reset in 407 ms.
Product exploration explored 100000 steps with 4032 reset in 292 ms.
Knowledge obtained : [(NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 4081 reset in 373 ms.
Product exploration explored 100000 steps with 4151 reset in 310 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 334 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 334/334 places, 384/384 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 334 transition count 384
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 39 place count 334 transition count 396
Deduced a syphon composed of 60 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 60 place count 334 transition count 396
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 187 places in 1 ms
Iterating global reduction 1 with 127 rules applied. Total rules applied 187 place count 334 transition count 396
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 256 place count 265 transition count 327
Deduced a syphon composed of 118 places in 0 ms
Iterating global reduction 1 with 69 rules applied. Total rules applied 325 place count 265 transition count 327
Deduced a syphon composed of 118 places in 0 ms
Applied a total of 325 rules in 93 ms. Remains 265 /334 variables (removed 69) and now considering 327/384 (removed 57) transitions.
[2021-05-16 04:16:05] [INFO ] Redundant transitions in 84 ms returned [326]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[326]
// Phase 1: matrix 326 rows 265 cols
[2021-05-16 04:16:05] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-16 04:16:06] [INFO ] Dead Transitions using invariants and state equation in 215 ms returned []
Starting structural reductions, iteration 1 : 265/334 places, 326/384 transitions.
Deduced a syphon composed of 118 places in 1 ms
Applied a total of 0 rules in 23 ms. Remains 265 /265 variables (removed 0) and now considering 326/326 (removed 0) transitions.
[2021-05-16 04:16:06] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 326 rows 265 cols
[2021-05-16 04:16:06] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-16 04:16:06] [INFO ] Dead Transitions using invariants and state equation in 206 ms returned []
Finished structural reductions, in 2 iterations. Remains : 265/334 places, 326/384 transitions.
Product exploration explored 100000 steps with 13580 reset in 987 ms.
Product exploration explored 100000 steps with 13517 reset in 764 ms.
[2021-05-16 04:16:08] [INFO ] Flatten gal took : 44 ms
[2021-05-16 04:16:08] [INFO ] Flatten gal took : 38 ms
[2021-05-16 04:16:08] [INFO ] Time to serialize gal into /tmp/LTL4666347833358589045.gal : 16 ms
[2021-05-16 04:16:08] [INFO ] Time to serialize properties into /tmp/LTL8128151917712677896.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/LTL4666347833358589045.gal, -t, CGAL, -LTL, /tmp/LTL8128151917712677896.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/LTL4666347833358589045.gal -t CGAL -LTL /tmp/LTL8128151917712677896.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(p45==1)")||(F(("(p288==1)")||(G("(p183==1)")))))))
Formula 0 simplified : !X("(p45==1)" | F("(p288==1)" | G"(p183==1)"))
Detected timeout of ITS tools.
[2021-05-16 04:16:23] [INFO ] Flatten gal took : 52 ms
[2021-05-16 04:16:23] [INFO ] Applying decomposition
[2021-05-16 04:16:23] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6889633198468638513.txt, -o, /tmp/graph6889633198468638513.bin, -w, /tmp/graph6889633198468638513.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/graph6889633198468638513.bin, -l, -1, -v, -w, /tmp/graph6889633198468638513.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 04:16:23] [INFO ] Decomposing Gal with order
[2021-05-16 04:16:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 04:16:23] [INFO ] Removed a total of 351 redundant transitions.
[2021-05-16 04:16:23] [INFO ] Flatten gal took : 162 ms
[2021-05-16 04:16:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2021-05-16 04:16:24] [INFO ] Time to serialize gal into /tmp/LTL6203183815471975104.gal : 23 ms
[2021-05-16 04:16:24] [INFO ] Time to serialize properties into /tmp/LTL14719793505243411658.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/LTL6203183815471975104.gal, -t, CGAL, -LTL, /tmp/LTL14719793505243411658.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/LTL6203183815471975104.gal -t CGAL -LTL /tmp/LTL14719793505243411658.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i0.i1.u16.p45==1)")||(F(("(i8.i0.u91.p288==1)")||(G("(i4.i0.u59.p183==1)")))))))
Formula 0 simplified : !X("(i0.i1.u16.p45==1)" | F("(i8.i0.u91.p288==1)" | G"(i4.i0.u59.p183==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14981296447455754871
[2021-05-16 04:16:39] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14981296447455754871
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/ltsmin14981296447455754871]
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/ltsmin14981296447455754871] 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/ltsmin14981296447455754871] 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 ShieldRVs-PT-010B-00 finished in 37847 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 345 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 345/345 places, 395/395 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 344 transition count 353
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 303 transition count 353
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 82 place count 303 transition count 303
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 182 place count 253 transition count 303
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 194 place count 241 transition count 291
Iterating global reduction 2 with 12 rules applied. Total rules applied 206 place count 241 transition count 291
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 206 place count 241 transition count 286
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 216 place count 236 transition count 286
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 396 place count 146 transition count 196
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 397 place count 145 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 398 place count 144 transition count 194
Applied a total of 398 rules in 105 ms. Remains 144 /345 variables (removed 201) and now considering 194/395 (removed 201) transitions.
// Phase 1: matrix 194 rows 144 cols
[2021-05-16 04:16:40] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-16 04:16:40] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 194 rows 144 cols
[2021-05-16 04:16:40] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-16 04:16:40] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2021-05-16 04:16:40] [INFO ] Redundant transitions in 54 ms returned [193]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[193]
// Phase 1: matrix 193 rows 144 cols
[2021-05-16 04:16:40] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-16 04:16:40] [INFO ] Dead Transitions using invariants and state equation in 152 ms returned []
Starting structural reductions, iteration 1 : 144/345 places, 193/395 transitions.
Applied a total of 0 rules in 13 ms. Remains 144 /144 variables (removed 0) and now considering 193/193 (removed 0) transitions.
[2021-05-16 04:16:40] [INFO ] Redundant transitions in 56 ms returned []
// Phase 1: matrix 193 rows 144 cols
[2021-05-16 04:16:40] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-16 04:16:41] [INFO ] Dead Transitions using invariants and state equation in 135 ms returned []
Finished structural reductions, in 2 iterations. Remains : 144/345 places, 193/395 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-010B-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s59 1), p0:(AND (NEQ s3 0) (NEQ s59 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 150 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-010B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010B-01 finished in 956 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X((G(p1)&&F(p2)&&X(!p0)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 345 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 345/345 places, 395/395 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 334 transition count 384
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 334 transition count 384
Applied a total of 22 rules in 18 ms. Remains 334 /345 variables (removed 11) and now considering 384/395 (removed 11) transitions.
// Phase 1: matrix 384 rows 334 cols
[2021-05-16 04:16:41] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-16 04:16:41] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 384 rows 334 cols
[2021-05-16 04:16:41] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-16 04:16:41] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
// Phase 1: matrix 384 rows 334 cols
[2021-05-16 04:16:41] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-16 04:16:41] [INFO ] Dead Transitions using invariants and state equation in 268 ms returned []
Finished structural reductions, in 1 iterations. Remains : 334/345 places, 384/395 transitions.
Stuttering acceptance computed with spot in 525 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1) p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (NOT p1) p0), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2) p0), (OR (NOT p2) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010B-02 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 10}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 8}, { cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 9}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 9}, { cond=p0, acceptance={} source=2 dest: 10}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(OR p0 (NOT p1)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 9}, { cond=p0, acceptance={} source=5 dest: 10}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND p1 p2), acceptance={} source=7 dest: 4}, { cond=(NOT p1), acceptance={} source=7 dest: 9}], [{ cond=(AND p1 p2), acceptance={0} source=8 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=8 dest: 8}, { cond=(NOT p1), acceptance={0} source=8 dest: 9}], [{ cond=true, acceptance={0} source=9 dest: 9}], [{ cond=(NOT p0), acceptance={} source=10 dest: 9}, { cond=p0, acceptance={} source=10 dest: 10}]], initial=6, aps=[p0:(EQ s101 1), p1:(OR (NEQ s51 1) (NEQ s85 1) (NEQ s106 1)), p2:(NEQ s133 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6182 steps with 13 reset in 95 ms.
FORMULA ShieldRVs-PT-010B-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010B-02 finished in 1398 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 345 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 345/345 places, 395/395 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 344 transition count 355
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 305 transition count 355
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 78 place count 305 transition count 305
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 178 place count 255 transition count 305
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 190 place count 243 transition count 293
Iterating global reduction 2 with 12 rules applied. Total rules applied 202 place count 243 transition count 293
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 202 place count 243 transition count 288
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 212 place count 238 transition count 288
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 396 place count 146 transition count 196
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 397 place count 145 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 398 place count 144 transition count 194
Applied a total of 398 rules in 100 ms. Remains 144 /345 variables (removed 201) and now considering 194/395 (removed 201) transitions.
// Phase 1: matrix 194 rows 144 cols
[2021-05-16 04:16:42] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-16 04:16:42] [INFO ] Implicit Places using invariants in 216 ms returned []
// Phase 1: matrix 194 rows 144 cols
[2021-05-16 04:16:42] [INFO ] Computed 41 place invariants in 4 ms
[2021-05-16 04:16:43] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
[2021-05-16 04:16:43] [INFO ] Redundant transitions in 38 ms returned [193]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[193]
// Phase 1: matrix 193 rows 144 cols
[2021-05-16 04:16:43] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-16 04:16:43] [INFO ] Dead Transitions using invariants and state equation in 120 ms returned []
Starting structural reductions, iteration 1 : 144/345 places, 193/395 transitions.
Applied a total of 0 rules in 6 ms. Remains 144 /144 variables (removed 0) and now considering 193/193 (removed 0) transitions.
[2021-05-16 04:16:43] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 193 rows 144 cols
[2021-05-16 04:16:43] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-16 04:16:43] [INFO ] Dead Transitions using invariants and state equation in 121 ms returned []
Finished structural reductions, in 2 iterations. Remains : 144/345 places, 193/395 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-010B-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s77 1) (EQ s79 1) (EQ s84 1)), p1:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 153 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-010B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010B-03 finished in 1223 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 345 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 345/345 places, 395/395 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 333 transition count 383
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 333 transition count 383
Applied a total of 24 rules in 19 ms. Remains 333 /345 variables (removed 12) and now considering 383/395 (removed 12) transitions.
// Phase 1: matrix 383 rows 333 cols
[2021-05-16 04:16:43] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-16 04:16:43] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 383 rows 333 cols
[2021-05-16 04:16:43] [INFO ] Computed 41 place invariants in 4 ms
[2021-05-16 04:16:44] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 333 cols
[2021-05-16 04:16:44] [INFO ] Computed 41 place invariants in 8 ms
[2021-05-16 04:16:44] [INFO ] Dead Transitions using invariants and state equation in 437 ms returned []
Finished structural reductions, in 1 iterations. Remains : 333/345 places, 383/395 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-010B-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s182 1), p1:(OR (NEQ s179 1) (NEQ s216 1) (NEQ s236 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 311 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-010B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010B-05 finished in 1117 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||F(((F(!p0)&&X(X(p1)))||G(F(!p0))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 345 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 345/345 places, 395/395 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 333 transition count 383
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 333 transition count 383
Applied a total of 24 rules in 13 ms. Remains 333 /345 variables (removed 12) and now considering 383/395 (removed 12) transitions.
// Phase 1: matrix 383 rows 333 cols
[2021-05-16 04:16:44] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-16 04:16:45] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 383 rows 333 cols
[2021-05-16 04:16:45] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-16 04:16:45] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 333 cols
[2021-05-16 04:16:45] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-16 04:16:45] [INFO ] Dead Transitions using invariants and state equation in 274 ms returned []
Finished structural reductions, in 1 iterations. Remains : 333/345 places, 383/395 transitions.
Stuttering acceptance computed with spot in 234 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : ShieldRVs-PT-010B-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=p0, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s202 1), p1:(EQ s313 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 657 reset in 254 ms.
Product exploration explored 100000 steps with 658 reset in 362 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 245 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 644 reset in 232 ms.
Product exploration explored 100000 steps with 656 reset in 293 ms.
Applying partial POR strategy [false, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 267 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Support contains 2 out of 333 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 333/333 places, 383/383 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 333 transition count 383
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 40 place count 333 transition count 395
Deduced a syphon composed of 60 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 60 place count 333 transition count 395
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 190 places in 0 ms
Iterating global reduction 1 with 130 rules applied. Total rules applied 190 place count 333 transition count 395
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 260 place count 263 transition count 325
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 1 with 70 rules applied. Total rules applied 330 place count 263 transition count 325
Deduced a syphon composed of 120 places in 0 ms
Applied a total of 330 rules in 61 ms. Remains 263 /333 variables (removed 70) and now considering 325/383 (removed 58) transitions.
[2021-05-16 04:16:48] [INFO ] Redundant transitions in 81 ms returned [324]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[324]
// Phase 1: matrix 324 rows 263 cols
[2021-05-16 04:16:48] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-16 04:16:48] [INFO ] Dead Transitions using invariants and state equation in 235 ms returned []
Starting structural reductions, iteration 1 : 263/333 places, 324/383 transitions.
Deduced a syphon composed of 120 places in 0 ms
Applied a total of 0 rules in 10 ms. Remains 263 /263 variables (removed 0) and now considering 324/324 (removed 0) transitions.
[2021-05-16 04:16:48] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 324 rows 263 cols
[2021-05-16 04:16:48] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-16 04:16:48] [INFO ] Dead Transitions using invariants and state equation in 206 ms returned []
Finished structural reductions, in 2 iterations. Remains : 263/333 places, 324/383 transitions.
Product exploration explored 100000 steps with 656 reset in 230 ms.
Product exploration explored 100000 steps with 654 reset in 248 ms.
[2021-05-16 04:16:49] [INFO ] Flatten gal took : 23 ms
[2021-05-16 04:16:49] [INFO ] Flatten gal took : 19 ms
[2021-05-16 04:16:49] [INFO ] Time to serialize gal into /tmp/LTL6994409994927925477.gal : 6 ms
[2021-05-16 04:16:49] [INFO ] Time to serialize properties into /tmp/LTL4949330201946987857.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/LTL6994409994927925477.gal, -t, CGAL, -LTL, /tmp/LTL4949330201946987857.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/LTL6994409994927925477.gal -t CGAL -LTL /tmp/LTL4949330201946987857.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("(p243==1)")||(F(((F("(p243!=1)"))&&(X(X("(p379==1)"))))||(G(F("(p243!=1)")))))))))
Formula 0 simplified : !XX("(p243==1)" | F((F"(p243!=1)" & XX"(p379==1)") | GF"(p243!=1)"))
Detected timeout of ITS tools.
[2021-05-16 04:17:04] [INFO ] Flatten gal took : 18 ms
[2021-05-16 04:17:04] [INFO ] Applying decomposition
[2021-05-16 04:17:04] [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/graph570566314121523212.txt, -o, /tmp/graph570566314121523212.bin, -w, /tmp/graph570566314121523212.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/graph570566314121523212.bin, -l, -1, -v, -w, /tmp/graph570566314121523212.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 04:17:04] [INFO ] Decomposing Gal with order
[2021-05-16 04:17:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 04:17:04] [INFO ] Removed a total of 351 redundant transitions.
[2021-05-16 04:17:04] [INFO ] Flatten gal took : 48 ms
[2021-05-16 04:17:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-05-16 04:17:04] [INFO ] Time to serialize gal into /tmp/LTL14095330257357043752.gal : 7 ms
[2021-05-16 04:17:04] [INFO ] Time to serialize properties into /tmp/LTL9764392535579566100.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/LTL14095330257357043752.gal, -t, CGAL, -LTL, /tmp/LTL9764392535579566100.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/LTL14095330257357043752.gal -t CGAL -LTL /tmp/LTL9764392535579566100.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(("(i6.i2.u76.p243==1)")||(F(((F("(i6.i2.u76.p243!=1)"))&&(X(X("(i10.i0.u118.p379==1)"))))||(G(F("(i6.i2.u76.p243!=1)")))))))))
Formula 0 simplified : !XX("(i6.i2.u76.p243==1)" | F((F"(i6.i2.u76.p243!=1)" & XX"(i10.i0.u118.p379==1)") | GF"(i6.i2.u76.p243!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11499178926694097869
[2021-05-16 04:17:19] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11499178926694097869
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/ltsmin11499178926694097869]
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/ltsmin11499178926694097869] 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/ltsmin11499178926694097869] 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 ShieldRVs-PT-010B-07 finished in 35539 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0) U (p1||X(p2))) U p1))], workingDir=/home/mcc/execution]
Support contains 7 out of 345 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 345/345 places, 395/395 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 332 transition count 382
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 332 transition count 382
Applied a total of 26 rules in 7 ms. Remains 332 /345 variables (removed 13) and now considering 382/395 (removed 13) transitions.
// Phase 1: matrix 382 rows 332 cols
[2021-05-16 04:17:20] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-16 04:17:20] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 382 rows 332 cols
[2021-05-16 04:17:20] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-16 04:17:20] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
// Phase 1: matrix 382 rows 332 cols
[2021-05-16 04:17:20] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-16 04:17:21] [INFO ] Dead Transitions using invariants and state equation in 260 ms returned []
Finished structural reductions, in 1 iterations. Remains : 332/345 places, 382/395 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010B-08 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s19 1) (EQ s55 1) (EQ s74 1)), p0:(EQ s195 1), p2:(AND (EQ s243 1) (EQ s277 1) (EQ s299 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 3 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-010B-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010B-08 finished in 936 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0) U X(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 345 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 345/345 places, 395/395 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 332 transition count 382
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 332 transition count 382
Applied a total of 26 rules in 7 ms. Remains 332 /345 variables (removed 13) and now considering 382/395 (removed 13) transitions.
// Phase 1: matrix 382 rows 332 cols
[2021-05-16 04:17:21] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-16 04:17:21] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 382 rows 332 cols
[2021-05-16 04:17:21] [INFO ] Computed 41 place invariants in 8 ms
[2021-05-16 04:17:21] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
// Phase 1: matrix 382 rows 332 cols
[2021-05-16 04:17:21] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-16 04:17:22] [INFO ] Dead Transitions using invariants and state equation in 248 ms returned []
Finished structural reductions, in 1 iterations. Remains : 332/345 places, 382/395 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010B-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s47 1), p1:(AND (EQ s243 1) (EQ s277 1) (EQ s299 1))], nbAcceptance=0, 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]]
Product exploration explored 100000 steps with 997 reset in 204 ms.
Product exploration explored 100000 steps with 972 reset in 218 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 971 reset in 327 ms.
Product exploration explored 100000 steps with 999 reset in 347 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 285 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 332 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 332/332 places, 382/382 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 332 transition count 382
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 38 place count 332 transition count 395
Deduced a syphon composed of 61 places in 1 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 61 place count 332 transition count 395
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 186 places in 1 ms
Iterating global reduction 1 with 125 rules applied. Total rules applied 186 place count 332 transition count 395
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 253 place count 265 transition count 328
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 1 with 67 rules applied. Total rules applied 320 place count 265 transition count 328
Deduced a syphon composed of 119 places in 0 ms
Applied a total of 320 rules in 54 ms. Remains 265 /332 variables (removed 67) and now considering 328/382 (removed 54) transitions.
[2021-05-16 04:17:24] [INFO ] Redundant transitions in 54 ms returned [327]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[327]
// Phase 1: matrix 327 rows 265 cols
[2021-05-16 04:17:24] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-16 04:17:24] [INFO ] Dead Transitions using invariants and state equation in 302 ms returned []
Starting structural reductions, iteration 1 : 265/332 places, 327/382 transitions.
Deduced a syphon composed of 119 places in 1 ms
Applied a total of 0 rules in 12 ms. Remains 265 /265 variables (removed 0) and now considering 327/327 (removed 0) transitions.
[2021-05-16 04:17:24] [INFO ] Redundant transitions in 45 ms returned []
// Phase 1: matrix 327 rows 265 cols
[2021-05-16 04:17:24] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-16 04:17:24] [INFO ] Dead Transitions using invariants and state equation in 317 ms returned []
Finished structural reductions, in 2 iterations. Remains : 265/332 places, 327/382 transitions.
Product exploration explored 100000 steps with 10060 reset in 903 ms.
Product exploration explored 100000 steps with 10020 reset in 694 ms.
[2021-05-16 04:17:26] [INFO ] Flatten gal took : 23 ms
[2021-05-16 04:17:26] [INFO ] Flatten gal took : 16 ms
[2021-05-16 04:17:26] [INFO ] Time to serialize gal into /tmp/LTL5765817947874208964.gal : 3 ms
[2021-05-16 04:17:26] [INFO ] Time to serialize properties into /tmp/LTL16626051702227912341.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/LTL5765817947874208964.gal, -t, CGAL, -LTL, /tmp/LTL16626051702227912341.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/LTL5765817947874208964.gal -t CGAL -LTL /tmp/LTL16626051702227912341.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(p54==1)"))U(X("(((p292==1)&&(p333==1))&&(p361==1))")))))
Formula 0 simplified : !X(F"(p54==1)" U X"(((p292==1)&&(p333==1))&&(p361==1))")
Detected timeout of ITS tools.
[2021-05-16 04:17:41] [INFO ] Flatten gal took : 19 ms
[2021-05-16 04:17:41] [INFO ] Applying decomposition
[2021-05-16 04:17:41] [INFO ] Flatten gal took : 16 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/graph14081317261310595359.txt, -o, /tmp/graph14081317261310595359.bin, -w, /tmp/graph14081317261310595359.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/graph14081317261310595359.bin, -l, -1, -v, -w, /tmp/graph14081317261310595359.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 04:17:41] [INFO ] Decomposing Gal with order
[2021-05-16 04:17:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 04:17:41] [INFO ] Removed a total of 351 redundant transitions.
[2021-05-16 04:17:41] [INFO ] Flatten gal took : 42 ms
[2021-05-16 04:17:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-16 04:17:41] [INFO ] Time to serialize gal into /tmp/LTL5184856503751188681.gal : 7 ms
[2021-05-16 04:17:41] [INFO ] Time to serialize properties into /tmp/LTL17761121189331369309.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/LTL5184856503751188681.gal, -t, CGAL, -LTL, /tmp/LTL17761121189331369309.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/LTL5184856503751188681.gal -t CGAL -LTL /tmp/LTL17761121189331369309.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("(i1.i0.u18.p54==1)"))U(X("(((i7.i2.u92.p292==1)&&(i8.i2.u104.p333==1))&&(i8.i3.u112.p361==1))")))))
Formula 0 simplified : !X(F"(i1.i0.u18.p54==1)" U X"(((i7.i2.u92.p292==1)&&(i8.i2.u104.p333==1))&&(i8.i3.u112.p361==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8552760038002978382
[2021-05-16 04:17:56] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8552760038002978382
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/ltsmin8552760038002978382]
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/ltsmin8552760038002978382] 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/ltsmin8552760038002978382] 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 ShieldRVs-PT-010B-09 finished in 36334 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 345 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 345/345 places, 395/395 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 344 transition count 353
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 303 transition count 353
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 82 place count 303 transition count 303
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 182 place count 253 transition count 303
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 195 place count 240 transition count 290
Iterating global reduction 2 with 13 rules applied. Total rules applied 208 place count 240 transition count 290
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 208 place count 240 transition count 285
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 218 place count 235 transition count 285
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 400 place count 144 transition count 194
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 401 place count 143 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 402 place count 142 transition count 192
Applied a total of 402 rules in 33 ms. Remains 142 /345 variables (removed 203) and now considering 192/395 (removed 203) transitions.
// Phase 1: matrix 192 rows 142 cols
[2021-05-16 04:17:57] [INFO ] Computed 41 place invariants in 0 ms
[2021-05-16 04:17:57] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 192 rows 142 cols
[2021-05-16 04:17:57] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-16 04:17:58] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2021-05-16 04:17:58] [INFO ] Redundant transitions in 55 ms returned [191]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[191]
// Phase 1: matrix 191 rows 142 cols
[2021-05-16 04:17:58] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-16 04:17:58] [INFO ] Dead Transitions using invariants and state equation in 148 ms returned []
Starting structural reductions, iteration 1 : 142/345 places, 191/395 transitions.
Applied a total of 0 rules in 6 ms. Remains 142 /142 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2021-05-16 04:17:58] [INFO ] Redundant transitions in 43 ms returned []
// Phase 1: matrix 191 rows 142 cols
[2021-05-16 04:17:58] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-16 04:17:58] [INFO ] Dead Transitions using invariants and state equation in 151 ms returned []
Finished structural reductions, in 2 iterations. Remains : 142/345 places, 191/395 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010B-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s100 0) (OR (NEQ s24 1) (NEQ s28 1) (NEQ s37 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 147 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-010B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010B-10 finished in 868 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F((p0||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 345 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 345/345 places, 395/395 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 334 transition count 384
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 334 transition count 384
Applied a total of 22 rules in 11 ms. Remains 334 /345 variables (removed 11) and now considering 384/395 (removed 11) transitions.
// Phase 1: matrix 384 rows 334 cols
[2021-05-16 04:17:58] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-16 04:17:58] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 384 rows 334 cols
[2021-05-16 04:17:58] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-16 04:17:59] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
// Phase 1: matrix 384 rows 334 cols
[2021-05-16 04:17:59] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-16 04:17:59] [INFO ] Dead Transitions using invariants and state equation in 362 ms returned []
Finished structural reductions, in 1 iterations. Remains : 334/345 places, 384/395 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-010B-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(EQ s121 1), p0:(NEQ s230 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 25000 reset in 439 ms.
Product exploration explored 100000 steps with 25000 reset in 462 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 423 ms.
Product exploration explored 100000 steps with 25000 reset in 334 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 334 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 334/334 places, 384/384 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 334 transition count 384
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 40 place count 334 transition count 399
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 61 place count 334 transition count 399
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 189 places in 0 ms
Iterating global reduction 1 with 128 rules applied. Total rules applied 189 place count 334 transition count 399
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 258 place count 265 transition count 330
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 1 with 69 rules applied. Total rules applied 327 place count 265 transition count 330
Deduced a syphon composed of 120 places in 0 ms
Applied a total of 327 rules in 54 ms. Remains 265 /334 variables (removed 69) and now considering 330/384 (removed 54) transitions.
[2021-05-16 04:18:01] [INFO ] Redundant transitions in 111 ms returned [329]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[329]
// Phase 1: matrix 329 rows 265 cols
[2021-05-16 04:18:01] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-16 04:18:02] [INFO ] Dead Transitions using invariants and state equation in 459 ms returned []
Starting structural reductions, iteration 1 : 265/334 places, 329/384 transitions.
Deduced a syphon composed of 120 places in 0 ms
Applied a total of 0 rules in 6 ms. Remains 265 /265 variables (removed 0) and now considering 329/329 (removed 0) transitions.
[2021-05-16 04:18:02] [INFO ] Redundant transitions in 134 ms returned []
// Phase 1: matrix 329 rows 265 cols
[2021-05-16 04:18:02] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-16 04:18:02] [INFO ] Dead Transitions using invariants and state equation in 341 ms returned []
Finished structural reductions, in 2 iterations. Remains : 265/334 places, 329/384 transitions.
Product exploration explored 100000 steps with 25000 reset in 1035 ms.
Product exploration explored 100000 steps with 25000 reset in 882 ms.
[2021-05-16 04:18:04] [INFO ] Flatten gal took : 15 ms
[2021-05-16 04:18:04] [INFO ] Flatten gal took : 15 ms
[2021-05-16 04:18:04] [INFO ] Time to serialize gal into /tmp/LTL2127871595875726545.gal : 3 ms
[2021-05-16 04:18:04] [INFO ] Time to serialize properties into /tmp/LTL7246147671829666458.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/LTL2127871595875726545.gal, -t, CGAL, -LTL, /tmp/LTL7246147671829666458.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/LTL2127871595875726545.gal -t CGAL -LTL /tmp/LTL7246147671829666458.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F(("(p276!=1)")||(G("(p144==1)"))))))))
Formula 0 simplified : !XXXF("(p276!=1)" | G"(p144==1)")
Detected timeout of ITS tools.
[2021-05-16 04:18:19] [INFO ] Flatten gal took : 15 ms
[2021-05-16 04:18:19] [INFO ] Applying decomposition
[2021-05-16 04:18:20] [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/graph2818884326725897484.txt, -o, /tmp/graph2818884326725897484.bin, -w, /tmp/graph2818884326725897484.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/graph2818884326725897484.bin, -l, -1, -v, -w, /tmp/graph2818884326725897484.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 04:18:20] [INFO ] Decomposing Gal with order
[2021-05-16 04:18:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 04:18:20] [INFO ] Removed a total of 351 redundant transitions.
[2021-05-16 04:18:20] [INFO ] Flatten gal took : 36 ms
[2021-05-16 04:18:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-16 04:18:20] [INFO ] Time to serialize gal into /tmp/LTL12161286759758982638.gal : 5 ms
[2021-05-16 04:18:20] [INFO ] Time to serialize properties into /tmp/LTL17007968326183610667.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/LTL12161286759758982638.gal, -t, CGAL, -LTL, /tmp/LTL17007968326183610667.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/LTL12161286759758982638.gal -t CGAL -LTL /tmp/LTL17007968326183610667.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F(("(i7.i2.u88.p276!=1)")||(G("(i3.i2.u47.p144==1)"))))))))
Formula 0 simplified : !XXXF("(i7.i2.u88.p276!=1)" | G"(i3.i2.u47.p144==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17249155227019807639
[2021-05-16 04:18:35] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17249155227019807639
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/ltsmin17249155227019807639]
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/ltsmin17249155227019807639] 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/ltsmin17249155227019807639] 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 ShieldRVs-PT-010B-14 finished in 37648 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 345 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 345/345 places, 395/395 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 344 transition count 354
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 304 transition count 354
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 80 place count 304 transition count 304
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 180 place count 254 transition count 304
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 192 place count 242 transition count 292
Iterating global reduction 2 with 12 rules applied. Total rules applied 204 place count 242 transition count 292
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 204 place count 242 transition count 288
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 212 place count 238 transition count 288
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 398 place count 145 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 399 place count 144 transition count 194
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 400 place count 143 transition count 193
Applied a total of 400 rules in 41 ms. Remains 143 /345 variables (removed 202) and now considering 193/395 (removed 202) transitions.
// Phase 1: matrix 193 rows 143 cols
[2021-05-16 04:18:36] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-16 04:18:36] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 193 rows 143 cols
[2021-05-16 04:18:36] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-16 04:18:36] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2021-05-16 04:18:36] [INFO ] Redundant transitions in 37 ms returned [192]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[192]
// Phase 1: matrix 192 rows 143 cols
[2021-05-16 04:18:36] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-16 04:18:36] [INFO ] Dead Transitions using invariants and state equation in 140 ms returned []
Starting structural reductions, iteration 1 : 143/345 places, 192/395 transitions.
Applied a total of 0 rules in 3 ms. Remains 143 /143 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2021-05-16 04:18:36] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 192 rows 143 cols
[2021-05-16 04:18:36] [INFO ] Computed 41 place invariants in 0 ms
[2021-05-16 04:18:36] [INFO ] Dead Transitions using invariants and state equation in 119 ms returned []
Finished structural reductions, in 2 iterations. Remains : 143/345 places, 192/395 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010B-15 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s49 1), p0:(EQ s49 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 2183 reset in 241 ms.
Product exploration explored 100000 steps with 2252 reset in 285 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 2337 reset in 251 ms.
Product exploration explored 100000 steps with 2155 reset in 276 ms.
[2021-05-16 04:18:38] [INFO ] Flatten gal took : 8 ms
[2021-05-16 04:18:38] [INFO ] Flatten gal took : 8 ms
[2021-05-16 04:18:38] [INFO ] Time to serialize gal into /tmp/LTL604517086181032827.gal : 6 ms
[2021-05-16 04:18:38] [INFO ] Time to serialize properties into /tmp/LTL14565624234515178507.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/LTL604517086181032827.gal, -t, CGAL, -LTL, /tmp/LTL14565624234515178507.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/LTL604517086181032827.gal -t CGAL -LTL /tmp/LTL14565624234515178507.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(p143==0)")&&(G(F("(p143!=1)"))))))
Formula 0 simplified : !F("(p143==0)" & GF"(p143!=1)")
Detected timeout of ITS tools.
[2021-05-16 04:18:53] [INFO ] Flatten gal took : 8 ms
[2021-05-16 04:18:53] [INFO ] Applying decomposition
[2021-05-16 04:18:53] [INFO ] Flatten gal took : 9 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/graph10028540511317467695.txt, -o, /tmp/graph10028540511317467695.bin, -w, /tmp/graph10028540511317467695.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/graph10028540511317467695.bin, -l, -1, -v, -w, /tmp/graph10028540511317467695.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 04:18:53] [INFO ] Decomposing Gal with order
[2021-05-16 04:18:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 04:18:53] [INFO ] Removed a total of 211 redundant transitions.
[2021-05-16 04:18:53] [INFO ] Flatten gal took : 20 ms
[2021-05-16 04:18:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 182 labels/synchronizations in 9 ms.
[2021-05-16 04:18:53] [INFO ] Time to serialize gal into /tmp/LTL15516531949294738082.gal : 2 ms
[2021-05-16 04:18:53] [INFO ] Time to serialize properties into /tmp/LTL11201260277006545417.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/LTL15516531949294738082.gal, -t, CGAL, -LTL, /tmp/LTL11201260277006545417.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/LTL15516531949294738082.gal -t CGAL -LTL /tmp/LTL11201260277006545417.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(("(i3.u13.p143==0)")&&(G(F("(i3.u13.p143!=1)"))))))
Formula 0 simplified : !F("(i3.u13.p143==0)" & GF"(i3.u13.p143!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15891504899938387304
[2021-05-16 04:19:08] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15891504899938387304
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/ltsmin15891504899938387304]
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/ltsmin15891504899938387304] 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/ltsmin15891504899938387304] 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 ShieldRVs-PT-010B-15 finished in 33306 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-16 04:19:09] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin516494967596979356
[2021-05-16 04:19:09] [INFO ] Computing symmetric may disable matrix : 395 transitions.
[2021-05-16 04:19:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 04:19:09] [INFO ] Computing symmetric may enable matrix : 395 transitions.
[2021-05-16 04:19:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 04:19:09] [INFO ] Flatten gal took : 29 ms
[2021-05-16 04:19:09] [INFO ] Computing Do-Not-Accords matrix : 395 transitions.
[2021-05-16 04:19:09] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 04:19:09] [INFO ] Built C files in 119ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin516494967596979356
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/ltsmin516494967596979356]
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/graph4393007511993084134.txt, -o, /tmp/graph4393007511993084134.bin, -w, /tmp/graph4393007511993084134.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/graph4393007511993084134.bin, -l, -1, -v, -w, /tmp/graph4393007511993084134.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 04:19:09] [INFO ] Decomposing Gal with order
[2021-05-16 04:19:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 04:19:09] [INFO ] Removed a total of 351 redundant transitions.
[2021-05-16 04:19:09] [INFO ] Flatten gal took : 67 ms
[2021-05-16 04:19:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-16 04:19:09] [INFO ] Time to serialize gal into /tmp/LTLFireability2659754272931289349.gal : 25 ms
[2021-05-16 04:19:09] [INFO ] Time to serialize properties into /tmp/LTLFireability12512167274143335980.ltl : 46 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/LTLFireability2659754272931289349.gal, -t, CGAL, -LTL, /tmp/LTLFireability12512167274143335980.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/LTLFireability2659754272931289349.gal -t CGAL -LTL /tmp/LTLFireability12512167274143335980.ltl -c -stutter-deadlock
Read 5 LTL properties
Checking formula 0 : !((X(("(i0.i0.u15.p45==1)")||(F(("(i7.i0.u90.p288==1)")||(G("(i4.i0.u58.p183==1)")))))))
Formula 0 simplified : !X("(i0.i0.u15.p45==1)" | F("(i7.i0.u90.p288==1)" | G"(i4.i0.u58.p183==1)"))
Compilation finished in 3283 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin516494967596979356]
Link finished in 55 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true)||<>(((LTLAPp1==true)||[]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin516494967596979356]
WARNING : LTSmin timed out (>300 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true)||<>(((LTLAPp1==true)||[]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin516494967596979356]
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(((LTLAPp3==true)||<>(((<>(!(LTLAPp3==true))&&X(X((LTLAPp4==true))))||[](<>(!(LTLAPp3==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin516494967596979356]
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(((LTLAPp3==true)||<>(((<>(!(LTLAPp3==true))&&X(X((LTLAPp4==true))))||[](<>(!(LTLAPp3==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin516494967596979356]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp5==true)) U X((LTLAPp6==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin516494967596979356]
LTSmin run took 1062 ms.
FORMULA ShieldRVs-PT-010B-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X(<>(((LTLAPp7==true)||[]((LTLAPp8==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin516494967596979356]
LTSmin run took 271 ms.
FORMULA ShieldRVs-PT-010B-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(((LTLAPp9==true)&&[](<>((LTLAPp10==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin516494967596979356]
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, <>(((LTLAPp9==true)&&[](<>((LTLAPp10==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin516494967596979356]
Retrying LTSmin with larger timeout 2400 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true)||<>(((LTLAPp1==true)||[]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin516494967596979356]
Detected timeout of ITS tools.
[2021-05-16 04:40:15] [INFO ] Applying decomposition
[2021-05-16 04:40:15] [INFO ] Flatten gal took : 30 ms
[2021-05-16 04:40:15] [INFO ] Decomposing Gal with order
[2021-05-16 04:40:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 04:40:15] [INFO ] Removed a total of 207 redundant transitions.
[2021-05-16 04:40:15] [INFO ] Flatten gal took : 78 ms
[2021-05-16 04:40:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 312 labels/synchronizations in 50 ms.
[2021-05-16 04:40:15] [INFO ] Time to serialize gal into /tmp/LTLFireability11822206464528133173.gal : 6 ms
[2021-05-16 04:40:15] [INFO ] Time to serialize properties into /tmp/LTLFireability2999538651453594977.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/LTLFireability11822206464528133173.gal, -t, CGAL, -LTL, /tmp/LTLFireability2999538651453594977.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/LTLFireability11822206464528133173.gal -t CGAL -LTL /tmp/LTLFireability2999538651453594977.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((X(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u17.p45==1)")||(F(("(i0.i0.i1.i0.u113.p288==1)")||(G("(i0.i0.i0.i0.i0.i1.i0.i0.u43.p183==1)")))))))
Formula 0 simplified : !X("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u17.p45==1)" | F("(i0.i0.i1.i0.u113.p288==1)" | G"(i0.i0.i0.i0.i0.i1.i0.i0.u43.p183==1)"))
Detected timeout of ITS tools.
[2021-05-16 05:01:21] [INFO ] Flatten gal took : 49 ms
[2021-05-16 05:01:21] [INFO ] Input system was already deterministic with 395 transitions.
[2021-05-16 05:01:22] [INFO ] Transformed 345 places.
[2021-05-16 05:01:22] [INFO ] Transformed 395 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-16 05:01:22] [INFO ] Time to serialize gal into /tmp/LTLFireability11234228423568511003.gal : 3 ms
[2021-05-16 05:01:22] [INFO ] Time to serialize properties into /tmp/LTLFireability8618879190453919264.ltl : 4 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/LTLFireability11234228423568511003.gal, -t, CGAL, -LTL, /tmp/LTLFireability8618879190453919264.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/LTLFireability11234228423568511003.gal -t CGAL -LTL /tmp/LTLFireability8618879190453919264.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(("(p45==1)")||(F(("(p288==1)")||(G("(p183==1)")))))))
Formula 0 simplified : !X("(p45==1)" | F("(p288==1)" | G"(p183==1)"))
WARNING : LTSmin timed out (>2400 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true)||<>(((LTLAPp1==true)||[]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin516494967596979356]
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(((LTLAPp3==true)||<>(((<>(!(LTLAPp3==true))&&X(X((LTLAPp4==true))))||[](<>(!(LTLAPp3==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin516494967596979356]
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="ShieldRVs-PT-010B"
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 ShieldRVs-PT-010B, 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 r235-smll-162106564400093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-010B.tgz
mv ShieldRVs-PT-010B 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 '
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 ;