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.r197-smll-162089452200341.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SatelliteMemory-PT-X65535Y2048, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-162089452200341
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K 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 7.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 11:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 11:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 14:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 14:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 12 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rwxr-xr-x 1 mcc users 5.5K 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 SatelliteMemory-PT-X65535Y2048-00
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-01
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-02
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-03
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-04
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-05
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-06
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-07
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-08
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-09
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-10
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-11
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-12
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-13
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-14
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-15

=== Now, execution of the tool begins

BK_START 1621126290953

Running Version 0
[2021-05-16 00:51:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 00:51:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 00:51:34] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2021-05-16 00:51:34] [INFO ] Transformed 13 places.
[2021-05-16 00:51:34] [INFO ] Transformed 10 transitions.
[2021-05-16 00:51:34] [INFO ] Parsed PT model containing 13 places and 10 transitions in 126 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 00:51:34] [INFO ] Initial state test concluded for 4 properties.
Reduce places removed 1 places and 0 transitions.
FORMULA SatelliteMemory-PT-X65535Y2048-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X65535Y2048-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X65535Y2048-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 15 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:51:34] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-16 00:51:35] [INFO ] Dead Transitions using invariants and state equation in 176 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:51:35] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-16 00:51:35] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:51:35] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-16 00:51:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 00:51:35] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:51:35] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 00:51:35] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
[2021-05-16 00:51:35] [INFO ] Flatten gal took : 35 ms
[2021-05-16 00:51:35] [INFO ] Flatten gal took : 9 ms
[2021-05-16 00:51:35] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 574 ms. (steps per millisecond=174 ) properties (out of 17) seen :12
Running SMT prover for 5 properties.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:51:36] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-16 00:51:36] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-16 00:51:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 00:51:36] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-16 00:51:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 00:51:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-16 00:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 00:51:36] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-16 00:51:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 00:51:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-16 00:51:36] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-16 00:51:36] [INFO ] Added : 5 causal constraints over 1 iterations in 24 ms. Result :sat
[2021-05-16 00:51:36] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 00:51:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 00:51:36] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-16 00:51:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 00:51:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 00:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 00:51:36] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-16 00:51:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-16 00:51:36] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-16 00:51:36] [INFO ] Added : 3 causal constraints over 1 iterations in 28 ms. Result :sat
[2021-05-16 00:51:36] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 00:51:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 00:51:36] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-16 00:51:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 00:51:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 00:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 00:51:36] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2021-05-16 00:51:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-16 00:51:36] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-16 00:51:36] [INFO ] Added : 7 causal constraints over 2 iterations in 22 ms. Result :sat
[2021-05-16 00:51:36] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-16 00:51:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 00:51:36] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-16 00:51:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 00:51:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-16 00:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 00:51:36] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-16 00:51:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-16 00:51:36] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-16 00:51:36] [INFO ] Added : 4 causal constraints over 1 iterations in 14 ms. Result :sat
[2021-05-16 00:51:36] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 00:51:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 00:51:36] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-16 00:51:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 00:51:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-16 00:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 00:51:36] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-16 00:51:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-16 00:51:36] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints (skipped 0 transitions) in 19 ms.
[2021-05-16 00:51:36] [INFO ] Added : 5 causal constraints over 1 iterations in 29 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0) U (!p1||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:51:37] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 00:51:37] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:51:37] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:51:37] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:51:37] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 00:51:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 00:51:37] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:51:37] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:51:37] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 552 ms :[(NOT p0), false, false, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (OR (LT s3 1) (LT s9 1)) (OR (LT s4 1) (LT s6 1) (LT s8 1))), p1:(OR (LT s4 1) (LT s6 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33417 reset in 663 ms.
Product exploration explored 100000 steps with 33342 reset in 277 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), false, false, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33427 reset in 224 ms.
Product exploration explored 100000 steps with 33296 reset in 349 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), false, false, (AND (NOT p0) (NOT p1))]
Support contains 5 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Applied a total of 1 rules in 10 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2021-05-16 00:51:40] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-16 00:51:40] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
[2021-05-16 00:51:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-16 00:51:40] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 00:51:40] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/12 places, 9/10 transitions.
Product exploration explored 100000 steps with 33304 reset in 548 ms.
Product exploration explored 100000 steps with 33254 reset in 228 ms.
[2021-05-16 00:51:41] [INFO ] Flatten gal took : 4 ms
[2021-05-16 00:51:41] [INFO ] Flatten gal took : 3 ms
[2021-05-16 00:51:41] [INFO ] Time to serialize gal into /tmp/LTL8482351006969781633.gal : 2 ms
[2021-05-16 00:51:41] [INFO ] Time to serialize properties into /tmp/LTL5119464222091619646.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/LTL8482351006969781633.gal, -t, CGAL, -LTL, /tmp/LTL5119464222091619646.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/LTL8482351006969781633.gal -t CGAL -LTL /tmp/LTL5119464222091619646.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(((p12<1)||(p7<1))&&(((p2<1)||(p4<1))||(p6<1)))"))U((G("(((p2<1)||(p4<1))||(p6<1))"))||("(((p2>=1)&&(p4>=1))&&(p6>=1))")))))
Formula 0 simplified : !X(F"(((p12<1)||(p7<1))&&(((p2<1)||(p4<1))||(p6<1)))" U ("(((p2>=1)&&(p4>=1))&&(p6>=1))" | G"(((p2<1)||(p4<1))||(p6<1))"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-16 00:51:41] [INFO ] Flatten gal took : 4 ms
[2021-05-16 00:51:41] [INFO ] Applying decomposition
[2021-05-16 00:51:41] [INFO ] Flatten gal took : 4 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/graph8645624466268889518.txt, -o, /tmp/graph8645624466268889518.bin, -w, /tmp/graph8645624466268889518.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/graph8645624466268889518.bin, -l, -1, -v, -w, /tmp/graph8645624466268889518.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 00:51:41] [INFO ] Decomposing Gal with order
[2021-05-16 00:51:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 00:51:41] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-16 00:51:41] [INFO ] Flatten gal took : 73 ms
[2021-05-16 00:51:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2021-05-16 00:51:41] [INFO ] Time to serialize gal into /tmp/LTL14468107904235330083.gal : 2 ms
[2021-05-16 00:51:41] [INFO ] Time to serialize properties into /tmp/LTL14877022267420554760.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/LTL14468107904235330083.gal, -t, CGAL, -LTL, /tmp/LTL14877022267420554760.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/LTL14468107904235330083.gal -t CGAL -LTL /tmp/LTL14877022267420554760.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("(((i0.u3.p12<1)||(i1.u5.p7<1))&&(((i0.u0.p2<1)||(i0.u4.p4<1))||(i0.u3.p6<1)))"))U((G("(((i0.u0.p2<1)||(i0.u4.p4<1))||(i0.u3.p6<1))"))||("(((i0.u0.p2>=1)&&(i0.u4.p4>=1))&&(i0.u3.p6>=1))")))))
Formula 0 simplified : !X(F"(((i0.u3.p12<1)||(i1.u5.p7<1))&&(((i0.u0.p2<1)||(i0.u4.p4<1))||(i0.u3.p6<1)))" U ("(((i0.u0.p2>=1)&&(i0.u4.p4>=1))&&(i0.u3.p6>=1))" | G"(((i0.u0.p2<1)||(i0.u4.p4<1))||(i0.u3.p6<1))"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin5586870791979343694
[2021-05-16 00:51:41] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5586870791979343694
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/ltsmin5586870791979343694]
Compilation finished in 386 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5586870791979343694]
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((<>((LTLAPp0==true)) U ([]((LTLAPp1==true))||!(LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin5586870791979343694]
LTSmin run took 1478 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SatelliteMemory-PT-X65535Y2048-00 finished in 6384 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((!p0&&G((G(p0)||p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:51:43] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:51:43] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:51:43] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:51:43] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:51:43] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 00:51:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 00:51:43] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:51:43] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:51:43] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s3 61439) (GEQ s6 4096)), p1:(OR (AND (GEQ s3 61439) (GEQ s6 4096)) (LT s5 65535))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 156 ms.
Product exploration explored 100000 steps with 0 reset in 241 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (NOT p0), true]
Product exploration explored 100000 steps with 0 reset in 229 ms.
Product exploration explored 100000 steps with 0 reset in 336 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (NOT p0), true]
Support contains 3 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Applied a total of 1 rules in 5 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2021-05-16 00:51:45] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-16 00:51:45] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
[2021-05-16 00:51:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-16 00:51:45] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-16 00:51:45] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/12 places, 9/10 transitions.
Product exploration explored 100000 steps with 0 reset in 334 ms.
Product exploration explored 100000 steps with 0 reset in 684 ms.
[2021-05-16 00:51:46] [INFO ] Flatten gal took : 3 ms
[2021-05-16 00:51:46] [INFO ] Flatten gal took : 3 ms
[2021-05-16 00:51:46] [INFO ] Time to serialize gal into /tmp/LTL7103443168569299679.gal : 1 ms
[2021-05-16 00:51:46] [INFO ] Time to serialize properties into /tmp/LTL17451024609005169625.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/LTL7103443168569299679.gal, -t, CGAL, -LTL, /tmp/LTL17451024609005169625.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/LTL7103443168569299679.gal -t CGAL -LTL /tmp/LTL17451024609005169625.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G(("(((p12>=61439)&&(p4>=4096))||(p3<65535))")||(G("((p12>=61439)&&(p4>=4096))"))))&&("((p12<61439)||(p4<4096))"))))
Formula 0 simplified : !X("((p12<61439)||(p4<4096))" & G("(((p12>=61439)&&(p4>=4096))||(p3<65535))" | G"((p12>=61439)&&(p4>=4096))"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-16 00:51:46] [INFO ] Flatten gal took : 2 ms
[2021-05-16 00:51:46] [INFO ] Applying decomposition
[2021-05-16 00:51:46] [INFO ] Flatten gal took : 1 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/graph14618493367220546366.txt, -o, /tmp/graph14618493367220546366.bin, -w, /tmp/graph14618493367220546366.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/graph14618493367220546366.bin, -l, -1, -v, -w, /tmp/graph14618493367220546366.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 00:51:46] [INFO ] Decomposing Gal with order
[2021-05-16 00:51:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 00:51:46] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-16 00:51:46] [INFO ] Flatten gal took : 6 ms
[2021-05-16 00:51:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2021-05-16 00:51:46] [INFO ] Time to serialize gal into /tmp/LTL15715370644095189061.gal : 1 ms
[2021-05-16 00:51:46] [INFO ] Time to serialize properties into /tmp/LTL6391809324008521551.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/LTL15715370644095189061.gal, -t, CGAL, -LTL, /tmp/LTL6391809324008521551.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/LTL15715370644095189061.gal -t CGAL -LTL /tmp/LTL6391809324008521551.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G(("(((i2.u4.p12>=61439)&&(i2.u3.p4>=4096))||(i2.u3.p3<65535))")||(G("((i2.u4.p12>=61439)&&(i2.u3.p4>=4096))"))))&&("((i2.u4.p12<61439)||(i2.u3.p4<4096))"))))
Formula 0 simplified : !X("((i2.u4.p12<61439)||(i2.u3.p4<4096))" & G("(((i2.u4.p12>=61439)&&(i2.u3.p4>=4096))||(i2.u3.p3<65535))" | G"((i2.u4.p12>=61439)&&(i2.u3.p4>=4096))"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin17525165946189384951
[2021-05-16 00:51:46] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17525165946189384951
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/ltsmin17525165946189384951]
Compilation finished in 153 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17525165946189384951]
Link finished in 38 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(([](([]((LTLAPp1==true))||(LTLAPp0==true)))&&!(LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin17525165946189384951]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SatelliteMemory-PT-X65535Y2048-01 finished in 18265 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Applied a total of 1 rules in 6 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2021-05-16 00:52:01] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 00:52:01] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-16 00:52:01] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-16 00:52:01] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-16 00:52:01] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-16 00:52:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 00:52:01] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2021-05-16 00:52:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-16 00:52:01] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-16 00:52:01] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s7 1)), p0:(AND (GEQ s0 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-02 finished in 192 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X((G(p1)&&p0))||(X(p3)&&p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:01] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:52:01] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:01] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 00:52:01] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:01] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:52:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 00:52:01] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:01] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 00:52:02] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-03 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p2 (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) (NOT p1))), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p3) p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p3) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s7 1) (GEQ s10 1)), p3:(GEQ s2 1), p0:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s7 1) (GEQ s10 1)), p1:(OR (LT s1 1) (LT s3 1) (LT s7 1) (LT s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7064 reset in 389 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-03 finished in 763 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((p0 U !p1)||X(!p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:02] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:52:02] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:02] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 00:52:02] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:02] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 00:52:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 00:52:02] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:02] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:52:02] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 50 ms :[p1]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-04 automaton TGBA [mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s3 1) (LT s7 1) (LT s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null][false]]
Product exploration explored 100000 steps with 16467 reset in 138 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-04 finished in 322 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0&&G(p1)))||X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:03] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 00:52:03] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:03] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 00:52:03] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:03] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 00:52:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 00:52:03] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:03] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 00:52:03] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s4 1) (LT s6 1) (LT s8 1)), p0:(GEQ s5 65535)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 178 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 1 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-06 finished in 483 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||F((X(!p2)||p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:03] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:52:03] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:03] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:52:03] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:03] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:52:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 00:52:03] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:03] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:52:03] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s11 65535), p1:(OR (LT s0 1) (LT s8 1)), p2:(AND (GEQ s0 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 13654 reset in 161 ms.
Stack based approach found an accepted trace after 37 steps with 5 reset with depth 5 and stack size 5 in 1 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-07 finished in 428 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||(p0 U G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:03] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:52:03] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:03] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 00:52:03] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:03] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:52:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 00:52:03] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2021-05-16 00:52:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:03] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 00:52:04] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-08 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(GEQ s2 1), p0:(AND (GEQ s3 61439) (GEQ s5 61439))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 201 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-08 finished in 397 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:04] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:52:04] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:04] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:52:04] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:04] [INFO ] Computed 6 place invariants in 4 ms
[2021-05-16 00:52:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 00:52:04] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:04] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:52:04] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s3 1) (LT s7 1) (LT s10 1)), p1:(LT s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 113 ms.
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 3 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:05] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:52:05] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
[2021-05-16 00:52:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:05] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 00:52:05] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Product exploration explored 100000 steps with 50000 reset in 315 ms.
Product exploration explored 100000 steps with 50000 reset in 231 ms.
[2021-05-16 00:52:06] [INFO ] Flatten gal took : 2 ms
[2021-05-16 00:52:06] [INFO ] Flatten gal took : 1 ms
[2021-05-16 00:52:06] [INFO ] Time to serialize gal into /tmp/LTL10199586618216973982.gal : 1 ms
[2021-05-16 00:52:06] [INFO ] Time to serialize properties into /tmp/LTL313805312644490979.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/LTL10199586618216973982.gal, -t, CGAL, -LTL, /tmp/LTL313805312644490979.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/LTL10199586618216973982.gal -t CGAL -LTL /tmp/LTL313805312644490979.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("((((p10<1)||(p12<1))||(p5<1))||(p8<1))"))||(X(G("(p5<1)"))))))
Formula 0 simplified : !X(F"((((p10<1)||(p12<1))||(p5<1))||(p8<1))" | XG"(p5<1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-16 00:52:06] [INFO ] Flatten gal took : 2 ms
[2021-05-16 00:52:06] [INFO ] Applying decomposition
[2021-05-16 00:52:06] [INFO ] Flatten gal took : 2 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/graph8392121984500088826.txt, -o, /tmp/graph8392121984500088826.bin, -w, /tmp/graph8392121984500088826.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/graph8392121984500088826.bin, -l, -1, -v, -w, /tmp/graph8392121984500088826.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 00:52:06] [INFO ] Decomposing Gal with order
[2021-05-16 00:52:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 00:52:06] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-16 00:52:06] [INFO ] Flatten gal took : 3 ms
[2021-05-16 00:52:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 0 ms.
[2021-05-16 00:52:06] [INFO ] Time to serialize gal into /tmp/LTL1130206547335130722.gal : 1 ms
[2021-05-16 00:52:06] [INFO ] Time to serialize properties into /tmp/LTL16536195794823213821.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/LTL1130206547335130722.gal, -t, CGAL, -LTL, /tmp/LTL16536195794823213821.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/LTL1130206547335130722.gal -t CGAL -LTL /tmp/LTL16536195794823213821.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("((((i2.u5.p10<1)||(i0.u3.p12<1))||(u1.p5<1))||(i2.u4.p8<1))"))||(X(G("(u1.p5<1)"))))))
Formula 0 simplified : !X(F"((((i2.u5.p10<1)||(i0.u3.p12<1))||(u1.p5<1))||(i2.u4.p8<1))" | XG"(u1.p5<1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin8116625768270066226
[2021-05-16 00:52:06] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8116625768270066226
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/ltsmin8116625768270066226]
Compilation finished in 164 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8116625768270066226]
Link finished in 34 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true))||X([]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin8116625768270066226]
LTSmin run took 373 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SatelliteMemory-PT-X65535Y2048-09 finished in 2563 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&G(((!p0 U p2)||p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:06] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:52:06] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:06] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 00:52:06] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:06] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 00:52:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 00:52:06] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:06] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 00:52:06] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(OR (NOT p0) p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LT s7 1), p1:(OR (AND (GEQ s3 61439) (GEQ s6 4096)) (GEQ s7 1)), p2:(AND (GEQ s3 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 144 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-10 finished in 390 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U X(((G(p1)||X(p2)) U !p3))))], workingDir=/home/mcc/execution]
Support contains 9 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:07] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:52:07] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:07] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 00:52:07] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:07] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:52:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 00:52:07] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:07] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:52:07] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 321 ms :[p3, p3, (AND (NOT p0) (NOT p2) p3 (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p3, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p3 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s2 1), p3:(OR (LT s4 1) (LT s6 1) (LT s8 1)), p1:(OR (AND (GEQ s4 1) (GEQ s6 1) (GEQ s8 1)) (AND (GEQ s1 1) (GEQ s3 1) (GEQ s7 1) (GEQ s10 1))), p2:(AND (GEQ s3 61439) (GEQ s5 61439))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 34939 reset in 138 ms.
Stack based approach found an accepted trace after 10 steps with 3 reset with depth 3 and stack size 3 in 0 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-11 finished in 559 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:07] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 00:52:07] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:07] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:52:07] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:07] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 00:52:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 00:52:07] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-16 00:52:07] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 00:52:07] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s9 1) (GEQ s3 61439) (GEQ s6 4096)), p0:(AND (GEQ s3 61439) (GEQ s6 4096))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 SatelliteMemory-PT-X65535Y2048-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-12 finished in 239 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((!p0&&G(!p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Applied a total of 1 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2021-05-16 00:52:08] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-16 00:52:08] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-16 00:52:08] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 00:52:08] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-16 00:52:08] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-16 00:52:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 00:52:08] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2021-05-16 00:52:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-16 00:52:08] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-16 00:52:08] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 67 ms :[(OR p1 p0), p1]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-13 automaton TGBA [mat=[[{ cond=(OR p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4 65535), p1:(GEQ s9 65535)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12413 steps with 0 reset in 51 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-13 finished in 237 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2191932979689150707
[2021-05-16 00:52:08] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2021-05-16 00:52:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 00:52:08] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2021-05-16 00:52:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 00:52:08] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2021-05-16 00:52:08] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 00:52:08] [INFO ] Applying decomposition
[2021-05-16 00:52:08] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2191932979689150707
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/ltsmin2191932979689150707]
[2021-05-16 00:52:08] [INFO ] Flatten gal took : 3 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/graph5571565484343259242.txt, -o, /tmp/graph5571565484343259242.bin, -w, /tmp/graph5571565484343259242.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/graph5571565484343259242.bin, -l, -1, -v, -w, /tmp/graph5571565484343259242.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 00:52:08] [INFO ] Decomposing Gal with order
[2021-05-16 00:52:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 00:52:08] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-16 00:52:08] [INFO ] Flatten gal took : 3 ms
[2021-05-16 00:52:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2021-05-16 00:52:08] [INFO ] Time to serialize gal into /tmp/LTLFireability4776811298463495026.gal : 1 ms
[2021-05-16 00:52:08] [INFO ] Time to serialize properties into /tmp/LTLFireability17704954158340527695.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/LTLFireability4776811298463495026.gal, -t, CGAL, -LTL, /tmp/LTLFireability17704954158340527695.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/LTLFireability4776811298463495026.gal -t CGAL -LTL /tmp/LTLFireability17704954158340527695.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("((i1.u3.p12<61439)||(i1.u2.p4<4096))")&&(G(("(((i1.u3.p12>=61439)&&(i1.u2.p4>=4096))||(i1.u2.p3<65535))")||(G(!("((i1.u3.p12<61439)||(i1.u2.p4<4096))"))))))))
Formula 0 simplified : !X("((i1.u3.p12<61439)||(i1.u2.p4<4096))" & G("(((i1.u3.p12>=61439)&&(i1.u2.p4>=4096))||(i1.u2.p3<65535))" | G!"((i1.u3.p12<61439)||(i1.u2.p4<4096))"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-16 00:52:08] [INFO ] Flatten gal took : 2 ms
[2021-05-16 00:52:08] [INFO ] Time to serialize gal into /tmp/LTLFireability2264926160785012967.gal : 1 ms
[2021-05-16 00:52:08] [INFO ] Time to serialize properties into /tmp/LTLFireability638290989360855562.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/LTLFireability2264926160785012967.gal, -t, CGAL, -LTL, /tmp/LTLFireability638290989360855562.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/LTLFireability2264926160785012967.gal -t CGAL -LTL /tmp/LTLFireability638290989360855562.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((p12<61439)||(p4<4096))")&&(G(("(((p12>=61439)&&(p4>=4096))||(p3<65535))")||(G(!("((p12<61439)||(p4<4096))"))))))))
Formula 0 simplified : !X("((p12<61439)||(p4<4096))" & G("(((p12>=61439)&&(p4>=4096))||(p3<65535))" | G!"((p12<61439)||(p4<4096))"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-16 00:52:08] [INFO ] Flatten gal took : 3 ms
[2021-05-16 00:52:08] [INFO ] Input system was already deterministic with 10 transitions.
[2021-05-16 00:52:08] [INFO ] Transformed 12 places.
[2021-05-16 00:52:08] [INFO ] Transformed 10 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 00:52:08] [INFO ] Time to serialize gal into /tmp/LTLFireability2292120187996340838.gal : 0 ms
[2021-05-16 00:52:08] [INFO ] Time to serialize properties into /tmp/LTLFireability17862481763316000337.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/LTLFireability2292120187996340838.gal, -t, CGAL, -LTL, /tmp/LTLFireability17862481763316000337.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/LTLFireability2292120187996340838.gal -t CGAL -LTL /tmp/LTLFireability17862481763316000337.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(("((p12<61439)||(p4<4096))")&&(G(("(((p12>=61439)&&(p4>=4096))||(p3<65535))")||(G(!("((p12<61439)||(p4<4096))"))))))))
Formula 0 simplified : !X("((p12<61439)||(p4<4096))" & G("(((p12>=61439)&&(p4>=4096))||(p3<65535))" | G!"((p12<61439)||(p4<4096))"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Compilation finished in 305 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2191932979689150707]
Link finished in 35 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((!(LTLAPp0==true)&&[](([]((LTLAPp0==true))||(LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2191932979689150707]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.369: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.369: LTL layer: formula: X((!(LTLAPp0==true)&&[](([]((LTLAPp0==true))||(LTLAPp1==true)))))
pins2lts-mc-linux64( 0/ 8), 0.369: "X((!(LTLAPp0==true)&&[](([]((LTLAPp0==true))||(LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.369: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.369: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.370: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.382: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.381: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.382: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.383: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.382: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.397: buchi has 5 states
pins2lts-mc-linux64( 0/ 8), 0.424: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.648: DFS-FIFO for weak LTL, using special progress label 13
pins2lts-mc-linux64( 0/ 8), 0.648: There are 14 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.648: State length is 13, there are 20 groups
pins2lts-mc-linux64( 0/ 8), 0.648: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.648: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.648: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.648: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 2.810: ~1 levels ~960 states ~2632 transitions
pins2lts-mc-linux64( 0/ 8), 3.027: ~1 levels ~1920 states ~5120 transitions
pins2lts-mc-linux64( 0/ 8), 3.223: ~1 levels ~3840 states ~10400 transitions
pins2lts-mc-linux64( 5/ 8), 3.376: ~1 levels ~7680 states ~21040 transitions
pins2lts-mc-linux64( 5/ 8), 3.420: ~1 levels ~15360 states ~42096 transitions
pins2lts-mc-linux64( 5/ 8), 3.726: ~1 levels ~30720 states ~84328 transitions
pins2lts-mc-linux64( 5/ 8), 3.813: ~1 levels ~61440 states ~168528 transitions
pins2lts-mc-linux64( 5/ 8), 4.046: ~1 levels ~122880 states ~337384 transitions
pins2lts-mc-linux64( 7/ 8), 4.286: ~1 levels ~245760 states ~675360 transitions
pins2lts-mc-linux64( 7/ 8), 4.874: ~1 levels ~491520 states ~1351488 transitions
pins2lts-mc-linux64( 7/ 8), 5.402: ~1 levels ~983040 states ~2702784 transitions
pins2lts-mc-linux64( 7/ 8), 6.008: ~1 levels ~1966080 states ~5403160 transitions
pins2lts-mc-linux64( 7/ 8), 7.278: ~1 levels ~3932160 states ~10805824 transitions
pins2lts-mc-linux64( 7/ 8), 9.990: ~1 levels ~7864320 states ~21612944 transitions
pins2lts-mc-linux64( 5/ 8), 16.671: ~1 levels ~15728640 states ~43252328 transitions
pins2lts-mc-linux64( 6/ 8), 22.123: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 22.178:
pins2lts-mc-linux64( 0/ 8), 22.178: mean standard work distribution: 1.1% (states) 1.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 22.178:
pins2lts-mc-linux64( 0/ 8), 22.178: Explored 16749397 states 46056466 transitions, fanout: 2.750
pins2lts-mc-linux64( 0/ 8), 22.178: Total exploration time 21.500 sec (21.460 sec minimum, 21.480 sec on average)
pins2lts-mc-linux64( 0/ 8), 22.178: States per second: 779042, Transitions per second: 2142161
pins2lts-mc-linux64( 0/ 8), 22.178:
pins2lts-mc-linux64( 0/ 8), 22.178: Progress states detected: 16755610
pins2lts-mc-linux64( 0/ 8), 22.178: Redundant explorations: -0.0374
pins2lts-mc-linux64( 0/ 8), 22.178:
pins2lts-mc-linux64( 0/ 8), 22.178: Queue width: 8B, total height: 13597, memory: 0.10MB
pins2lts-mc-linux64( 0/ 8), 22.178: Tree memory: 383.8MB, 24.0 B/state, compr.: 44.5%
pins2lts-mc-linux64( 0/ 8), 22.178: Tree fill ratio (roots/leafs): 12.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 22.178: Stored 10 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 22.178: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 22.178: Est. total memory use: 383.9MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((!(LTLAPp0==true)&&[](([]((LTLAPp0==true))||(LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2191932979689150707]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((!(LTLAPp0==true)&&[](([]((LTLAPp0==true))||(LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2191932979689150707]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)

BK_STOP 1621126351972

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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