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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 10:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 18:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 18:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 16K May 5 16:51 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 FMS-PT-50000-00
FORMULA_NAME FMS-PT-50000-01
FORMULA_NAME FMS-PT-50000-02
FORMULA_NAME FMS-PT-50000-03
FORMULA_NAME FMS-PT-50000-04
FORMULA_NAME FMS-PT-50000-05
FORMULA_NAME FMS-PT-50000-06
FORMULA_NAME FMS-PT-50000-07
FORMULA_NAME FMS-PT-50000-08
FORMULA_NAME FMS-PT-50000-09
FORMULA_NAME FMS-PT-50000-10
FORMULA_NAME FMS-PT-50000-11
FORMULA_NAME FMS-PT-50000-12
FORMULA_NAME FMS-PT-50000-13
FORMULA_NAME FMS-PT-50000-14
FORMULA_NAME FMS-PT-50000-15

=== Now, execution of the tool begins

BK_START 1620674032135

Running Version 0
[2021-05-10 19:13:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-10 19:13:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 19:13:53] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-10 19:13:53] [INFO ] Transformed 22 places.
[2021-05-10 19:13:53] [INFO ] Transformed 20 transitions.
[2021-05-10 19:13:53] [INFO ] Parsed PT model containing 22 places and 20 transitions in 61 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Support contains 19 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 9 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:13:53] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-10 19:13:53] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:13:53] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-10 19:13:54] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:13:54] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:13:54] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
[2021-05-10 19:13:54] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-10 19:13:54] [INFO ] Flatten gal took : 18 ms
FORMULA FMS-PT-50000-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 19:13:54] [INFO ] Flatten gal took : 4 ms
[2021-05-10 19:13:54] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 100003 steps, including 1 resets, run finished after 53 ms. (steps per millisecond=1886 ) properties (out of 29) seen :4
Running SMT prover for 25 properties.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:13:54] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 19:13:54] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:25
[2021-05-10 19:13:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 19:13:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 19:13:54] [INFO ] [Nat]Absence check using state equation in 47 ms returned unsat :1 sat :24
Attempting to minimize the solution found.
Minimization took 33 ms.
[2021-05-10 19:13:54] [INFO ] SMT Verify possible in nat domain returned unsat :1 sat :24
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)||X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:13:54] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-10 19:13:54] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:13:54] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 19:13:54] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:13:54] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-10 19:13:54] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FMS-PT-50000-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s14 s8), p1:(LEQ s1 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 256 ms.
Product exploration explored 100000 steps with 0 reset in 336 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 133 ms.
Product exploration explored 100000 steps with 0 reset in 285 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 20
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 22 transition count 20
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 22 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 21 transition count 19
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 21 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 21 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 21 transition count 21
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 12 rules in 11 ms. Remains 21 /22 variables (removed 1) and now considering 21/20 (removed -1) transitions.
[2021-05-10 19:13:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-10 19:13:56] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 19:13:56] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/22 places, 21/20 transitions.
Product exploration explored 100000 steps with 0 reset in 153 ms.
Product exploration explored 100000 steps with 0 reset in 233 ms.
[2021-05-10 19:13:56] [INFO ] Flatten gal took : 2 ms
[2021-05-10 19:13:56] [INFO ] Flatten gal took : 2 ms
[2021-05-10 19:13:56] [INFO ] Time to serialize gal into /tmp/LTL8037677687690991294.gal : 0 ms
[2021-05-10 19:13:56] [INFO ] Time to serialize properties into /tmp/LTL10379531984045015794.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/LTL8037677687690991294.gal, -t, CGAL, -LTL, /tmp/LTL10379531984045015794.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/LTL8037677687690991294.gal -t CGAL -LTL /tmp/LTL10379531984045015794.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("(P12s<=P2wM2)"))||(X(G("(P1s<=P12s)"))))))
Formula 0 simplified : !G(F"(P12s<=P2wM2)" | XG"(P1s<=P12s)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-10 19:13:56] [INFO ] Flatten gal took : 2 ms
[2021-05-10 19:13:56] [INFO ] Applying decomposition
[2021-05-10 19:13:56] [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/graph5998371061758209125.txt, -o, /tmp/graph5998371061758209125.bin, -w, /tmp/graph5998371061758209125.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/graph5998371061758209125.bin, -l, -1, -v, -w, /tmp/graph5998371061758209125.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 19:13:56] [INFO ] Decomposing Gal with order
[2021-05-10 19:13:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 19:13:56] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-10 19:13:56] [INFO ] Flatten gal took : 26 ms
[2021-05-10 19:13:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-10 19:13:56] [INFO ] Time to serialize gal into /tmp/LTL14289054768647334705.gal : 1 ms
[2021-05-10 19:13:56] [INFO ] Time to serialize properties into /tmp/LTL11082854625550886967.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/LTL14289054768647334705.gal, -t, CGAL, -LTL, /tmp/LTL11082854625550886967.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/LTL14289054768647334705.gal -t CGAL -LTL /tmp/LTL11082854625550886967.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("(gu6.P12s<=gu6.P2wM2)"))||(X(G("(gu6.P1s<=gu6.P12s)"))))))
Formula 0 simplified : !G(F"(gu6.P12s<=gu6.P2wM2)" | XG"(gu6.P1s<=gu6.P12s)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin14993385321937995581
[2021-05-10 19:13:56] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14993385321937995581
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/ltsmin14993385321937995581]
Compilation finished in 207 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14993385321937995581]
Link finished in 40 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, []((<>((LTLAPp0==true))||X([]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14993385321937995581]
LTSmin run took 689 ms.
FORMULA FMS-PT-50000-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FMS-PT-50000-00 finished in 3240 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:13:57] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 19:13:57] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:13:57] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:13:57] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:13:57] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 19:13:57] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-50000-01 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ 2 s17), p1:(LEQ s6 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 148 ms.
Product exploration explored 100000 steps with 0 reset in 210 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 149 ms.
Product exploration explored 100000 steps with 0 reset in 291 ms.
[2021-05-10 19:13:58] [INFO ] Flatten gal took : 1 ms
[2021-05-10 19:13:58] [INFO ] Flatten gal took : 1 ms
[2021-05-10 19:13:58] [INFO ] Time to serialize gal into /tmp/LTL8384759124182270136.gal : 0 ms
[2021-05-10 19:13:58] [INFO ] Time to serialize properties into /tmp/LTL18337508313786377896.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/LTL8384759124182270136.gal, -t, CGAL, -LTL, /tmp/LTL18337508313786377896.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/LTL8384759124182270136.gal -t CGAL -LTL /tmp/LTL18337508313786377896.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("(P3M2>=2)")||(X("(P1M1<=M3)"))))))
Formula 0 simplified : !FG("(P3M2>=2)" | X"(P1M1<=M3)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-10 19:13:58] [INFO ] Flatten gal took : 2 ms
[2021-05-10 19:13:58] [INFO ] Applying decomposition
[2021-05-10 19:13:58] [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/graph5627270368767447796.txt, -o, /tmp/graph5627270368767447796.bin, -w, /tmp/graph5627270368767447796.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/graph5627270368767447796.bin, -l, -1, -v, -w, /tmp/graph5627270368767447796.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 19:13:58] [INFO ] Decomposing Gal with order
[2021-05-10 19:13:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 19:13:58] [INFO ] Flatten gal took : 2 ms
[2021-05-10 19:13:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-10 19:13:58] [INFO ] Time to serialize gal into /tmp/LTL76890272872960177.gal : 1 ms
[2021-05-10 19:13:58] [INFO ] Time to serialize properties into /tmp/LTL5018101797552301213.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/LTL76890272872960177.gal, -t, CGAL, -LTL, /tmp/LTL5018101797552301213.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/LTL76890272872960177.gal -t CGAL -LTL /tmp/LTL5018101797552301213.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("(gi0.gi1.gu6.P3M2>=2)")||(X("(gu5.P1M1<=gu5.M3)"))))))
Formula 0 simplified : !FG("(gi0.gi1.gu6.P3M2>=2)" | X"(gu5.P1M1<=gu5.M3)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin2764845907741143168
[2021-05-10 19:13:58] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2764845907741143168
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/ltsmin2764845907741143168]
Compilation finished in 129 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2764845907741143168]
Link finished in 36 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, <>([](((LTLAPp0==true)||X((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2764845907741143168]
LTSmin run took 2055 ms.
FORMULA FMS-PT-50000-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FMS-PT-50000-01 finished in 3391 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(p1)||G(!p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:01] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 19:14:01] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:01] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:14:01] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:01] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 19:14:01] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), false, false, (AND (NOT p1) p0)]
Running random walk in product with property : FMS-PT-50000-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(GT s1 s11), p0:(LEQ s4 s6)], 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 2306 reset in 162 ms.
Product exploration explored 100000 steps with 2318 reset in 195 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), false, false, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 2282 reset in 137 ms.
Product exploration explored 100000 steps with 2225 reset in 159 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), false, false, (AND (NOT p1) p0)]
Support contains 4 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 22 transition count 20
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 22 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 21 transition count 19
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 21 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 21 transition count 20
Deduced a syphon composed of 7 places in 1 ms
Applied a total of 10 rules in 4 ms. Remains 21 /22 variables (removed 1) and now considering 20/20 (removed 0) transitions.
[2021-05-10 19:14:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 21 cols
[2021-05-10 19:14:02] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 19:14:02] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/22 places, 20/20 transitions.
Product exploration explored 100000 steps with 3512 reset in 289 ms.
Product exploration explored 100000 steps with 3460 reset in 187 ms.
[2021-05-10 19:14:02] [INFO ] Flatten gal took : 2 ms
[2021-05-10 19:14:02] [INFO ] Flatten gal took : 2 ms
[2021-05-10 19:14:02] [INFO ] Time to serialize gal into /tmp/LTL12613456355204077942.gal : 1 ms
[2021-05-10 19:14:02] [INFO ] Time to serialize properties into /tmp/LTL8363375852293073216.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/LTL12613456355204077942.gal, -t, CGAL, -LTL, /tmp/LTL8363375852293073216.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/LTL12613456355204077942.gal -t CGAL -LTL /tmp/LTL8363375852293073216.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("(P1<=P1M1)")||(F("(P1s>P2M2)")))||(G("(P1>P1M1)")))))
Formula 0 simplified : !X("(P1<=P1M1)" | F"(P1s>P2M2)" | G"(P1>P1M1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-10 19:14:02] [INFO ] Flatten gal took : 2 ms
[2021-05-10 19:14:02] [INFO ] Applying decomposition
[2021-05-10 19:14:02] [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/graph15796247690316295682.txt, -o, /tmp/graph15796247690316295682.bin, -w, /tmp/graph15796247690316295682.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/graph15796247690316295682.bin, -l, -1, -v, -w, /tmp/graph15796247690316295682.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 19:14:02] [INFO ] Decomposing Gal with order
[2021-05-10 19:14:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 19:14:02] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-10 19:14:02] [INFO ] Flatten gal took : 3 ms
[2021-05-10 19:14:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-10 19:14:02] [INFO ] Time to serialize gal into /tmp/LTL1727400310747091135.gal : 1 ms
[2021-05-10 19:14:02] [INFO ] Time to serialize properties into /tmp/LTL13186106638869694894.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/LTL1727400310747091135.gal, -t, CGAL, -LTL, /tmp/LTL13186106638869694894.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/LTL1727400310747091135.gal -t CGAL -LTL /tmp/LTL13186106638869694894.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("(gu3.P1<=gu3.P1M1)")||(F("(gu0.P1s>gu0.P2M2)")))||(G("(gu3.P1>gu3.P1M1)")))))
Formula 0 simplified : !X("(gu3.P1<=gu3.P1M1)" | F"(gu0.P1s>gu0.P2M2)" | G"(gu3.P1>gu3.P1M1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin13704441991321679938
[2021-05-10 19:14:02] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13704441991321679938
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/ltsmin13704441991321679938]
Compilation finished in 129 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13704441991321679938]
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)||<>((LTLAPp1==true))||[](!(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin13704441991321679938]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FMS-PT-50000-02 finished in 16759 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:17] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 19:14:18] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:18] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:14:18] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:18] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:14:18] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-50000-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s5 s7)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-03 finished in 135 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 8 places and 0 transitions.
Graph (trivial) has 12 edges and 14 vertex of which 9 / 14 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 16 place count 8 transition count 13
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 26 place count 5 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 4 transition count 6
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 29 place count 4 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 29 place count 4 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 32 place count 2 transition count 3
Applied a total of 32 rules in 6 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 19:14:18] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 19:14:18] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 19:14:18] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-10 19:14:18] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-10 19:14:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 19:14:18] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 19:14:18] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/22 places, 3/20 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-50000-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FMS-PT-50000-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-04 finished in 96 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:18] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 19:14:18] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:18] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:14:18] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:18] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:14:18] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-50000-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s4 s14)], 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]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-05 finished in 185 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 8 edges and 15 vertex of which 3 / 15 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 13 transition count 13
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 20 place count 11 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 9 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 22 place count 9 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 24 place count 8 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 7 transition count 8
Applied a total of 26 rules in 2 ms. Remains 7 /22 variables (removed 15) and now considering 8/20 (removed 12) transitions.
// Phase 1: matrix 8 rows 7 cols
[2021-05-10 19:14:18] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 19:14:18] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 8 rows 7 cols
[2021-05-10 19:14:18] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 19:14:18] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-10 19:14:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 7 cols
[2021-05-10 19:14:18] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 19:14:18] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/22 places, 8/20 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-50000-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 1 s2) (GT 2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-07 finished in 67 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 9 edges and 17 vertex of which 3 / 17 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 15 transition count 16
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 15 transition count 14
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 12 place count 15 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 21 place count 10 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 26 place count 7 transition count 8
Applied a total of 26 rules in 2 ms. Remains 7 /22 variables (removed 15) and now considering 8/20 (removed 12) transitions.
[2021-05-10 19:14:18] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 7 cols
[2021-05-10 19:14:18] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 19:14:18] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-10 19:14:18] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 7 cols
[2021-05-10 19:14:18] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 19:14:18] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-10 19:14:18] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 19:14:18] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 7 cols
[2021-05-10 19:14:18] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 19:14:18] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/22 places, 8/20 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-50000-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s5 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-08 finished in 69 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 7 place count 18 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 11 place count 17 transition count 14
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 14 place count 14 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 14 place count 14 transition count 13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 16 place count 13 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 18 place count 12 transition count 12
Applied a total of 18 rules in 2 ms. Remains 12 /22 variables (removed 10) and now considering 12/20 (removed 8) transitions.
// Phase 1: matrix 12 rows 12 cols
[2021-05-10 19:14:18] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 19:14:18] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 12 rows 12 cols
[2021-05-10 19:14:18] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-10 19:14:18] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2021-05-10 19:14:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 12 cols
[2021-05-10 19:14:18] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 19:14:18] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/22 places, 12/20 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-50000-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ s2 s1), p0:(AND (LEQ s6 s8) (GT 2 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 126 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA FMS-PT-50000-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-09 finished in 244 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F((X(X(p1))&&p0))&&F(!p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:18] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:14:18] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:18] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:14:18] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:18] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:14:18] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, true, (OR (NOT p1) (NOT p0)), p1, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : FMS-PT-50000-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 4}]], initial=0, aps=[p0:(AND (GT s19 s1) (LEQ s5 s20)), p1:(LEQ s5 s20)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 134 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA FMS-PT-50000-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-10 finished in 379 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0&&X(p1)))&&X(X(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:19] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:14:19] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:19] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 19:14:19] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:19] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:14:19] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (NOT p2), true]
Running random walk in product with property : FMS-PT-50000-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s16 s17), p1:(LEQ s6 s11), p2:(LEQ 3 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-11 finished in 223 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(F((p0||G(F(p0))))))&&(X(p1) U ((X(p1)&&G(p2))||X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:19] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:14:19] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:19] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:14:19] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:19] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:14:19] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p0), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
Running random walk in product with property : FMS-PT-50000-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={1} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={1} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=5 dest: 5}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 6}, { cond=(AND p2 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(GT 3 s6), p1:(GT s10 s3), p0:(GT 1 s18)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6613 steps with 2106 reset in 10 ms.
FORMULA FMS-PT-50000-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-12 finished in 280 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((((X(X(G(p0))) U G(p1)) U !p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:19] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:14:19] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:19] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:14:19] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:19] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:14:19] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) p0), (NOT p0), p0, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : FMS-PT-50000-13 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 6}, { cond=p1, acceptance={} source=4 dest: 8}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(AND p0 p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(LEQ s19 s16), p1:(LEQ 3 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-13 finished in 294 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(p0))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 7 edges and 19 vertex of which 3 / 19 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 8 place count 17 transition count 16
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 14 place count 13 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 13 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 12 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 11 transition count 12
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 11 transition count 12
Applied a total of 19 rules in 3 ms. Remains 11 /22 variables (removed 11) and now considering 12/20 (removed 8) transitions.
// Phase 1: matrix 12 rows 11 cols
[2021-05-10 19:14:19] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 19:14:19] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 12 rows 11 cols
[2021-05-10 19:14:19] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 19:14:19] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2021-05-10 19:14:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 11 cols
[2021-05-10 19:14:19] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 19:14:19] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/22 places, 12/20 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FMS-PT-50000-14 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:(GT s5 s8), p0:(LEQ s1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 202 ms.
Product exploration explored 100000 steps with 0 reset in 164 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 120 ms.
Product exploration explored 100000 steps with 0 reset in 126 ms.
[2021-05-10 19:14:20] [INFO ] Flatten gal took : 1 ms
[2021-05-10 19:14:20] [INFO ] Flatten gal took : 1 ms
[2021-05-10 19:14:20] [INFO ] Time to serialize gal into /tmp/LTL2277063713172097784.gal : 1 ms
[2021-05-10 19:14:20] [INFO ] Time to serialize properties into /tmp/LTL2267589138299810387.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/LTL2277063713172097784.gal, -t, CGAL, -LTL, /tmp/LTL2267589138299810387.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/LTL2277063713172097784.gal -t CGAL -LTL /tmp/LTL2267589138299810387.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(P1s<=P1wM1)")))||(G("(P2>M3)")))))
Formula 0 simplified : !F(GF"(P1s<=P1wM1)" | G"(P2>M3)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-10 19:14:20] [INFO ] Flatten gal took : 1 ms
[2021-05-10 19:14:20] [INFO ] Applying decomposition
[2021-05-10 19:14:20] [INFO ] Flatten gal took : 0 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/graph17854645089544203129.txt, -o, /tmp/graph17854645089544203129.bin, -w, /tmp/graph17854645089544203129.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/graph17854645089544203129.bin, -l, -1, -v, -w, /tmp/graph17854645089544203129.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 19:14:20] [INFO ] Decomposing Gal with order
[2021-05-10 19:14:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 19:14:20] [INFO ] Flatten gal took : 1 ms
[2021-05-10 19:14:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-10 19:14:20] [INFO ] Time to serialize gal into /tmp/LTL10863687628339859835.gal : 1 ms
[2021-05-10 19:14:20] [INFO ] Time to serialize properties into /tmp/LTL14815032998386182101.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/LTL10863687628339859835.gal, -t, CGAL, -LTL, /tmp/LTL14815032998386182101.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
ITS-tools command line returned an error code 134

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/LTL10863687628339859835.gal -t CGAL -LTL /tmp/LTL14815032998386182101.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(gu0.P1s<=gu0.P1wM1)")))||(G("(gu1.P2>gu1.M3)")))))
Formula 0 simplified : !F(GF"(gu0.P1s<=gu0.P1wM1)" | G"(gu1.P2>gu1.M3)")
terminate called after throwing an instance of 'char const*'
Built C files in :
/tmp/ltsmin8331598373853024130
[2021-05-10 19:14:20] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8331598373853024130
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/ltsmin8331598373853024130]
Compilation finished in 124 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8331598373853024130]
Link finished in 32 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, <>(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin8331598373853024130]
LTSmin run took 1244 ms.
FORMULA FMS-PT-50000-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FMS-PT-50000-14 finished in 2289 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0)) U G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:22] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:14:22] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:22] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:14:22] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:14:22] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:14:22] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : FMS-PT-50000-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s0 s11), p0:(GT 2 s9)], 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 127 ms.
Stack based approach found an accepted trace after 186 steps with 0 reset with depth 187 and stack size 187 in 0 ms.
FORMULA FMS-PT-50000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-15 finished in 291 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16609189674109169333
[2021-05-10 19:14:22] [INFO ] Applying decomposition
[2021-05-10 19:14:22] [INFO ] Flatten gal took : 1 ms
[2021-05-10 19:14:22] [INFO ] Computing symmetric may disable matrix : 20 transitions.
[2021-05-10 19:14:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-10 19:14:22] [INFO ] Computing symmetric may enable matrix : 20 transitions.
[2021-05-10 19:14:22] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph14781645262069128000.txt, -o, /tmp/graph14781645262069128000.bin, -w, /tmp/graph14781645262069128000.weights], workingDir=null]
[2021-05-10 19:14:22] [INFO ] Computing Do-Not-Accords matrix : 20 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14781645262069128000.bin, -l, -1, -v, -w, /tmp/graph14781645262069128000.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 19:14:22] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-10 19:14:22] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16609189674109169333
[2021-05-10 19:14:22] [INFO ] Decomposing Gal with order
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/ltsmin16609189674109169333]
[2021-05-10 19:14:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 19:14:22] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-10 19:14:22] [INFO ] Flatten gal took : 3 ms
[2021-05-10 19:14:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-10 19:14:22] [INFO ] Time to serialize gal into /tmp/LTLCardinality3158083987281744191.gal : 1 ms
[2021-05-10 19:14:22] [INFO ] Time to serialize properties into /tmp/LTLCardinality10997934404513388745.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/LTLCardinality3158083987281744191.gal, -t, CGAL, -LTL, /tmp/LTLCardinality10997934404513388745.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/LTLCardinality3158083987281744191.gal -t CGAL -LTL /tmp/LTLCardinality10997934404513388745.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("(gu1.P1<=gu1.P1M1)")||(F("(gu3.P1s>gu3.P2M2)")))||(G("(gu1.P1>gu1.P1M1)")))))
Formula 0 simplified : !X("(gu1.P1<=gu1.P1M1)" | F"(gu3.P1s>gu3.P2M2)" | G"(gu1.P1>gu1.P1M1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-10 19:14:22] [INFO ] Flatten gal took : 1 ms
[2021-05-10 19:14:22] [INFO ] Time to serialize gal into /tmp/LTLCardinality1529674578932773599.gal : 0 ms
[2021-05-10 19:14:22] [INFO ] Time to serialize properties into /tmp/LTLCardinality14924749345575087476.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/LTLCardinality1529674578932773599.gal, -t, CGAL, -LTL, /tmp/LTLCardinality14924749345575087476.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/LTLCardinality1529674578932773599.gal -t CGAL -LTL /tmp/LTLCardinality14924749345575087476.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("(P1<=P1M1)")||(F("(P1s>P2M2)")))||(G("(P1>P1M1)")))))
Formula 0 simplified : !X("(P1<=P1M1)" | F"(P1s>P2M2)" | G"(P1>P1M1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-10 19:14:22] [INFO ] Flatten gal took : 2 ms
[2021-05-10 19:14:22] [INFO ] Input system was already deterministic with 20 transitions.
[2021-05-10 19:14:22] [INFO ] Transformed 22 places.
[2021-05-10 19:14:22] [INFO ] Transformed 20 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-10 19:14:22] [INFO ] Time to serialize gal into /tmp/LTLCardinality14464302831607678224.gal : 1 ms
[2021-05-10 19:14:22] [INFO ] Time to serialize properties into /tmp/LTLCardinality16213879444849304603.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/LTLCardinality14464302831607678224.gal, -t, CGAL, -LTL, /tmp/LTLCardinality16213879444849304603.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/LTLCardinality14464302831607678224.gal -t CGAL -LTL /tmp/LTLCardinality16213879444849304603.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((("(P1<=P1M1)")||(F("(P1s>P2M2)")))||(G("(P1>P1M1)")))))
Formula 0 simplified : !X("(P1<=P1M1)" | F"(P1s>P2M2)" | G"(P1>P1M1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Compilation finished in 164 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16609189674109169333]
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(((LTLAPp0==true)||<>((LTLAPp1==true))||[](!(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin16609189674109169333]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: LTL layer: formula: X(((LTLAPp0==true)||<>((LTLAPp1==true))||[](!(LTLAPp0==true))))
pins2lts-mc-linux64( 2/ 8), 0.001: "X(((LTLAPp0==true)||<>((LTLAPp1==true))||[](!(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.102: DFS-FIFO for weak LTL, using special progress label 23
pins2lts-mc-linux64( 0/ 8), 0.102: There are 24 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.102: State length is 23, there are 25 groups
pins2lts-mc-linux64( 0/ 8), 0.102: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.102: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.102: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.102: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.226: ~1 levels ~960 states ~5232 transitions
pins2lts-mc-linux64( 4/ 8), 0.229: ~1 levels ~1920 states ~8912 transitions
pins2lts-mc-linux64( 2/ 8), 0.231: ~1 levels ~3840 states ~25256 transitions
pins2lts-mc-linux64( 1/ 8), 0.234: ~1 levels ~7680 states ~44168 transitions
pins2lts-mc-linux64( 3/ 8), 0.240: ~1 levels ~15360 states ~92528 transitions
pins2lts-mc-linux64( 0/ 8), 0.254: ~1 levels ~30720 states ~195736 transitions
pins2lts-mc-linux64( 3/ 8), 0.288: ~1 levels ~61440 states ~396920 transitions
pins2lts-mc-linux64( 4/ 8), 0.347: ~1 levels ~122880 states ~685304 transitions
pins2lts-mc-linux64( 4/ 8), 0.469: ~1 levels ~245760 states ~1437920 transitions
pins2lts-mc-linux64( 1/ 8), 0.713: ~1 levels ~491520 states ~3022400 transitions
pins2lts-mc-linux64( 4/ 8), 1.213: ~1 levels ~983040 states ~5988000 transitions
pins2lts-mc-linux64( 1/ 8), 2.234: ~1 levels ~1966080 states ~12804488 transitions
pins2lts-mc-linux64( 1/ 8), 4.159: ~1 levels ~3932160 states ~25033680 transitions
pins2lts-mc-linux64( 1/ 8), 8.390: ~1 levels ~7864320 states ~52118000 transitions
pins2lts-mc-linux64( 1/ 8), 16.937: ~1 levels ~15728640 states ~105932728 transitions
pins2lts-mc-linux64( 1/ 8), 33.481: ~1 levels ~31457280 states ~208501240 transitions
pins2lts-mc-linux64( 1/ 8), 69.575: ~1 levels ~62914560 states ~425587264 transitions
pins2lts-mc-linux64( 2/ 8), 152.308: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 152.371:
pins2lts-mc-linux64( 0/ 8), 152.371: mean standard work distribution: 5.9% (states) 1.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 152.371:
pins2lts-mc-linux64( 0/ 8), 152.371: Explored 107301879 states 800887710 transitions, fanout: 7.464
pins2lts-mc-linux64( 0/ 8), 152.371: Total exploration time 152.250 sec (152.190 sec minimum, 152.212 sec on average)
pins2lts-mc-linux64( 0/ 8), 152.371: States per second: 704774, Transitions per second: 5260346
pins2lts-mc-linux64( 0/ 8), 152.371:
pins2lts-mc-linux64( 0/ 8), 152.371: Progress states detected: 134217354
pins2lts-mc-linux64( 0/ 8), 152.371: Redundant explorations: -20.0537
pins2lts-mc-linux64( 0/ 8), 152.371:
pins2lts-mc-linux64( 0/ 8), 152.371: Queue width: 8B, total height: 52368241, memory: 399.54MB
pins2lts-mc-linux64( 0/ 8), 152.371: Tree memory: 1033.8MB, 8.1 B/state, compr.: 8.6%
pins2lts-mc-linux64( 0/ 8), 152.371: Tree fill ratio (roots/leafs): 99.0%/3.0%
pins2lts-mc-linux64( 0/ 8), 152.371: Stored 21 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 152.371: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 152.371: Est. total memory use: 1433.3MB (~1423.5MB 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)||<>((LTLAPp1==true))||[](!(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin16609189674109169333]
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)||<>((LTLAPp1==true))||[](!(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin16609189674109169333]
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 1620674215984

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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