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.r102-smll-162075331200204.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 GPPP-PT-C0001N0000100000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331200204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 22 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 19:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000100000-00
FORMULA_NAME GPPP-PT-C0001N0000100000-01
FORMULA_NAME GPPP-PT-C0001N0000100000-02
FORMULA_NAME GPPP-PT-C0001N0000100000-03
FORMULA_NAME GPPP-PT-C0001N0000100000-04
FORMULA_NAME GPPP-PT-C0001N0000100000-05
FORMULA_NAME GPPP-PT-C0001N0000100000-06
FORMULA_NAME GPPP-PT-C0001N0000100000-07
FORMULA_NAME GPPP-PT-C0001N0000100000-08
FORMULA_NAME GPPP-PT-C0001N0000100000-09
FORMULA_NAME GPPP-PT-C0001N0000100000-10
FORMULA_NAME GPPP-PT-C0001N0000100000-11
FORMULA_NAME GPPP-PT-C0001N0000100000-12
FORMULA_NAME GPPP-PT-C0001N0000100000-13
FORMULA_NAME GPPP-PT-C0001N0000100000-14
FORMULA_NAME GPPP-PT-C0001N0000100000-15

=== Now, execution of the tool begins

BK_START 1621204010154

Running Version 0
[2021-05-16 22:26: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-16 22:26:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 22:26:53] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2021-05-16 22:26:53] [INFO ] Transformed 33 places.
[2021-05-16 22:26:53] [INFO ] Transformed 22 transitions.
[2021-05-16 22:26:53] [INFO ] Parsed PT model containing 33 places and 22 transitions in 150 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 22:26:53] [INFO ] Initial state test concluded for 3 properties.
FORMULA GPPP-PT-C0001N0000100000-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 18 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 22:26:54] [INFO ] Computed 13 place invariants in 9 ms
[2021-05-16 22:26:54] [INFO ] Dead Transitions using invariants and state equation in 247 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 22:26:54] [INFO ] Computed 13 place invariants in 3 ms
[2021-05-16 22:26:54] [INFO ] Implicit Places using invariants in 77 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 81 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 22:26:54] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 22:26:54] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Starting structural reductions, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 8 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 22:26:54] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 22:26:54] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 22/22 transitions.
[2021-05-16 22:26:54] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-16 22:26:54] [INFO ] Flatten gal took : 50 ms
FORMULA GPPP-PT-C0001N0000100000-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 22:26:54] [INFO ] Flatten gal took : 14 ms
[2021-05-16 22:26:54] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100001 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=267 ) properties (out of 20) seen :14
Running SMT prover for 6 properties.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 22:26:55] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-16 22:26:55] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 22:26:55] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2021-05-16 22:26:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 22:26:55] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-05-16 22:26:55] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-16 22:26:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 22:26:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 22:26:55] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2021-05-16 22:26:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 22:26:55] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2021-05-16 22:26:55] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-16 22:26:55] [INFO ] Added : 17 causal constraints over 4 iterations in 64 ms. Result :sat
[2021-05-16 22:26:55] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 22:26:55] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2021-05-16 22:26:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 22:26:55] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-16 22:26:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 22:26:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 22:26:55] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 117 ms returned sat
[2021-05-16 22:26:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 22:26:55] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-16 22:26:55] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-16 22:26:55] [INFO ] Added : 21 causal constraints over 5 iterations in 89 ms. Result :sat
[2021-05-16 22:26:55] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 22:26:55] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned unsat
[2021-05-16 22:26:56] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-16 22:26:56] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2021-05-16 22:26:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 22:26:56] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-05-16 22:26:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 22:26:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 22:26:56] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 8 ms returned sat
[2021-05-16 22:26:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 22:26:56] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2021-05-16 22:26:56] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-16 22:26:56] [INFO ] Added : 21 causal constraints over 5 iterations in 86 ms. Result :sat
[2021-05-16 22:26:56] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 22:26:56] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned unsat
[2021-05-16 22:26:56] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 22:26:56] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2021-05-16 22:26:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 22:26:56] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2021-05-16 22:26:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 22:26:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 22:26:56] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 10 ms returned sat
[2021-05-16 22:26:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 22:26:56] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2021-05-16 22:26:56] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-16 22:26:56] [INFO ] Added : 21 causal constraints over 5 iterations in 59 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2021-05-16 22:26:56] [INFO ] Initial state test concluded for 1 properties.
FORMULA GPPP-PT-C0001N0000100000-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 22:26:57] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 22:26:57] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 22:26:57] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 22:26:57] [INFO ] Implicit Places using invariants in 48 ms returned [0, 1, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 49 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:26:57] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-16 22:26:57] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Starting structural reductions, iteration 1 : 28/31 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:26:57] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:26:57] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 382 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000100000-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(LEQ 3 s1), p1:(LEQ 1 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 490 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 1 ms.
FORMULA GPPP-PT-C0001N0000100000-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-00 finished in 1257 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 22:26:58] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 22:26:58] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 22:26:58] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-16 22:26:58] [INFO ] Implicit Places using invariants in 66 ms returned [0, 1, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 68 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:26:58] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-16 22:26:58] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 28/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:26:58] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-16 22:26:58] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-01 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:(LEQ 3 s23)], 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 1 ms.
FORMULA GPPP-PT-C0001N0000100000-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-01 finished in 403 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((G(p0) U p1) U p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 3 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 29 transition count 20
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 2 with 5 rules applied. Total rules applied 8 place count 26 transition count 18
Applied a total of 8 rules in 33 ms. Remains 26 /31 variables (removed 5) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 26 cols
[2021-05-16 22:26:58] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 22:26:58] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
// Phase 1: matrix 18 rows 26 cols
[2021-05-16 22:26:58] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 22:26:58] [INFO ] Implicit Places using invariants in 53 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
[2021-05-16 22:26:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2021-05-16 22:26:58] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:26:58] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 24/31 places, 18/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 23 transition count 17
Applied a total of 2 rules in 5 ms. Remains 23 /24 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 23 cols
[2021-05-16 22:26:58] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-16 22:26:58] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2021-05-16 22:26:58] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 22:26:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 22:26:58] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 23/31 places, 17/22 transitions.
Stuttering acceptance computed with spot in 340 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0001N0000100000-03 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p2 p1 p0), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=2 dest: 2}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=3 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ s12 s0), p1:(OR (GT 3 s1) (GT s11 s7)), p0:(LEQ 3 s1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 439 ms.
Product exploration explored 100000 steps with 0 reset in 479 ms.
Knowledge obtained : [p2, p1, (NOT p0)]
Stuttering acceptance computed with spot in 202 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 189 ms.
Product exploration explored 100000 steps with 0 reset in 204 ms.
[2021-05-16 22:27:00] [INFO ] Flatten gal took : 6 ms
[2021-05-16 22:27:00] [INFO ] Flatten gal took : 5 ms
[2021-05-16 22:27:00] [INFO ] Time to serialize gal into /tmp/LTL3201466137472828181.gal : 2 ms
[2021-05-16 22:27:00] [INFO ] Time to serialize properties into /tmp/LTL14371447824739132580.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/LTL3201466137472828181.gal, -t, CGAL, -LTL, /tmp/LTL14371447824739132580.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/LTL3201466137472828181.gal -t CGAL -LTL /tmp/LTL14371447824739132580.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(((G("(NADPH>=3)"))U("((NADPH<3)||(ADP>F6P))"))U("(_3PG<=NADPplus)")))))
Formula 0 simplified : !FG((G"(NADPH>=3)" U "((NADPH<3)||(ADP>F6P))") U "(_3PG<=NADPplus)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-16 22:27:01] [INFO ] Flatten gal took : 4 ms
[2021-05-16 22:27:01] [INFO ] Applying decomposition
[2021-05-16 22:27:01] [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/graph17212980283443957369.txt, -o, /tmp/graph17212980283443957369.bin, -w, /tmp/graph17212980283443957369.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/graph17212980283443957369.bin, -l, -1, -v, -w, /tmp/graph17212980283443957369.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 22:27:01] [INFO ] Decomposing Gal with order
[2021-05-16 22:27:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 22:27:01] [INFO ] Removed a total of 4 redundant transitions.
[2021-05-16 22:27:01] [INFO ] Flatten gal took : 41 ms
[2021-05-16 22:27:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 22:27:01] [INFO ] Time to serialize gal into /tmp/LTL1116804145150717975.gal : 3 ms
[2021-05-16 22:27:01] [INFO ] Time to serialize properties into /tmp/LTL11605241511377480651.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/LTL1116804145150717975.gal, -t, CGAL, -LTL, /tmp/LTL11605241511377480651.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/LTL1116804145150717975.gal -t CGAL -LTL /tmp/LTL11605241511377480651.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(((G("(gu3.NADPH>=3)"))U("((gu3.NADPH<3)||(gu1.ADP>gu1.F6P))"))U("(gu3._3PG<=gu3.NADPplus)")))))
Formula 0 simplified : !FG((G"(gu3.NADPH>=3)" U "((gu3.NADPH<3)||(gu1.ADP>gu1.F6P))") U "(gu3._3PG<=gu3.NADPplus)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin17555098169773245529
[2021-05-16 22:27:01] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17555098169773245529
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/ltsmin17555098169773245529]
Compilation finished in 472 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17555098169773245529]
Link finished in 65 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)) U (LTLAPp1==true)) U (LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin17555098169773245529]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C0001N0000100000-03 finished in 17709 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 22:27:16] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 22:27:16] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 22:27:16] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-16 22:27:16] [INFO ] Implicit Places using invariants in 40 ms returned [0, 1, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 41 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:27:16] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:27:16] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 28/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:27:16] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:27:16] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-04 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:(LEQ 2 s23)], 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 GPPP-PT-C0001N0000100000-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-04 finished in 278 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 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.
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 3 place count 30 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 28 transition count 19
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 14 place count 23 transition count 15
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 21 transition count 14
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 2 with 2 rules applied. Total rules applied 19 place count 20 transition count 13
Applied a total of 19 rules in 11 ms. Remains 20 /31 variables (removed 11) and now considering 13/22 (removed 9) transitions.
// Phase 1: matrix 13 rows 20 cols
[2021-05-16 22:27:16] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 22:27:16] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
// Phase 1: matrix 13 rows 20 cols
[2021-05-16 22:27:16] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 22:27:16] [INFO ] Implicit Places using invariants in 43 ms returned [0, 1, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 44 ms to find 3 implicit places.
[2021-05-16 22:27:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 17 cols
[2021-05-16 22:27:16] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 22:27:16] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 17/31 places, 13/22 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 17 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 15 transition count 11
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 2 with 2 rules applied. Total rules applied 6 place count 14 transition count 10
Applied a total of 6 rules in 4 ms. Remains 14 /17 variables (removed 3) and now considering 10/13 (removed 3) transitions.
// Phase 1: matrix 10 rows 14 cols
[2021-05-16 22:27:16] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 22:27:16] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 10 rows 14 cols
[2021-05-16 22:27:16] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 22:27:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 22:27:16] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 14/31 places, 10/22 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s12 s0)], 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 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-05 finished in 232 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 22:27:16] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 22:27:16] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 22:27:16] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 22:27:16] [INFO ] Implicit Places using invariants in 42 ms returned [0, 1, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 45 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:27:16] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-16 22:27:16] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 28/31 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:27:16] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:27:16] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 20525 reset in 218 ms.
Product exploration explored 100000 steps with 20519 reset in 254 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20474 reset in 170 ms.
Product exploration explored 100000 steps with 20489 reset in 148 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 28/28 places, 22/22 transitions.
Graph (trivial) has 9 edges and 28 vertex of which 2 / 28 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.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 27 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 5 place count 27 transition count 21
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 27 transition count 21
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 24 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 24 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 24 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 22 transition count 16
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 22 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 22 transition count 16
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 21 rules in 8 ms. Remains 22 /28 variables (removed 6) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 22 cols
[2021-05-16 22:27:18] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 22:27:18] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
[2021-05-16 22:27:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-16 22:27:18] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:27:18] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/28 places, 16/22 transitions.
Product exploration explored 100000 steps with 25451 reset in 708 ms.
Product exploration explored 100000 steps with 25433 reset in 233 ms.
[2021-05-16 22:27:19] [INFO ] Flatten gal took : 4 ms
[2021-05-16 22:27:19] [INFO ] Flatten gal took : 3 ms
[2021-05-16 22:27:19] [INFO ] Time to serialize gal into /tmp/LTL6488497301065999639.gal : 2 ms
[2021-05-16 22:27:19] [INFO ] Time to serialize properties into /tmp/LTL1879116360660616575.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/LTL6488497301065999639.gal, -t, CGAL, -LTL, /tmp/LTL1879116360660616575.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/LTL6488497301065999639.gal -t CGAL -LTL /tmp/LTL1879116360660616575.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(b2>=3)"))))
Formula 0 simplified : !XF"(b2>=3)"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-16 22:27:19] [INFO ] Flatten gal took : 3 ms
[2021-05-16 22:27:19] [INFO ] Applying decomposition
[2021-05-16 22:27:19] [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/graph14463870085982730846.txt, -o, /tmp/graph14463870085982730846.bin, -w, /tmp/graph14463870085982730846.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/graph14463870085982730846.bin, -l, -1, -v, -w, /tmp/graph14463870085982730846.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 22:27:19] [INFO ] Decomposing Gal with order
[2021-05-16 22:27:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 22:27:19] [INFO ] Removed a total of 3 redundant transitions.
[2021-05-16 22:27:19] [INFO ] Flatten gal took : 5 ms
[2021-05-16 22:27:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 22:27:19] [INFO ] Time to serialize gal into /tmp/LTL10438989810730603133.gal : 2 ms
[2021-05-16 22:27:19] [INFO ] Time to serialize properties into /tmp/LTL5149838306369417466.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/LTL10438989810730603133.gal, -t, CGAL, -LTL, /tmp/LTL5149838306369417466.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/LTL10438989810730603133.gal -t CGAL -LTL /tmp/LTL5149838306369417466.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(i0.u7.b2>=3)"))))
Formula 0 simplified : !XF"(i0.u7.b2>=3)"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin3581384303336887112
[2021-05-16 22:27:19] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3581384303336887112
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/ltsmin3581384303336887112]
Compilation finished in 295 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3581384303336887112]
Link finished in 41 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin3581384303336887112]
LTSmin run took 432 ms.
FORMULA GPPP-PT-C0001N0000100000-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0001N0000100000-06 finished in 3414 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0))&&G((p1 U p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 22:27:20] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 22:27:20] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 22:27:20] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 22:27:20] [INFO ] Implicit Places using invariants in 34 ms returned [0, 1, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 35 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:27:20] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:27:20] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 28/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:27:20] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 22:27:20] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-07 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(OR p2 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(OR p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ 2 s24), p1:(GT s5 s18), p0:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000100000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-07 finished in 300 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(p0)||G((X(G(p2))&&p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 22:27:20] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 22:27:20] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 22:27:20] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 22:27:20] [INFO ] Implicit Places using invariants in 35 ms returned [0, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 22:27:20] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 22:27:20] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 29/31 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 22:27:20] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 22:27:20] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), true]
Running random walk in product with property : GPPP-PT-C0001N0000100000-12 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (LEQ 1 s5) (LEQ s12 s22)), p0:(LEQ s12 s22), p2:(LEQ s12 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000100000-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-12 finished in 390 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 22:27:20] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 22:27:20] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 22:27:20] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 22:27:20] [INFO ] Implicit Places using invariants in 29 ms returned [0, 1, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:27:20] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:27:21] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 28/31 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:27:21] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:27:21] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000100000-13 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ s11 s2), p0:(AND (LEQ s11 s2) (LEQ s27 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 127 ms.
Product exploration explored 100000 steps with 0 reset in 144 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 170 ms.
Product exploration explored 100000 steps with 0 reset in 229 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Support contains 4 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 28/28 places, 22/22 transitions.
Graph (trivial) has 8 edges and 28 vertex of which 2 / 28 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.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 27 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 4 place count 27 transition count 21
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 27 transition count 21
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 24 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 24 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 24 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 22 transition count 16
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 22 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 22 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 19 rules in 9 ms. Remains 22 /28 variables (removed 6) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 22 cols
[2021-05-16 22:27:22] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 22:27:22] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
[2021-05-16 22:27:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-16 22:27:22] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:27:22] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/28 places, 16/22 transitions.
Product exploration explored 100000 steps with 0 reset in 320 ms.
Product exploration explored 100000 steps with 0 reset in 427 ms.
[2021-05-16 22:27:23] [INFO ] Flatten gal took : 3 ms
[2021-05-16 22:27:23] [INFO ] Flatten gal took : 3 ms
[2021-05-16 22:27:23] [INFO ] Time to serialize gal into /tmp/LTL3739630664828960915.gal : 1 ms
[2021-05-16 22:27:23] [INFO ] Time to serialize properties into /tmp/LTL8997069536297352773.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/LTL3739630664828960915.gal, -t, CGAL, -LTL, /tmp/LTL8997069536297352773.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/LTL3739630664828960915.gal -t CGAL -LTL /tmp/LTL8997069536297352773.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("((G6P<=GSSG)&&(c2<=S7P))"))&&(G("(G6P<=GSSG)")))))
Formula 0 simplified : !X(F"((G6P<=GSSG)&&(c2<=S7P))" & G"(G6P<=GSSG)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-16 22:27:23] [INFO ] Flatten gal took : 4 ms
[2021-05-16 22:27:23] [INFO ] Applying decomposition
[2021-05-16 22:27:23] [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/graph3435991650085933262.txt, -o, /tmp/graph3435991650085933262.bin, -w, /tmp/graph3435991650085933262.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/graph3435991650085933262.bin, -l, -1, -v, -w, /tmp/graph3435991650085933262.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 22:27:23] [INFO ] Decomposing Gal with order
[2021-05-16 22:27:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 22:27:23] [INFO ] Removed a total of 3 redundant transitions.
[2021-05-16 22:27:23] [INFO ] Flatten gal took : 8 ms
[2021-05-16 22:27:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 22:27:23] [INFO ] Time to serialize gal into /tmp/LTL10129847983322727839.gal : 2 ms
[2021-05-16 22:27:23] [INFO ] Time to serialize properties into /tmp/LTL490178300671316070.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/LTL10129847983322727839.gal, -t, CGAL, -LTL, /tmp/LTL490178300671316070.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/LTL10129847983322727839.gal -t CGAL -LTL /tmp/LTL490178300671316070.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("((gu1.G6P<=gu1.GSSG)&&(gu10.c2<=gu10.S7P))"))&&(G("(gu1.G6P<=gu1.GSSG)")))))
Formula 0 simplified : !X(F"((gu1.G6P<=gu1.GSSG)&&(gu10.c2<=gu10.S7P))" & G"(gu1.G6P<=gu1.GSSG)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin9239005504321667982
[2021-05-16 22:27:23] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9239005504321667982
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/ltsmin9239005504321667982]
Compilation finished in 254 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9239005504321667982]
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)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9239005504321667982]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C0001N0000100000-13 finished in 17416 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 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.
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 3 place count 30 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 28 transition count 19
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 14 place count 23 transition count 15
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 21 transition count 14
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 2 with 2 rules applied. Total rules applied 19 place count 20 transition count 13
Applied a total of 19 rules in 5 ms. Remains 20 /31 variables (removed 11) and now considering 13/22 (removed 9) transitions.
// Phase 1: matrix 13 rows 20 cols
[2021-05-16 22:27:38] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 22:27:38] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
// Phase 1: matrix 13 rows 20 cols
[2021-05-16 22:27:38] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 22:27:38] [INFO ] Implicit Places using invariants in 41 ms returned [0, 1, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
[2021-05-16 22:27:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 17 cols
[2021-05-16 22:27:38] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 22:27:38] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 17/31 places, 13/22 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 17 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 15 transition count 11
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 2 with 2 rules applied. Total rules applied 6 place count 14 transition count 10
Applied a total of 6 rules in 5 ms. Remains 14 /17 variables (removed 3) and now considering 10/13 (removed 3) transitions.
// Phase 1: matrix 10 rows 14 cols
[2021-05-16 22:27:38] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 22:27:38] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 10 rows 14 cols
[2021-05-16 22:27:38] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 22:27:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 22:27:38] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 14/31 places, 10/22 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s8)], 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 1 steps with 0 reset in 3 ms.
FORMULA GPPP-PT-C0001N0000100000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-14 finished in 198 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 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.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 20
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 29 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 28 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 11 place count 25 transition count 16
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 13 place count 24 transition count 15
Applied a total of 13 rules in 8 ms. Remains 24 /31 variables (removed 7) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2021-05-16 22:27:38] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 22:27:38] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
// Phase 1: matrix 15 rows 24 cols
[2021-05-16 22:27:38] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 22:27:38] [INFO ] Implicit Places using invariants in 27 ms returned [0, 1, 14]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 27 ms to find 3 implicit places.
[2021-05-16 22:27:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 21 cols
[2021-05-16 22:27:38] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 22:27:38] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 21/31 places, 15/22 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 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 14
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 20 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 19 transition count 13
Applied a total of 4 rules in 9 ms. Remains 19 /21 variables (removed 2) and now considering 13/15 (removed 2) transitions.
// Phase 1: matrix 13 rows 19 cols
[2021-05-16 22:27:38] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:27:38] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 13 rows 19 cols
[2021-05-16 22:27:38] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 22:27:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 22:27:38] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 19/31 places, 13/22 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000100000-15 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 3 s11), p0:(LEQ 1 s3)], 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 42 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000100000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-15 finished in 238 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2553914778661780892
[2021-05-16 22:27:38] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2021-05-16 22:27:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 22:27:38] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2021-05-16 22:27:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 22:27:38] [INFO ] Applying decomposition
[2021-05-16 22:27:38] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2021-05-16 22:27:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 22:27:38] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2553914778661780892
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/ltsmin2553914778661780892]
[2021-05-16 22:27:38] [INFO ] Flatten gal took : 5 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/graph17232820551770116489.txt, -o, /tmp/graph17232820551770116489.bin, -w, /tmp/graph17232820551770116489.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/graph17232820551770116489.bin, -l, -1, -v, -w, /tmp/graph17232820551770116489.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 22:27:38] [INFO ] Decomposing Gal with order
[2021-05-16 22:27:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 22:27:38] [INFO ] Removed a total of 4 redundant transitions.
[2021-05-16 22:27:38] [INFO ] Flatten gal took : 5 ms
[2021-05-16 22:27:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 22:27:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality10623111885232443523.gal : 1 ms
[2021-05-16 22:27:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality5496285468815537909.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/LTLCardinality10623111885232443523.gal, -t, CGAL, -LTL, /tmp/LTLCardinality5496285468815537909.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/LTLCardinality10623111885232443523.gal -t CGAL -LTL /tmp/LTLCardinality5496285468815537909.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((F(G(((G("(gu4.NADPH>=3)"))U("((gu4.NADPH<3)||(gu3.ADP>gu3.F6P))"))U("(gu4._3PG<=gu4.NADPplus)")))))
Formula 0 simplified : !FG((G"(gu4.NADPH>=3)" U "((gu4.NADPH<3)||(gu3.ADP>gu3.F6P))") U "(gu4._3PG<=gu4.NADPplus)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-16 22:27:38] [INFO ] Flatten gal took : 3 ms
[2021-05-16 22:27:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality9806516274821697485.gal : 0 ms
[2021-05-16 22:27:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality16299173734574975721.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/LTLCardinality9806516274821697485.gal, -t, CGAL, -LTL, /tmp/LTLCardinality16299173734574975721.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/LTLCardinality9806516274821697485.gal -t CGAL -LTL /tmp/LTLCardinality16299173734574975721.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((F(G(((G("(NADPH>=3)"))U("((NADPH<3)||(ADP>F6P))"))U("(_3PG<=NADPplus)")))))
Formula 0 simplified : !FG((G"(NADPH>=3)" U "((NADPH<3)||(ADP>F6P))") U "(_3PG<=NADPplus)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-16 22:27:38] [INFO ] Flatten gal took : 3 ms
[2021-05-16 22:27:38] [INFO ] Input system was already deterministic with 22 transitions.
[2021-05-16 22:27:38] [INFO ] Transformed 31 places.
[2021-05-16 22:27:38] [INFO ] Transformed 22 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 22:27:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality15022131381187860280.gal : 0 ms
[2021-05-16 22:27:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality17966224776893771914.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/LTLCardinality15022131381187860280.gal, -t, CGAL, -LTL, /tmp/LTLCardinality17966224776893771914.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/LTLCardinality15022131381187860280.gal -t CGAL -LTL /tmp/LTLCardinality17966224776893771914.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(((G("(NADPH>=3)"))U("((NADPH<3)||(ADP>F6P))"))U("(_3PG<=NADPplus)")))))
Formula 0 simplified : !FG((G"(NADPH>=3)" U "((NADPH<3)||(ADP>F6P))") U "(_3PG<=NADPplus)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Compilation finished in 291 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2553914778661780892]
Link finished in 39 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((([]((LTLAPp0==true)) U (LTLAPp1==true)) U (LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin2553914778661780892]
WARNING : LTSmin timed out (>300 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((([]((LTLAPp0==true)) U (LTLAPp1==true)) U (LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin2553914778661780892]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp3==true))&&[]((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin2553914778661780892]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: 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( 6/ 8), 0.001: 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( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.319: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.322: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.319: LTL layer: formula: X((<>((LTLAPp3==true))&&[]((LTLAPp4==true))))
pins2lts-mc-linux64( 4/ 8), 0.319: "X((<>((LTLAPp3==true))&&[]((LTLAPp4==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.320: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.333: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.333: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.331: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.331: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.331: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.333: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.334: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.402: DFS-FIFO for weak LTL, using special progress label 28
pins2lts-mc-linux64( 0/ 8), 0.403: There are 29 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.403: State length is 32, there are 29 groups
pins2lts-mc-linux64( 0/ 8), 0.403: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.403: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.403: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.403: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.539: ~2 levels ~960 states ~3952 transitions
pins2lts-mc-linux64( 5/ 8), 0.553: ~2 levels ~1920 states ~8960 transitions
pins2lts-mc-linux64( 6/ 8), 0.556: ~1 levels ~3840 states ~17584 transitions
pins2lts-mc-linux64( 6/ 8), 0.559: ~1 levels ~7680 states ~37072 transitions
pins2lts-mc-linux64( 6/ 8), 0.564: ~1 levels ~15360 states ~78736 transitions
pins2lts-mc-linux64( 6/ 8), 0.587: ~1 levels ~30720 states ~164912 transitions
pins2lts-mc-linux64( 6/ 8), 0.634: ~1 levels ~61440 states ~339728 transitions
pins2lts-mc-linux64( 5/ 8), 0.722: ~2 levels ~122880 states ~677784 transitions
pins2lts-mc-linux64( 4/ 8), 0.898: ~2 levels ~245760 states ~1284824 transitions
pins2lts-mc-linux64( 3/ 8), 1.356: ~2 levels ~491520 states ~2946672 transitions
pins2lts-mc-linux64( 4/ 8), 2.088: ~2 levels ~983040 states ~5464448 transitions
pins2lts-mc-linux64( 2/ 8), 3.500: ~2 levels ~1966080 states ~11257864 transitions
pins2lts-mc-linux64( 2/ 8), 6.293: ~2 levels ~3932160 states ~22550168 transitions
pins2lts-mc-linux64( 2/ 8), 11.795: ~2 levels ~7864320 states ~44668120 transitions
pins2lts-mc-linux64( 2/ 8), 23.445: ~2 levels ~15728640 states ~91991632 transitions
pins2lts-mc-linux64( 1/ 8), 47.252: ~1 levels ~31457280 states ~187111528 transitions
pins2lts-mc-linux64( 2/ 8), 94.801: ~2 levels ~62914560 states ~375349440 transitions
pins2lts-mc-linux64( 2/ 8), 195.483: ~2 levels ~125829120 states ~750926192 transitions
pins2lts-mc-linux64( 4/ 8), 239.734: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 239.764:
pins2lts-mc-linux64( 0/ 8), 239.764: mean standard work distribution: 3.0% (states) 3.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 239.764:
pins2lts-mc-linux64( 0/ 8), 239.764: Explored 134057455 states 802477773 transitions, fanout: 5.986
pins2lts-mc-linux64( 0/ 8), 239.764: Total exploration time 239.350 sec (239.330 sec minimum, 239.337 sec on average)
pins2lts-mc-linux64( 0/ 8), 239.764: States per second: 560090, Transitions per second: 3352738
pins2lts-mc-linux64( 0/ 8), 239.764:
pins2lts-mc-linux64( 0/ 8), 239.764: Progress states detected: 134217054
pins2lts-mc-linux64( 0/ 8), 239.764: Redundant explorations: -0.1191
pins2lts-mc-linux64( 0/ 8), 239.764:
pins2lts-mc-linux64( 0/ 8), 239.764: Queue width: 8B, total height: 557261, memory: 4.25MB
pins2lts-mc-linux64( 0/ 8), 239.764: Tree memory: 1080.1MB, 8.4 B/state, compr.: 6.5%
pins2lts-mc-linux64( 0/ 8), 239.764: Tree fill ratio (roots/leafs): 99.0%/21.0%
pins2lts-mc-linux64( 0/ 8), 239.764: Stored 22 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 239.764: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 239.764: Est. total memory use: 1084.4MB (~1028.3MB 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((<>((LTLAPp3==true))&&[]((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin2553914778661780892]
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((<>((LTLAPp3==true))&&[]((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin2553914778661780892]
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 1621204600106

--------------------
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
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ 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="GPPP-PT-C0001N0000100000"
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 GPPP-PT-C0001N0000100000, 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 r102-smll-162075331200204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000100000.tgz
mv GPPP-PT-C0001N0000100000 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 ;