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

About the Execution of ITS-Tools for ShieldPPPs-PT-050B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16245.256 3600000.00 11607161.00 5470.50 FFFFTTFFFFTFTF?F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r216-tall-162098205400668.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPs-PT-050B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205400668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 12:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 12:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 18:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 18:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 888K 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 ShieldPPPs-PT-050B-00
FORMULA_NAME ShieldPPPs-PT-050B-01
FORMULA_NAME ShieldPPPs-PT-050B-02
FORMULA_NAME ShieldPPPs-PT-050B-03
FORMULA_NAME ShieldPPPs-PT-050B-04
FORMULA_NAME ShieldPPPs-PT-050B-05
FORMULA_NAME ShieldPPPs-PT-050B-06
FORMULA_NAME ShieldPPPs-PT-050B-07
FORMULA_NAME ShieldPPPs-PT-050B-08
FORMULA_NAME ShieldPPPs-PT-050B-09
FORMULA_NAME ShieldPPPs-PT-050B-10
FORMULA_NAME ShieldPPPs-PT-050B-11
FORMULA_NAME ShieldPPPs-PT-050B-12
FORMULA_NAME ShieldPPPs-PT-050B-13
FORMULA_NAME ShieldPPPs-PT-050B-14
FORMULA_NAME ShieldPPPs-PT-050B-15

=== Now, execution of the tool begins

BK_START 1621158267994

Running Version 0
[2021-05-16 09:44:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 09:44:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 09:44:29] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2021-05-16 09:44:29] [INFO ] Transformed 3403 places.
[2021-05-16 09:44:30] [INFO ] Transformed 3153 transitions.
[2021-05-16 09:44:30] [INFO ] Found NUPN structural information;
[2021-05-16 09:44:30] [INFO ] Parsed PT model containing 3403 places and 3153 transitions in 405 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 09:44:30] [INFO ] Initial state test concluded for 1 properties.
FORMULA ShieldPPPs-PT-050B-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 3403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Discarding 342 places :
Symmetric choice reduction at 0 with 342 rule applications. Total rules 342 place count 3061 transition count 2811
Iterating global reduction 0 with 342 rules applied. Total rules applied 684 place count 3061 transition count 2811
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 685 place count 3060 transition count 2810
Iterating global reduction 0 with 1 rules applied. Total rules applied 686 place count 3060 transition count 2810
Applied a total of 686 rules in 1126 ms. Remains 3060 /3403 variables (removed 343) and now considering 2810/3153 (removed 343) transitions.
// Phase 1: matrix 2810 rows 3060 cols
[2021-05-16 09:44:31] [INFO ] Computed 551 place invariants in 34 ms
[2021-05-16 09:44:32] [INFO ] Implicit Places using invariants in 1111 ms returned []
// Phase 1: matrix 2810 rows 3060 cols
[2021-05-16 09:44:32] [INFO ] Computed 551 place invariants in 14 ms
[2021-05-16 09:44:35] [INFO ] Implicit Places using invariants and state equation in 3132 ms returned []
Implicit Place search using SMT with State Equation took 4275 ms to find 0 implicit places.
// Phase 1: matrix 2810 rows 3060 cols
[2021-05-16 09:44:35] [INFO ] Computed 551 place invariants in 20 ms
[2021-05-16 09:44:37] [INFO ] Dead Transitions using invariants and state equation in 1933 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3060/3403 places, 2810/3153 transitions.
[2021-05-16 09:44:37] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-16 09:44:37] [INFO ] Flatten gal took : 210 ms
FORMULA ShieldPPPs-PT-050B-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 09:44:38] [INFO ] Flatten gal took : 136 ms
[2021-05-16 09:44:38] [INFO ] Input system was already deterministic with 2810 transitions.
Incomplete random walk after 100000 steps, including 12 resets, run finished after 1291 ms. (steps per millisecond=77 ) properties (out of 18) seen :17
Running SMT prover for 1 properties.
// Phase 1: matrix 2810 rows 3060 cols
[2021-05-16 09:44:39] [INFO ] Computed 551 place invariants in 9 ms
[2021-05-16 09:44:40] [INFO ] [Real]Absence check using 551 positive place invariants in 204 ms returned sat
[2021-05-16 09:44:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 09:44:41] [INFO ] [Real]Absence check using state equation in 1314 ms returned sat
[2021-05-16 09:44:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 09:44:42] [INFO ] [Nat]Absence check using 551 positive place invariants in 192 ms returned sat
[2021-05-16 09:44:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 09:44:43] [INFO ] [Nat]Absence check using state equation in 1288 ms returned sat
[2021-05-16 09:44:44] [INFO ] Deduced a trap composed of 37 places in 938 ms of which 7 ms to minimize.
[2021-05-16 09:44:45] [INFO ] Deduced a trap composed of 17 places in 954 ms of which 5 ms to minimize.
[2021-05-16 09:44:46] [INFO ] Deduced a trap composed of 26 places in 882 ms of which 14 ms to minimize.
[2021-05-16 09:44:47] [INFO ] Deduced a trap composed of 18 places in 817 ms of which 3 ms to minimize.
[2021-05-16 09:44:48] [INFO ] Deduced a trap composed of 26 places in 829 ms of which 2 ms to minimize.
[2021-05-16 09:44:49] [INFO ] Deduced a trap composed of 29 places in 910 ms of which 2 ms to minimize.
[2021-05-16 09:44:50] [INFO ] Deduced a trap composed of 21 places in 891 ms of which 2 ms to minimize.
[2021-05-16 09:44:51] [INFO ] Deduced a trap composed of 24 places in 858 ms of which 2 ms to minimize.
[2021-05-16 09:44:52] [INFO ] Deduced a trap composed of 23 places in 848 ms of which 1 ms to minimize.
[2021-05-16 09:44:53] [INFO ] Deduced a trap composed of 27 places in 875 ms of which 2 ms to minimize.
[2021-05-16 09:44:54] [INFO ] Deduced a trap composed of 30 places in 832 ms of which 1 ms to minimize.
[2021-05-16 09:44:55] [INFO ] Deduced a trap composed of 28 places in 821 ms of which 2 ms to minimize.
[2021-05-16 09:44:55] [INFO ] Deduced a trap composed of 28 places in 803 ms of which 3 ms to minimize.
[2021-05-16 09:44:56] [INFO ] Deduced a trap composed of 42 places in 805 ms of which 2 ms to minimize.
[2021-05-16 09:44:57] [INFO ] Deduced a trap composed of 30 places in 798 ms of which 2 ms to minimize.
[2021-05-16 09:44:58] [INFO ] Deduced a trap composed of 29 places in 781 ms of which 2 ms to minimize.
[2021-05-16 09:44:59] [INFO ] Deduced a trap composed of 23 places in 795 ms of which 2 ms to minimize.
[2021-05-16 09:45:00] [INFO ] Deduced a trap composed of 20 places in 714 ms of which 2 ms to minimize.
[2021-05-16 09:45:01] [INFO ] Deduced a trap composed of 23 places in 705 ms of which 2 ms to minimize.
[2021-05-16 09:45:01] [INFO ] Deduced a trap composed of 25 places in 698 ms of which 1 ms to minimize.
[2021-05-16 09:45:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(G((p0 U p1)))) U G(p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 3060 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3053 transition count 2803
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3053 transition count 2803
Applied a total of 14 rules in 300 ms. Remains 3053 /3060 variables (removed 7) and now considering 2803/2810 (removed 7) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2021-05-16 09:45:02] [INFO ] Computed 551 place invariants in 10 ms
[2021-05-16 09:45:03] [INFO ] Implicit Places using invariants in 1222 ms returned []
// Phase 1: matrix 2803 rows 3053 cols
[2021-05-16 09:45:03] [INFO ] Computed 551 place invariants in 9 ms
[2021-05-16 09:45:06] [INFO ] Implicit Places using invariants and state equation in 3201 ms returned []
Implicit Place search using SMT with State Equation took 4428 ms to find 0 implicit places.
// Phase 1: matrix 2803 rows 3053 cols
[2021-05-16 09:45:06] [INFO ] Computed 551 place invariants in 8 ms
[2021-05-16 09:45:08] [INFO ] Dead Transitions using invariants and state equation in 1905 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3053/3060 places, 2803/2810 transitions.
Stuttering acceptance computed with spot in 346 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Running random walk in product with property : ShieldPPPs-PT-050B-01 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 6}], [{ cond=(OR p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=7 dest: 4}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(OR (EQ s1661 0) (EQ s2346 1)), p1:(EQ s1205 1), p0:(EQ s179 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20011 reset in 937 ms.
Product exploration explored 100000 steps with 19907 reset in 797 ms.
Knowledge obtained : [p2, (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Product exploration explored 100000 steps with 19937 reset in 710 ms.
Product exploration explored 100000 steps with 20007 reset in 732 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 190 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Support contains 4 out of 3053 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 349 rules applied. Total rules applied 349 place count 3053 transition count 2803
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 101 Pre rules applied. Total rules applied 349 place count 3053 transition count 2804
Deduced a syphon composed of 450 places in 6 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 450 place count 3053 transition count 2804
Performed 1047 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1497 places in 4 ms
Iterating global reduction 1 with 1047 rules applied. Total rules applied 1497 place count 3053 transition count 2804
Renaming transitions due to excessive name length > 1024 char.
Discarding 352 places :
Symmetric choice reduction at 1 with 352 rule applications. Total rules 1849 place count 2701 transition count 2452
Deduced a syphon composed of 1145 places in 6 ms
Iterating global reduction 1 with 352 rules applied. Total rules applied 2201 place count 2701 transition count 2452
Deduced a syphon composed of 1145 places in 4 ms
Applied a total of 2201 rules in 1498 ms. Remains 2701 /3053 variables (removed 352) and now considering 2452/2803 (removed 351) transitions.
[2021-05-16 09:45:14] [INFO ] Redundant transitions in 179 ms returned []
// Phase 1: matrix 2452 rows 2701 cols
[2021-05-16 09:45:14] [INFO ] Computed 551 place invariants in 26 ms
[2021-05-16 09:45:16] [INFO ] Dead Transitions using invariants and state equation in 1720 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2701/3053 places, 2452/2803 transitions.
Product exploration explored 100000 steps with 20018 reset in 4155 ms.
Product exploration explored 100000 steps with 20022 reset in 3928 ms.
[2021-05-16 09:45:24] [INFO ] Flatten gal took : 102 ms
[2021-05-16 09:45:24] [INFO ] Flatten gal took : 94 ms
[2021-05-16 09:45:24] [INFO ] Time to serialize gal into /tmp/LTL16220172514926890086.gal : 45 ms
[2021-05-16 09:45:24] [INFO ] Time to serialize properties into /tmp/LTL17659006038005214976.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/LTL16220172514926890086.gal, -t, CGAL, -LTL, /tmp/LTL17659006038005214976.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/LTL16220172514926890086.gal -t CGAL -LTL /tmp/LTL17659006038005214976.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(X(G(("(p193==1)")U("(p1338==1)")))))U(G("((p1846==0)||(p2611==1))"))))
Formula 0 simplified : !(XXG("(p193==1)" U "(p1338==1)") U G"((p1846==0)||(p2611==1))")
Detected timeout of ITS tools.
[2021-05-16 09:45:39] [INFO ] Flatten gal took : 89 ms
[2021-05-16 09:45:39] [INFO ] Applying decomposition
[2021-05-16 09:45:39] [INFO ] Flatten gal took : 86 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/graph18064297894843238099.txt, -o, /tmp/graph18064297894843238099.bin, -w, /tmp/graph18064297894843238099.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/graph18064297894843238099.bin, -l, -1, -v, -w, /tmp/graph18064297894843238099.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 09:45:40] [INFO ] Decomposing Gal with order
[2021-05-16 09:45:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 09:45:40] [INFO ] Removed a total of 450 redundant transitions.
[2021-05-16 09:45:40] [INFO ] Flatten gal took : 203 ms
[2021-05-16 09:45:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2021-05-16 09:45:41] [INFO ] Time to serialize gal into /tmp/LTL3892458349870490473.gal : 40 ms
[2021-05-16 09:45:41] [INFO ] Time to serialize properties into /tmp/LTL426864882003396899.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/LTL3892458349870490473.gal, -t, CGAL, -LTL, /tmp/LTL426864882003396899.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/LTL3892458349870490473.gal -t CGAL -LTL /tmp/LTL426864882003396899.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X(X(G(("(i2.i0.i1.u69.p193==1)")U("(i25.u470.p1338==1)")))))U(G("((i26.u650.p1846==0)||(i39.u918.p2611==1))"))))
Formula 0 simplified : !(XXG("(i2.i0.i1.u69.p193==1)" U "(i25.u470.p1338==1)") U G"((i26.u650.p1846==0)||(i39.u918.p2611==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14608815704694293498
[2021-05-16 09:45:56] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14608815704694293498
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/ltsmin14608815704694293498]
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/ltsmin14608815704694293498] 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/ltsmin14608815704694293498] 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 ShieldPPPs-PT-050B-01 finished in 55271 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U p1)&&G(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 3060 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3053 transition count 2803
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3053 transition count 2803
Applied a total of 14 rules in 283 ms. Remains 3053 /3060 variables (removed 7) and now considering 2803/2810 (removed 7) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2021-05-16 09:45:57] [INFO ] Computed 551 place invariants in 8 ms
[2021-05-16 09:45:58] [INFO ] Implicit Places using invariants in 1029 ms returned []
// Phase 1: matrix 2803 rows 3053 cols
[2021-05-16 09:45:58] [INFO ] Computed 551 place invariants in 12 ms
[2021-05-16 09:46:01] [INFO ] Implicit Places using invariants and state equation in 3138 ms returned []
Implicit Place search using SMT with State Equation took 4170 ms to find 0 implicit places.
// Phase 1: matrix 2803 rows 3053 cols
[2021-05-16 09:46:01] [INFO ] Computed 551 place invariants in 22 ms
[2021-05-16 09:46:03] [INFO ] Dead Transitions using invariants and state equation in 1880 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3053/3060 places, 2803/2810 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-050B-02 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p2), acceptance={0} source=3 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(OR (EQ s393 0) (EQ s1363 1)), p1:(EQ s293 1), p0:(EQ s1738 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-050B-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-02 finished in 6455 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((G((G(p1)||p0)) U !p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 3060 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3052 transition count 2802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3052 transition count 2802
Applied a total of 16 rules in 283 ms. Remains 3052 /3060 variables (removed 8) and now considering 2802/2810 (removed 8) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2021-05-16 09:46:03] [INFO ] Computed 551 place invariants in 18 ms
[2021-05-16 09:46:05] [INFO ] Implicit Places using invariants in 1148 ms returned []
// Phase 1: matrix 2802 rows 3052 cols
[2021-05-16 09:46:05] [INFO ] Computed 551 place invariants in 8 ms
[2021-05-16 09:46:08] [INFO ] Implicit Places using invariants and state equation in 3464 ms returned []
Implicit Place search using SMT with State Equation took 4613 ms to find 0 implicit places.
// Phase 1: matrix 2802 rows 3052 cols
[2021-05-16 09:46:08] [INFO ] Computed 551 place invariants in 12 ms
[2021-05-16 09:46:10] [INFO ] Dead Transitions using invariants and state equation in 2209 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3052/3060 places, 2802/2810 transitions.
Stuttering acceptance computed with spot in 165 ms :[p1, p1, p1, (NOT p1), (AND (NOT p1) (NOT p0)), p1, true]
Running random walk in product with property : ShieldPPPs-PT-050B-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 4}, { cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (NEQ s1098 0) (NEQ s166 1)), p0:(OR (EQ s2794 0) (EQ s2590 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6719 steps with 0 reset in 86 ms.
FORMULA ShieldPPPs-PT-050B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-03 finished in 7386 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 3060 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3052 transition count 2802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3052 transition count 2802
Applied a total of 16 rules in 305 ms. Remains 3052 /3060 variables (removed 8) and now considering 2802/2810 (removed 8) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2021-05-16 09:46:11] [INFO ] Computed 551 place invariants in 6 ms
[2021-05-16 09:46:12] [INFO ] Implicit Places using invariants in 1063 ms returned []
// Phase 1: matrix 2802 rows 3052 cols
[2021-05-16 09:46:12] [INFO ] Computed 551 place invariants in 7 ms
[2021-05-16 09:46:15] [INFO ] Implicit Places using invariants and state equation in 3174 ms returned []
Implicit Place search using SMT with State Equation took 4242 ms to find 0 implicit places.
// Phase 1: matrix 2802 rows 3052 cols
[2021-05-16 09:46:15] [INFO ] Computed 551 place invariants in 9 ms
[2021-05-16 09:46:17] [INFO ] Dead Transitions using invariants and state equation in 1958 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3052/3060 places, 2802/2810 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (EQ s2474 0) (EQ s1860 1)) (OR (EQ s1281 0) (EQ s1092 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2063 steps with 0 reset in 39 ms.
FORMULA ShieldPPPs-PT-050B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-06 finished in 6650 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0 U (G(p0)||(F(p2)&&p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 3060 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3053 transition count 2803
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3053 transition count 2803
Applied a total of 14 rules in 269 ms. Remains 3053 /3060 variables (removed 7) and now considering 2803/2810 (removed 7) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2021-05-16 09:46:17] [INFO ] Computed 551 place invariants in 7 ms
[2021-05-16 09:46:19] [INFO ] Implicit Places using invariants in 1138 ms returned []
// Phase 1: matrix 2803 rows 3053 cols
[2021-05-16 09:46:19] [INFO ] Computed 551 place invariants in 7 ms
[2021-05-16 09:46:22] [INFO ] Implicit Places using invariants and state equation in 3318 ms returned []
Implicit Place search using SMT with State Equation took 4467 ms to find 0 implicit places.
// Phase 1: matrix 2803 rows 3053 cols
[2021-05-16 09:46:22] [INFO ] Computed 551 place invariants in 7 ms
[2021-05-16 09:46:24] [INFO ] Dead Transitions using invariants and state equation in 1919 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3053/3060 places, 2803/2810 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-050B-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (NEQ s738 0) (NEQ s1570 1)), p0:(AND (NEQ s738 0) (NEQ s1570 1)), p2:(AND (NEQ s1010 0) (NEQ s1509 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 7618 steps with 0 reset in 84 ms.
FORMULA ShieldPPPs-PT-050B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-07 finished in 6836 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (G(p0)||(G(p2)&&p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 3060 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3053 transition count 2803
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3053 transition count 2803
Applied a total of 14 rules in 279 ms. Remains 3053 /3060 variables (removed 7) and now considering 2803/2810 (removed 7) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2021-05-16 09:46:24] [INFO ] Computed 551 place invariants in 6 ms
[2021-05-16 09:46:25] [INFO ] Implicit Places using invariants in 1090 ms returned []
// Phase 1: matrix 2803 rows 3053 cols
[2021-05-16 09:46:25] [INFO ] Computed 551 place invariants in 7 ms
[2021-05-16 09:46:29] [INFO ] Implicit Places using invariants and state equation in 3245 ms returned []
Implicit Place search using SMT with State Equation took 4336 ms to find 0 implicit places.
// Phase 1: matrix 2803 rows 3053 cols
[2021-05-16 09:46:29] [INFO ] Computed 551 place invariants in 7 ms
[2021-05-16 09:46:30] [INFO ] Dead Transitions using invariants and state equation in 1864 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3053/3060 places, 2803/2810 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-050B-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (NEQ s1740 0) (NEQ s2984 1)), p0:(AND (NEQ s1716 0) (NEQ s2512 1)), p1:(AND (NEQ s1716 0) (NEQ s2512 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-050B-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-08 finished in 6614 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 3060 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3053 transition count 2803
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3053 transition count 2803
Applied a total of 14 rules in 273 ms. Remains 3053 /3060 variables (removed 7) and now considering 2803/2810 (removed 7) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2021-05-16 09:46:31] [INFO ] Computed 551 place invariants in 18 ms
[2021-05-16 09:46:32] [INFO ] Implicit Places using invariants in 1107 ms returned []
// Phase 1: matrix 2803 rows 3053 cols
[2021-05-16 09:46:32] [INFO ] Computed 551 place invariants in 19 ms
[2021-05-16 09:46:35] [INFO ] Implicit Places using invariants and state equation in 3136 ms returned []
Implicit Place search using SMT with State Equation took 4245 ms to find 0 implicit places.
// Phase 1: matrix 2803 rows 3053 cols
[2021-05-16 09:46:35] [INFO ] Computed 551 place invariants in 7 ms
[2021-05-16 09:46:37] [INFO ] Dead Transitions using invariants and state equation in 1905 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3053/3060 places, 2803/2810 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s1255 0) (NEQ s2393 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 131 reset in 611 ms.
Product exploration explored 100000 steps with 133 reset in 769 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 129 reset in 566 ms.
Product exploration explored 100000 steps with 132 reset in 689 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 3053 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 349 rules applied. Total rules applied 349 place count 3053 transition count 2803
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 103 Pre rules applied. Total rules applied 349 place count 3053 transition count 2805
Deduced a syphon composed of 452 places in 6 ms
Iterating global reduction 1 with 103 rules applied. Total rules applied 452 place count 3053 transition count 2805
Performed 1046 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1498 places in 3 ms
Iterating global reduction 1 with 1046 rules applied. Total rules applied 1498 place count 3053 transition count 2805
Renaming transitions due to excessive name length > 1024 char.
Discarding 349 places :
Symmetric choice reduction at 1 with 349 rule applications. Total rules 1847 place count 2704 transition count 2456
Deduced a syphon composed of 1149 places in 3 ms
Iterating global reduction 1 with 349 rules applied. Total rules applied 2196 place count 2704 transition count 2456
Deduced a syphon composed of 1149 places in 3 ms
Applied a total of 2196 rules in 948 ms. Remains 2704 /3053 variables (removed 349) and now considering 2456/2803 (removed 347) transitions.
[2021-05-16 09:46:41] [INFO ] Redundant transitions in 162 ms returned []
// Phase 1: matrix 2456 rows 2704 cols
[2021-05-16 09:46:41] [INFO ] Computed 551 place invariants in 23 ms
[2021-05-16 09:46:43] [INFO ] Dead Transitions using invariants and state equation in 1641 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2704/3053 places, 2456/2803 transitions.
Stuttering criterion allowed to conclude after 3710 steps with 28 reset in 47 ms.
FORMULA ShieldPPPs-PT-050B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-09 finished in 12130 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 3060 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3052 transition count 2802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3052 transition count 2802
Applied a total of 16 rules in 285 ms. Remains 3052 /3060 variables (removed 8) and now considering 2802/2810 (removed 8) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2021-05-16 09:46:43] [INFO ] Computed 551 place invariants in 6 ms
[2021-05-16 09:46:44] [INFO ] Implicit Places using invariants in 1108 ms returned []
// Phase 1: matrix 2802 rows 3052 cols
[2021-05-16 09:46:44] [INFO ] Computed 551 place invariants in 7 ms
[2021-05-16 09:46:47] [INFO ] Implicit Places using invariants and state equation in 3101 ms returned []
Implicit Place search using SMT with State Equation took 4218 ms to find 0 implicit places.
// Phase 1: matrix 2802 rows 3052 cols
[2021-05-16 09:46:47] [INFO ] Computed 551 place invariants in 14 ms
[2021-05-16 09:46:49] [INFO ] Dead Transitions using invariants and state equation in 1851 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3052/3060 places, 2802/2810 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s2065 0) (EQ s536 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1407 ms.
Product exploration explored 100000 steps with 50000 reset in 1414 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 1396 ms.
Product exploration explored 100000 steps with 50000 reset in 1408 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 3052 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3052/3052 places, 2802/2802 transitions.
Performed 351 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3052 transition count 2802
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 101 Pre rules applied. Total rules applied 351 place count 3052 transition count 2803
Deduced a syphon composed of 452 places in 7 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 452 place count 3052 transition count 2803
Performed 1045 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1497 places in 3 ms
Iterating global reduction 1 with 1045 rules applied. Total rules applied 1497 place count 3052 transition count 2803
Renaming transitions due to excessive name length > 1024 char.
Discarding 351 places :
Symmetric choice reduction at 1 with 351 rule applications. Total rules 1848 place count 2701 transition count 2452
Deduced a syphon composed of 1146 places in 3 ms
Iterating global reduction 1 with 351 rules applied. Total rules applied 2199 place count 2701 transition count 2452
Deduced a syphon composed of 1146 places in 3 ms
Applied a total of 2199 rules in 873 ms. Remains 2701 /3052 variables (removed 351) and now considering 2452/2802 (removed 350) transitions.
[2021-05-16 09:46:56] [INFO ] Redundant transitions in 69 ms returned []
// Phase 1: matrix 2452 rows 2701 cols
[2021-05-16 09:46:56] [INFO ] Computed 551 place invariants in 26 ms
[2021-05-16 09:46:58] [INFO ] Dead Transitions using invariants and state equation in 1591 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2701/3052 places, 2452/2802 transitions.
Product exploration explored 100000 steps with 50000 reset in 8796 ms.
Product exploration explored 100000 steps with 50000 reset in 8742 ms.
[2021-05-16 09:47:15] [INFO ] Flatten gal took : 85 ms
[2021-05-16 09:47:15] [INFO ] Flatten gal took : 83 ms
[2021-05-16 09:47:15] [INFO ] Time to serialize gal into /tmp/LTL5169261449069694383.gal : 11 ms
[2021-05-16 09:47:15] [INFO ] Time to serialize properties into /tmp/LTL15315785949011424495.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/LTL5169261449069694383.gal, -t, CGAL, -LTL, /tmp/LTL15315785949011424495.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/LTL5169261449069694383.gal -t CGAL -LTL /tmp/LTL15315785949011424495.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p2296==0)||(p592==1))"))))
Formula 0 simplified : !XF"((p2296==0)||(p592==1))"
Detected timeout of ITS tools.
[2021-05-16 09:47:30] [INFO ] Flatten gal took : 74 ms
[2021-05-16 09:47:30] [INFO ] Applying decomposition
[2021-05-16 09:47:31] [INFO ] Flatten gal took : 74 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/graph10448745906370994480.txt, -o, /tmp/graph10448745906370994480.bin, -w, /tmp/graph10448745906370994480.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/graph10448745906370994480.bin, -l, -1, -v, -w, /tmp/graph10448745906370994480.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 09:47:31] [INFO ] Decomposing Gal with order
[2021-05-16 09:47:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 09:47:31] [INFO ] Removed a total of 450 redundant transitions.
[2021-05-16 09:47:31] [INFO ] Flatten gal took : 138 ms
[2021-05-16 09:47:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2021-05-16 09:47:31] [INFO ] Time to serialize gal into /tmp/LTL18402362935899631942.gal : 26 ms
[2021-05-16 09:47:31] [INFO ] Time to serialize properties into /tmp/LTL16467896370495983925.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/LTL18402362935899631942.gal, -t, CGAL, -LTL, /tmp/LTL16467896370495983925.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/LTL18402362935899631942.gal -t CGAL -LTL /tmp/LTL16467896370495983925.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((i34.u811.p2296==0)||(i9.i0.i0.u211.p592==1))"))))
Formula 0 simplified : !XF"((i34.u811.p2296==0)||(i9.i0.i0.u211.p592==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6565786562584272597
[2021-05-16 09:47:46] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6565786562584272597
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/ltsmin6565786562584272597]
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/ltsmin6565786562584272597] 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/ltsmin6565786562584272597] 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 ShieldPPPs-PT-050B-12 finished in 64558 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 3060 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3053 transition count 2803
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3053 transition count 2803
Applied a total of 14 rules in 292 ms. Remains 3053 /3060 variables (removed 7) and now considering 2803/2810 (removed 7) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2021-05-16 09:47:48] [INFO ] Computed 551 place invariants in 7 ms
[2021-05-16 09:47:49] [INFO ] Implicit Places using invariants in 1149 ms returned []
// Phase 1: matrix 2803 rows 3053 cols
[2021-05-16 09:47:49] [INFO ] Computed 551 place invariants in 7 ms
[2021-05-16 09:47:52] [INFO ] Implicit Places using invariants and state equation in 3317 ms returned []
Implicit Place search using SMT with State Equation took 4468 ms to find 0 implicit places.
// Phase 1: matrix 2803 rows 3053 cols
[2021-05-16 09:47:52] [INFO ] Computed 551 place invariants in 7 ms
[2021-05-16 09:47:54] [INFO ] Dead Transitions using invariants and state equation in 1883 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3053/3060 places, 2803/2810 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-050B-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s1700 0) (NEQ s2250 1) (NEQ s1429 1)), p0:(NEQ s1429 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 31 reset in 1052 ms.
Product exploration explored 100000 steps with 30 reset in 1203 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 31 reset in 964 ms.
Product exploration explored 100000 steps with 31 reset in 1206 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 3053 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Performed 351 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3053 transition count 2803
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 101 Pre rules applied. Total rules applied 351 place count 3053 transition count 2804
Deduced a syphon composed of 452 places in 6 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 452 place count 3053 transition count 2804
Performed 1048 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1500 places in 4 ms
Iterating global reduction 1 with 1048 rules applied. Total rules applied 1500 place count 3053 transition count 2804
Renaming transitions due to excessive name length > 1024 char.
Discarding 352 places :
Symmetric choice reduction at 1 with 352 rule applications. Total rules 1852 place count 2701 transition count 2452
Deduced a syphon composed of 1148 places in 3 ms
Iterating global reduction 1 with 352 rules applied. Total rules applied 2204 place count 2701 transition count 2452
Deduced a syphon composed of 1148 places in 3 ms
Applied a total of 2204 rules in 911 ms. Remains 2701 /3053 variables (removed 352) and now considering 2452/2803 (removed 351) transitions.
[2021-05-16 09:48:00] [INFO ] Redundant transitions in 69 ms returned []
// Phase 1: matrix 2452 rows 2701 cols
[2021-05-16 09:48:00] [INFO ] Computed 551 place invariants in 24 ms
[2021-05-16 09:48:01] [INFO ] Dead Transitions using invariants and state equation in 1675 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2701/3053 places, 2452/2803 transitions.
Product exploration explored 100000 steps with 84 reset in 1189 ms.
Product exploration explored 100000 steps with 83 reset in 1371 ms.
[2021-05-16 09:48:04] [INFO ] Flatten gal took : 74 ms
[2021-05-16 09:48:04] [INFO ] Flatten gal took : 74 ms
[2021-05-16 09:48:04] [INFO ] Time to serialize gal into /tmp/LTL3846932095447724316.gal : 34 ms
[2021-05-16 09:48:04] [INFO ] Time to serialize properties into /tmp/LTL10138564680699503262.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/LTL3846932095447724316.gal, -t, CGAL, -LTL, /tmp/LTL10138564680699503262.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/LTL3846932095447724316.gal -t CGAL -LTL /tmp/LTL10138564680699503262.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p1588!=1)")U((G("(p1588!=1)"))||("(((p1889!=0)&&(p2502!=1))&&(p1588!=1))"))))))
Formula 0 simplified : !XF("(p1588!=1)" U ("(((p1889!=0)&&(p2502!=1))&&(p1588!=1))" | G"(p1588!=1)"))
Detected timeout of ITS tools.
[2021-05-16 09:48:19] [INFO ] Flatten gal took : 68 ms
[2021-05-16 09:48:19] [INFO ] Applying decomposition
[2021-05-16 09:48:19] [INFO ] Flatten gal took : 69 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/graph10253230370224072801.txt, -o, /tmp/graph10253230370224072801.bin, -w, /tmp/graph10253230370224072801.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/graph10253230370224072801.bin, -l, -1, -v, -w, /tmp/graph10253230370224072801.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 09:48:20] [INFO ] Decomposing Gal with order
[2021-05-16 09:48:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 09:48:20] [INFO ] Removed a total of 450 redundant transitions.
[2021-05-16 09:48:20] [INFO ] Flatten gal took : 132 ms
[2021-05-16 09:48:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2021-05-16 09:48:20] [INFO ] Time to serialize gal into /tmp/LTL12132755452579101345.gal : 24 ms
[2021-05-16 09:48:20] [INFO ] Time to serialize properties into /tmp/LTL3570485944660406477.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/LTL12132755452579101345.gal, -t, CGAL, -LTL, /tmp/LTL3570485944660406477.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/LTL12132755452579101345.gal -t CGAL -LTL /tmp/LTL3570485944660406477.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i22.i1.i3.u563.p1588!=1)")U((G("(i22.i1.i3.u563.p1588!=1)"))||("(((i26.i2.i0.u672.p1889!=0)&&(i35.u886.p2502!=1))&&(i22.i1.i3.u563.p1588!=1))"))))))
Formula 0 simplified : !XF("(i22.i1.i3.u563.p1588!=1)" U ("(((i26.i2.i0.u672.p1889!=0)&&(i35.u886.p2502!=1))&&(i22.i1.i3.u563.p1588!=1))" | G"(i22.i1.i3.u563.p1588!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7891693943621130820
[2021-05-16 09:48:35] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7891693943621130820
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/ltsmin7891693943621130820]
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/ltsmin7891693943621130820] 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/ltsmin7891693943621130820] 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 ShieldPPPs-PT-050B-14 finished in 48878 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 3060 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3059 transition count 2458
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2708 transition count 2458
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 702 place count 2708 transition count 2208
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1202 place count 2458 transition count 2208
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1209 place count 2451 transition count 2201
Iterating global reduction 2 with 7 rules applied. Total rules applied 1216 place count 2451 transition count 2201
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1216 place count 2451 transition count 2198
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1222 place count 2448 transition count 2198
Performed 894 Post agglomeration using F-continuation condition.Transition count delta: 894
Deduced a syphon composed of 894 places in 2 ms
Reduce places removed 894 places and 0 transitions.
Iterating global reduction 2 with 1788 rules applied. Total rules applied 3010 place count 1554 transition count 1304
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3011 place count 1553 transition count 1303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3012 place count 1552 transition count 1302
Applied a total of 3012 rules in 576 ms. Remains 1552 /3060 variables (removed 1508) and now considering 1302/2810 (removed 1508) transitions.
// Phase 1: matrix 1302 rows 1552 cols
[2021-05-16 09:48:37] [INFO ] Computed 551 place invariants in 2 ms
[2021-05-16 09:48:38] [INFO ] Implicit Places using invariants in 784 ms returned []
// Phase 1: matrix 1302 rows 1552 cols
[2021-05-16 09:48:38] [INFO ] Computed 551 place invariants in 2 ms
[2021-05-16 09:48:39] [INFO ] Implicit Places using invariants and state equation in 1693 ms returned []
Implicit Place search using SMT with State Equation took 2479 ms to find 0 implicit places.
[2021-05-16 09:48:39] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1302 rows 1552 cols
[2021-05-16 09:48:39] [INFO ] Computed 551 place invariants in 4 ms
[2021-05-16 09:48:40] [INFO ] Dead Transitions using invariants and state equation in 876 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1552/3060 places, 1302/2810 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s383 0) (NEQ s177 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 39 reset in 1103 ms.
Stuttering criterion allowed to conclude after 54840 steps with 20 reset in 719 ms.
FORMULA ShieldPPPs-PT-050B-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-15 finished in 5840 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11408429008837710773
[2021-05-16 09:48:42] [INFO ] Too many transitions (2810) to apply POR reductions. Disabling POR matrices.
[2021-05-16 09:48:42] [INFO ] Applying decomposition
[2021-05-16 09:48:42] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11408429008837710773
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/ltsmin11408429008837710773]
[2021-05-16 09:48:42] [INFO ] Flatten gal took : 72 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/graph4683394500172695193.txt, -o, /tmp/graph4683394500172695193.bin, -w, /tmp/graph4683394500172695193.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/graph4683394500172695193.bin, -l, -1, -v, -w, /tmp/graph4683394500172695193.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 09:48:42] [INFO ] Decomposing Gal with order
[2021-05-16 09:48:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 09:48:43] [INFO ] Removed a total of 450 redundant transitions.
[2021-05-16 09:48:43] [INFO ] Flatten gal took : 224 ms
[2021-05-16 09:48:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2021-05-16 09:48:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality3658589272553470450.gal : 23 ms
[2021-05-16 09:48:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality10048187479574831863.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/LTLCardinality3658589272553470450.gal, -t, CGAL, -LTL, /tmp/LTLCardinality10048187479574831863.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/LTLCardinality3658589272553470450.gal -t CGAL -LTL /tmp/LTLCardinality10048187479574831863.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !(((X(X(G(("(i4.i0.i1.u73.p193==1)")U("(i19.i0.i1.u473.p1338==1)")))))U(G("((i25.i3.i1.u654.p1846==0)||(i37.i2.i0.u924.p2611==1))"))))
Formula 0 simplified : !(XXG("(i4.i0.i1.u73.p193==1)" U "(i19.i0.i1.u473.p1338==1)") U G"((i25.i3.i1.u654.p1846==0)||(i37.i2.i0.u924.p2611==1))")
Compilation finished in 32653 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11408429008837710773]
Link finished in 58 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(X([](((LTLAPp0==true) U (LTLAPp1==true))))) U []((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin11408429008837710773]
WARNING : LTSmin timed out (>360 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([](((LTLAPp0==true) U (LTLAPp1==true))))) U []((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin11408429008837710773]
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(<>((LTLAPp3==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin11408429008837710773]
LTSmin run took 1278 ms.
FORMULA ShieldPPPs-PT-050B-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(((LTLAPp4==true) U ((LTLAPp5==true)||[]((LTLAPp4==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11408429008837710773]
WARNING : LTSmin timed out (>360 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(<>(((LTLAPp4==true) U ((LTLAPp5==true)||[]((LTLAPp4==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11408429008837710773]
Retrying LTSmin with larger timeout 2880 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(X([](((LTLAPp0==true) U (LTLAPp1==true))))) U []((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin11408429008837710773]
LTSmin run took 447199 ms.
FORMULA ShieldPPPs-PT-050B-01 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(<>(((LTLAPp4==true) U ((LTLAPp5==true)||[]((LTLAPp4==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11408429008837710773]
Detected timeout of ITS tools.
[2021-05-16 10:10:20] [INFO ] Applying decomposition
[2021-05-16 10:10:20] [INFO ] Flatten gal took : 219 ms
[2021-05-16 10:10:20] [INFO ] Decomposing Gal with order
[2021-05-16 10:10:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 10:10:23] [INFO ] Removed a total of 300 redundant transitions.
[2021-05-16 10:10:23] [INFO ] Flatten gal took : 597 ms
[2021-05-16 10:10:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 237 ms.
[2021-05-16 10:10:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality13981071248861242519.gal : 124 ms
[2021-05-16 10:10:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality12353662757466484698.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality13981071248861242519.gal, -t, CGAL, -LTL, /tmp/LTLCardinality12353662757466484698.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/LTLCardinality13981071248861242519.gal -t CGAL -LTL /tmp/LTLCardinality12353662757466484698.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u533.p1588!=1)")U(("((!((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i1.u1181.p1889==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u824.p2502==1)))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u533.p1588!=1))")||(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u533.p1588!=1)")))))))
Formula 0 simplified : !XF("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u533.p1588!=1)" U ("((!((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i1.u1181.p1889==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u824.p2502==1)))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u533.p1588!=1))" | G"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u533.p1588!=1)"))
Detected timeout of ITS tools.
[2021-05-16 10:31:56] [INFO ] Flatten gal took : 282 ms
[2021-05-16 10:31:56] [INFO ] Input system was already deterministic with 2810 transitions.
[2021-05-16 10:31:56] [INFO ] Transformed 3060 places.
[2021-05-16 10:31:56] [INFO ] Transformed 2810 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 10:31:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality3996502404008020970.gal : 22 ms
[2021-05-16 10:31:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality8820440696618364176.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/LTLCardinality3996502404008020970.gal, -t, CGAL, -LTL, /tmp/LTLCardinality8820440696618364176.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/LTLCardinality3996502404008020970.gal -t CGAL -LTL /tmp/LTLCardinality8820440696618364176.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(("(p1588!=1)")U(("((!((p1889==0)||(p2502==1)))&&(p1588!=1))")||(G("(p1588!=1)")))))))
Formula 0 simplified : !XF("(p1588!=1)" U ("((!((p1889==0)||(p2502==1)))&&(p1588!=1))" | G"(p1588!=1)"))

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-050B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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