Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r096-smll-165260575900203.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 r096-smll-165260575900203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 7.5K Apr 29 18:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 29 18:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 29 18:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 29 18:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 9 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 17 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1 May 10 09:33 large_marking
-rw-r--r-- 1 mcc users 21K May 10 09:33 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-LTLCardinality-00
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-01
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-02
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-03
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-04
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-05
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-06
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-07
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-08
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-09
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-10
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-11
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-12
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-13
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-14
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652683052416

Running Version 202205111006
[2022-05-16 06:37:34] [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]
[2022-05-16 06:37:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 06:37:35] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2022-05-16 06:37:35] [INFO ] Transformed 33 places.
[2022-05-16 06:37:35] [INFO ] Transformed 22 transitions.
[2022-05-16 06:37:35] [INFO ] Parsed PT model containing 33 places and 22 transitions in 352 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 30 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 06:37:35] [INFO ] Computed 13 place invariants in 11 ms
[2022-05-16 06:37:36] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 06:37:36] [INFO ] Computed 13 place invariants in 4 ms
[2022-05-16 06:37:36] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 06:37:36] [INFO ] Computed 13 place invariants in 4 ms
[2022-05-16 06:37:36] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 06:37:36] [INFO ] Computed 13 place invariants in 4 ms
[2022-05-16 06:37:36] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 22/22 transitions.
Support contains 23 out of 33 places after structural reductions.
[2022-05-16 06:37:36] [INFO ] Flatten gal took : 40 ms
[2022-05-16 06:37:36] [INFO ] Flatten gal took : 15 ms
[2022-05-16 06:37:36] [INFO ] Input system was already deterministic with 22 transitions.
Support contains 22 out of 33 places (down from 23) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 654 ms. (steps per millisecond=15 ) properties (out of 22) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 06:37:37] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 06:37:37] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 06:37:37] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-16 06:37:37] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2022-05-16 06:37:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 06:37:38] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-16 06:37:38] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :2
[2022-05-16 06:37:38] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :2
Attempting to minimize the solution found.
Minimization took 50 ms.
[2022-05-16 06:37:38] [INFO ] After 292ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :2
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4003 ms.
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 18
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 5 place count 30 transition count 18
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 10 place count 27 transition count 16
Applied a total of 10 rules in 19 ms. Remains 27 /33 variables (removed 6) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 27 cols
[2022-05-16 06:37:42] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 06:37:42] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/33 places, 16/22 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 400131 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 400131 steps, saw 163297 distinct states, run finished after 3002 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 16 rows 27 cols
[2022-05-16 06:37:45] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 06:37:45] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 06:37:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 06:37:45] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 5 ms returned sat
[2022-05-16 06:37:45] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 06:37:45] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2022-05-16 06:37:45] [INFO ] After 220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4001 ms.
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 27/27 places, 16/16 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 16/16 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 27/27 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 27 cols
[2022-05-16 06:37:49] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 06:37:49] [INFO ] Implicit Places using invariants in 74 ms returned [0, 1, 2, 3, 15]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 77 ms to find 5 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 22/27 places, 16/16 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 20 transition count 14
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 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 18 transition count 12
Applied a total of 8 rules in 11 ms. Remains 18 /22 variables (removed 4) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 06:37:49] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:37:49] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 06:37:49] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:37:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 06:37:49] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 18/27 places, 12/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 18/27 places, 12/16 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 549060 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :{}
Probabilistic random walk after 549060 steps, saw 207230 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 06:37:53] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:37:53] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 06:37:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-16 06:37:53] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 8 ms returned sat
[2022-05-16 06:37:53] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 06:37:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 06:37:53] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-16 06:37:53] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-05-16 06:37:53] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2000 ms.
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 12/12 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 06:37:55] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:37:55] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 06:37:55] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:37:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 06:37:55] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2022-05-16 06:37:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 06:37:55] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:37:55] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 06:37:55] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:37:55] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 06:37:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 06:37:55] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-16 06:37:55] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 06:37:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 06:37:55] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-16 06:37:55] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 49 ms.
[2022-05-16 06:37:55] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-16 06:37:55] [INFO ] Flatten gal took : 4 ms
[2022-05-16 06:37:55] [INFO ] Flatten gal took : 4 ms
[2022-05-16 06:37:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6806912425218188106.gal : 2 ms
[2022-05-16 06:37:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3844029010392637870.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16973712625527974454;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6806912425218188106.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3844029010392637870.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality3844029010392637870.prop.
ITS-tools command line returned an error code 1
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
[2022-05-16 06:37:55] [INFO ] Flatten gal took : 3 ms
[2022-05-16 06:37:55] [INFO ] Applying decomposition
[2022-05-16 06:37:55] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3768673130006356245.txt' '-o' '/tmp/graph3768673130006356245.bin' '-w' '/tmp/graph3768673130006356245.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3768673130006356245.bin' '-l' '-1' '-v' '-w' '/tmp/graph3768673130006356245.weights' '-q' '0' '-e' '0.001'
[2022-05-16 06:37:55] [INFO ] Decomposing Gal with order
[2022-05-16 06:37:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 06:37:55] [INFO ] Flatten gal took : 72 ms
[2022-05-16 06:37:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 06:37:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6340270386561917848.gal : 2 ms
[2022-05-16 06:37:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6041358331931134673.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16973712625527974454;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6340270386561917848.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6041358331931134673.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality6041358331931134673.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
Built C files in :
/tmp/ltsmin9436392916217204618
[2022-05-16 06:37:56] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9436392916217204618
Running compilation step : cd /tmp/ltsmin9436392916217204618;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 385 ms.
Running link step : cd /tmp/ltsmin9436392916217204618;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 200 ms.
Running LTSmin : cd /tmp/ltsmin9436392916217204618;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp7==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Successfully simplified 5 atomic propositions for a total of 10 simplifications.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 33 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 21
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 0 with 3 rules applied. Total rules applied 5 place count 30 transition count 20
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 0 with 3 rules applied. Total rules applied 8 place count 28 transition count 19
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 0 with 2 rules applied. Total rules applied 10 place count 27 transition count 18
Applied a total of 10 rules in 13 ms. Remains 27 /33 variables (removed 6) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 27 cols
[2022-05-16 06:38:11] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 06:38:11] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
// Phase 1: matrix 18 rows 27 cols
[2022-05-16 06:38:11] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 06:38:11] [INFO ] Implicit Places using invariants in 51 ms returned [0, 1, 2, 3, 15]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 52 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/33 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 22 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 21 transition count 17
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 21 transition count 14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 18 transition count 14
Applied a total of 8 rules in 4 ms. Remains 18 /22 variables (removed 4) and now considering 14/18 (removed 4) transitions.
// Phase 1: matrix 14 rows 18 cols
[2022-05-16 06:38:11] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 06:38:11] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2022-05-16 06:38:11] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 06:38:11] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/33 places, 14/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 18/33 places, 14/22 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s4 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-00 finished in 446 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(F(p0))) U G(p1)))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 06:38:11] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 06:38:11] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 06:38:11] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 06:38:11] [INFO ] Implicit Places using invariants in 87 ms returned [0, 1, 2, 3, 19]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 88 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/33 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.
Finished structural reductions, in 2 iterations. Remains : 28/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 312 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s17 s10), p0:(LEQ 1 s26)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1700 reset in 541 ms.
Stack based approach found an accepted trace after 4865 steps with 80 reset with depth 66 and stack size 60 in 21 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-01 finished in 1054 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U G(p1)) U X((X(X(p2))||!p1))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 06:38:12] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 06:38:12] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 06:38:12] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 06:38:12] [INFO ] Implicit Places using invariants in 64 ms returned [0, 1, 2, 3, 19]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 67 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/33 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.
Finished structural reductions, in 2 iterations. Remains : 28/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 850 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p2)), false, (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (NOT p2), true, (NOT p2), (AND (NOT p2) (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=(OR p1 p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 10}, { cond=(OR p1 p0), acceptance={} source=7 dest: 11}, { cond=p1, acceptance={} source=7 dest: 12}], [{ cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 5}, { cond=(AND p1 p0), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=9 dest: 13}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=10 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=11 dest: 14}, { cond=(NOT p2), acceptance={} source=11 dest: 15}, { cond=(AND p1 (NOT p2)), acceptance={} source=11 dest: 16}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=12 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=12 dest: 10}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=12 dest: 11}, { cond=(AND p1 (NOT p2)), acceptance={0} source=12 dest: 12}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=12 dest: 13}], [{ cond=(AND (NOT p1) p0), acceptance={} source=13 dest: 6}, { cond=(AND p1 p0), acceptance={} source=13 dest: 13}], [{ cond=(NOT p0), acceptance={} source=14 dest: 6}], [{ cond=(NOT p1), acceptance={} source=15 dest: 14}, { cond=p1, acceptance={} source=15 dest: 15}, { cond=(NOT p1), acceptance={0} source=15 dest: 15}, { cond=p1, acceptance={} source=15 dest: 16}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=16 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=16 dest: 13}]], initial=0, aps=[p1:(LEQ s23 s6), p0:(LEQ s17 s4), p2:(LEQ s20 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33202 reset in 215 ms.
Product exploration explored 100000 steps with 33328 reset in 250 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 643 ms. Reduced automaton from 17 states, 36 edges and 3 AP to 11 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 489 ms :[(NOT p2), (NOT p2), true, (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 14) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 22 rows 28 cols
[2022-05-16 06:38:16] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-16 06:38:16] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 06:38:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-16 06:38:16] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-16 06:38:16] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 06:38:16] [INFO ] After 300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-05-16 06:38:16] [INFO ] After 473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 38 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
Parikh walk visited 4 properties in 2 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p2) p1)), (F (AND (NOT p0) p1)), (F (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p2) (NOT p0))), (F (NOT p2)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 1062 ms. Reduced automaton from 11 states, 23 edges and 3 AP to 11 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 561 ms :[(NOT p2), (NOT p2), true, (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 545 ms :[(NOT p2), (NOT p2), true, (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 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
[2022-05-16 06:38:18] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 06:38:18] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
// Phase 1: matrix 22 rows 28 cols
[2022-05-16 06:38:18] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 06:38:18] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 22 rows 28 cols
[2022-05-16 06:38:18] [INFO ] Computed 8 place invariants in 4 ms
[2022-05-16 06:38:19] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2022-05-16 06:38:19] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 06:38:19] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 22/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 11 states, 23 edges and 3 AP to 11 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 499 ms :[(NOT p2), (NOT p2), true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 14) seen :10
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 22 rows 28 cols
[2022-05-16 06:38:20] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-16 06:38:20] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 06:38:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 06:38:20] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 4 ms returned sat
[2022-05-16 06:38:20] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 06:38:20] [INFO ] After 431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-16 06:38:20] [INFO ] After 657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 42 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=10 )
Parikh walk visited 4 properties in 4 ms.
Knowledge obtained : [(AND p2 p0 p1), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p2) p1)), (F (AND (NOT p0) p1)), (F (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (NOT p2)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 598 ms. Reduced automaton from 11 states, 23 edges and 3 AP to 11 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 586 ms :[(NOT p2), (NOT p2), true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 627 ms :[(NOT p2), (NOT p2), true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 557 ms :[(NOT p2), (NOT p2), true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 165 ms.
Product exploration explored 100000 steps with 25000 reset in 195 ms.
Applying partial POR strategy [false, false, true, false, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 545 ms :[(NOT p2), (NOT p2), true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 22/22 transitions.
Graph (trivial) has 6 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 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 27 transition count 21
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 27 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 26 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 26 transition count 20
Performed 2 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 2 rules applied. Total rules applied 9 place count 26 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 25 transition count 19
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 25 transition count 19
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 11 rules in 11 ms. Remains 25 /28 variables (removed 3) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 25 cols
[2022-05-16 06:38:24] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-16 06:38:24] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
[2022-05-16 06:38:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 25 cols
[2022-05-16 06:38:24] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 06:38:24] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/28 places, 19/22 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/28 places, 19/22 transitions.
Product exploration explored 100000 steps with 25000 reset in 435 ms.
Product exploration explored 100000 steps with 25000 reset in 386 ms.
Built C files in :
/tmp/ltsmin17379314111250940404
[2022-05-16 06:38:25] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17379314111250940404
Running compilation step : cd /tmp/ltsmin17379314111250940404;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 179 ms.
Running link step : cd /tmp/ltsmin17379314111250940404;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17379314111250940404;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13863028531514175885.hoa' '--buchi-type=spotba'
LTSmin run took 90 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-02 finished in 13076 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(G(X(p1)))&&p1)||p0))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 32 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 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
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 5 place count 30 transition count 19
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 10 place count 27 transition count 17
Applied a total of 10 rules in 8 ms. Remains 27 /33 variables (removed 6) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 27 cols
[2022-05-16 06:38:25] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 06:38:25] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
// Phase 1: matrix 17 rows 27 cols
[2022-05-16 06:38:25] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 06:38:25] [INFO ] Implicit Places using invariants in 45 ms returned [0, 1, 2, 3, 15]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 46 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/33 places, 17/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 22 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 20 transition count 15
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 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 18 transition count 13
Applied a total of 8 rules in 3 ms. Remains 18 /22 variables (removed 4) and now considering 13/17 (removed 4) transitions.
// Phase 1: matrix 13 rows 18 cols
[2022-05-16 06:38:25] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:38:25] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 13 rows 18 cols
[2022-05-16 06:38:25] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:38:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 06:38:26] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/33 places, 13/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 18/33 places, 13/22 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s12 s0) (LEQ s11 s9)), p1:(LEQ s0 s9)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 424 ms.
Product exploration explored 100000 steps with 0 reset in 271 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 396 ms. Reduced automaton from 2 states, 7 edges and 2 AP to 2 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 297659 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 297659 steps, saw 67512 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 13 rows 18 cols
[2022-05-16 06:38:30] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:38:30] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 06:38:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 06:38:30] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 7 ms returned sat
[2022-05-16 06:38:31] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-16 06:38:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 06:38:31] [INFO ] After 58ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-16 06:38:31] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 76 ms.
[2022-05-16 06:38:31] [INFO ] After 310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 10000 ms.
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 18/18 places, 13/13 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 12
Applied a total of 1 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 12/13 (removed 1) transitions.
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 06:38:41] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:38:41] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 12/13 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 377298 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 377298 steps, saw 122455 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 06:38:44] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:38:44] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 06:38:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 06:38:44] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 9 ms returned sat
[2022-05-16 06:38:45] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-16 06:38:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 06:38:45] [INFO ] After 27ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-16 06:38:45] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-16 06:38:45] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 10000 ms.
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 12/12 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 06:38:55] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:38:55] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 06:38:55] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:38:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 06:38:55] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2022-05-16 06:38:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 06:38:55] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:38:55] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 06:38:55] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:38:55] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 06:38:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 06:38:55] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 6 ms returned sat
[2022-05-16 06:38:55] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-16 06:38:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 06:38:55] [INFO ] After 30ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-16 06:38:55] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-16 06:38:55] [INFO ] After 200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2022-05-16 06:38:55] [INFO ] Flatten gal took : 3 ms
[2022-05-16 06:38:55] [INFO ] Flatten gal took : 3 ms
[2022-05-16 06:38:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14834835057276579636.gal : 1 ms
[2022-05-16 06:38:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11050831081651074838.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16703682160614036931;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14834835057276579636.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11050831081651074838.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality11050831081651074838.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
[2022-05-16 06:38:55] [INFO ] Flatten gal took : 2 ms
[2022-05-16 06:38:55] [INFO ] Applying decomposition
[2022-05-16 06:38:55] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9593199611675313066.txt' '-o' '/tmp/graph9593199611675313066.bin' '-w' '/tmp/graph9593199611675313066.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9593199611675313066.bin' '-l' '-1' '-v' '-w' '/tmp/graph9593199611675313066.weights' '-q' '0' '-e' '0.001'
[2022-05-16 06:38:55] [INFO ] Decomposing Gal with order
[2022-05-16 06:38:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 06:38:55] [INFO ] Flatten gal took : 4 ms
[2022-05-16 06:38:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 06:38:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3958488702110371557.gal : 8 ms
[2022-05-16 06:38:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5799616345373388978.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16703682160614036931;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3958488702110371557.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5799616345373388978.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality5799616345373388978.prop.
ITS-tools command line returned an error code 1
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
Built C files in :
/tmp/ltsmin3523029082799114804
[2022-05-16 06:38:55] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3523029082799114804
Running compilation step : cd /tmp/ltsmin3523029082799114804;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 121 ms.
Running link step : cd /tmp/ltsmin3523029082799114804;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin3523029082799114804;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 428 ms. Reduced automaton from 2 states, 7 edges and 2 AP to 2 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 13/13 (removed 0) transitions.
// Phase 1: matrix 13 rows 18 cols
[2022-05-16 06:39:11] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:39:11] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
// Phase 1: matrix 13 rows 18 cols
[2022-05-16 06:39:11] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:39:11] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 13 rows 18 cols
[2022-05-16 06:39:11] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:39:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 06:39:11] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2022-05-16 06:39:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 18 cols
[2022-05-16 06:39:11] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:39:11] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 13/13 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 553 ms. Reduced automaton from 2 states, 7 edges and 2 AP to 2 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 431901 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 431901 steps, saw 116691 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 13 rows 18 cols
[2022-05-16 06:39:15] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:39:15] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 06:39:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 06:39:15] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 6 ms returned sat
[2022-05-16 06:39:16] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-16 06:39:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 06:39:16] [INFO ] After 42ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-16 06:39:16] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 67 ms.
[2022-05-16 06:39:16] [INFO ] After 250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 10000 ms.
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 18/18 places, 13/13 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 12
Applied a total of 1 rules in 9 ms. Remains 18 /18 variables (removed 0) and now considering 12/13 (removed 1) transitions.
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 06:39:26] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:39:26] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 12/13 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 408556 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 408556 steps, saw 137878 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 06:39:29] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:39:29] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 06:39:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 06:39:29] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 6 ms returned sat
[2022-05-16 06:39:29] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-16 06:39:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 06:39:30] [INFO ] After 28ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-16 06:39:30] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-16 06:39:30] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 10000 ms.
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 13 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 12/12 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 06:39:40] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:39:40] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 06:39:40] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:39:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 06:39:40] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2022-05-16 06:39:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 06:39:40] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:39:40] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 06:39:40] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:39:40] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 06:39:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 06:39:40] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 6 ms returned sat
[2022-05-16 06:39:40] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-16 06:39:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 06:39:40] [INFO ] After 32ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-16 06:39:40] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-16 06:39:40] [INFO ] After 204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2022-05-16 06:39:40] [INFO ] Flatten gal took : 3 ms
[2022-05-16 06:39:40] [INFO ] Flatten gal took : 1 ms
[2022-05-16 06:39:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10493396206672329909.gal : 2 ms
[2022-05-16 06:39:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13234887581602732912.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms15295181119069992831;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10493396206672329909.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13234887581602732912.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality13234887581602732912.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
[2022-05-16 06:39:40] [INFO ] Flatten gal took : 2 ms
[2022-05-16 06:39:40] [INFO ] Applying decomposition
[2022-05-16 06:39:40] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12945905613632591136.txt' '-o' '/tmp/graph12945905613632591136.bin' '-w' '/tmp/graph12945905613632591136.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12945905613632591136.bin' '-l' '-1' '-v' '-w' '/tmp/graph12945905613632591136.weights' '-q' '0' '-e' '0.001'
[2022-05-16 06:39:40] [INFO ] Decomposing Gal with order
[2022-05-16 06:39:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 06:39:40] [INFO ] Flatten gal took : 4 ms
[2022-05-16 06:39:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 06:39:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14689773066843009927.gal : 1 ms
[2022-05-16 06:39:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1211542487391083472.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms15295181119069992831;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14689773066843009927.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1211542487391083472.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality1211542487391083472.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
Built C files in :
/tmp/ltsmin12742394010649321744
[2022-05-16 06:39:40] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12742394010649321744
Running compilation step : cd /tmp/ltsmin12742394010649321744;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 114 ms.
Running link step : cd /tmp/ltsmin12742394010649321744;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12742394010649321744;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 432 ms. Reduced automaton from 2 states, 7 edges and 2 AP to 2 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 195 ms.
Product exploration explored 100000 steps with 0 reset in 219 ms.
Built C files in :
/tmp/ltsmin9268554485807594266
[2022-05-16 06:39:56] [INFO ] Computing symmetric may disable matrix : 13 transitions.
[2022-05-16 06:39:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:39:56] [INFO ] Computing symmetric may enable matrix : 13 transitions.
[2022-05-16 06:39:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:39:56] [INFO ] Computing Do-Not-Accords matrix : 13 transitions.
[2022-05-16 06:39:56] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:39:56] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9268554485807594266
Running compilation step : cd /tmp/ltsmin9268554485807594266;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 188 ms.
Running link step : cd /tmp/ltsmin9268554485807594266;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9268554485807594266;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13963138370766479336.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 13/13 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 13/13 (removed 0) transitions.
// Phase 1: matrix 13 rows 18 cols
[2022-05-16 06:40:11] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:40:11] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
// Phase 1: matrix 13 rows 18 cols
[2022-05-16 06:40:11] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:40:11] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 13 rows 18 cols
[2022-05-16 06:40:11] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:40:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 06:40:11] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2022-05-16 06:40:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 18 cols
[2022-05-16 06:40:11] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:40:12] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 13/13 transitions.
Built C files in :
/tmp/ltsmin8870685650757505310
[2022-05-16 06:40:12] [INFO ] Computing symmetric may disable matrix : 13 transitions.
[2022-05-16 06:40:12] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:40:12] [INFO ] Computing symmetric may enable matrix : 13 transitions.
[2022-05-16 06:40:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:40:12] [INFO ] Computing Do-Not-Accords matrix : 13 transitions.
[2022-05-16 06:40:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:40:12] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8870685650757505310
Running compilation step : cd /tmp/ltsmin8870685650757505310;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 101 ms.
Running link step : cd /tmp/ltsmin8870685650757505310;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin8870685650757505310;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17666915232547125627.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 06:40:27] [INFO ] Flatten gal took : 3 ms
[2022-05-16 06:40:27] [INFO ] Flatten gal took : 2 ms
[2022-05-16 06:40:27] [INFO ] Time to serialize gal into /tmp/LTL6589706267525376378.gal : 1 ms
[2022-05-16 06:40:27] [INFO ] Time to serialize properties into /tmp/LTL2545564502935405900.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6589706267525376378.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2545564502935405900.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6589706...266
Read 1 LTL properties
Checking formula 0 : !((F(G(("((b1<=NADPplus)||(Gluc<=start))")||((F(G(X("(NADPplus<=start)"))))&&("(NADPplus<=start)"))))))
Formula 0 simplified : !FG("((b1<=NADPplus)||(Gluc<=start))" | ("(NADPplus<=start)" & FGX"(NADPplus<=start)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2022-05-16 06:40:27] [INFO ] Flatten gal took : 2 ms
[2022-05-16 06:40:27] [INFO ] Applying decomposition
[2022-05-16 06:40:27] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15512419771477126868.txt' '-o' '/tmp/graph15512419771477126868.bin' '-w' '/tmp/graph15512419771477126868.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15512419771477126868.bin' '-l' '-1' '-v' '-w' '/tmp/graph15512419771477126868.weights' '-q' '0' '-e' '0.001'
[2022-05-16 06:40:27] [INFO ] Decomposing Gal with order
[2022-05-16 06:40:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 06:40:27] [INFO ] Flatten gal took : 3 ms
[2022-05-16 06:40:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 06:40:27] [INFO ] Time to serialize gal into /tmp/LTL10933345642833601265.gal : 1 ms
[2022-05-16 06:40:27] [INFO ] Time to serialize properties into /tmp/LTL9889920958177568158.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10933345642833601265.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9889920958177568158.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1093334...267
Read 1 LTL properties
Checking formula 0 : !((F(G(("((gu1.b1<=gu1.NADPplus)||(gu1.Gluc<=gu1.start))")||((F(G(X("(gu1.NADPplus<=gu1.start)"))))&&("(gu1.NADPplus<=gu1.start)")))))...156
Formula 0 simplified : !FG("((gu1.b1<=gu1.NADPplus)||(gu1.Gluc<=gu1.start))" | ("(gu1.NADPplus<=gu1.start)" & FGX"(gu1.NADPplus<=gu1.start)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin13875371754458485029
[2022-05-16 06:40:27] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13875371754458485029
Running compilation step : cd /tmp/ltsmin13875371754458485029;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 132 ms.
Running link step : cd /tmp/ltsmin13875371754458485029;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin13875371754458485029;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((<>([](X((LTLAPp1==true))))&&(LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-03 finished in 136496 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(p0))))'
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 06:40:42] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 06:40:42] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 06:40:42] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-16 06:40:42] [INFO ] Implicit Places using invariants in 56 ms returned [1, 2, 3, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 57 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 29/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 87 ms.
Product exploration explored 100000 steps with 33333 reset in 104 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 51 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-04 finished in 474 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((F(p0)||F(X(p1))||p2))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/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 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
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 4 place count 31 transition count 20
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 7 place count 29 transition count 19
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 10 place count 27 transition count 18
Applied a total of 10 rules in 10 ms. Remains 27 /33 variables (removed 6) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 27 cols
[2022-05-16 06:40:42] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 06:40:42] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
// Phase 1: matrix 18 rows 27 cols
[2022-05-16 06:40:42] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 06:40:42] [INFO ] Implicit Places using invariants in 42 ms returned [0, 1, 2, 15]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 43 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/33 places, 18/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 23 transition count 17
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 22 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 21 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 4 place count 21 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 9 place count 18 transition count 14
Applied a total of 9 rules in 6 ms. Remains 18 /23 variables (removed 5) and now considering 14/18 (removed 4) transitions.
// Phase 1: matrix 14 rows 18 cols
[2022-05-16 06:40:42] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 06:40:42] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2022-05-16 06:40:42] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 06:40:43] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/33 places, 14/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 18/33 places, 14/22 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ 2 s12), p0:(GT s10 s9), p1:(GT 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11207 reset in 116 ms.
Product exploration explored 100000 steps with 10493 reset in 163 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 288 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 62 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=62 )
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 18 cols
[2022-05-16 06:40:44] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:40:44] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
// Phase 1: matrix 14 rows 18 cols
[2022-05-16 06:40:44] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 06:40:44] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2022-05-16 06:40:44] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:40:44] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2022-05-16 06:40:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2022-05-16 06:40:44] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 06:40:44] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 14/14 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 47 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10930 reset in 100 ms.
Product exploration explored 100000 steps with 10684 reset in 183 ms.
Built C files in :
/tmp/ltsmin1960383602227565862
[2022-05-16 06:40:45] [INFO ] Computing symmetric may disable matrix : 14 transitions.
[2022-05-16 06:40:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:40:45] [INFO ] Computing symmetric may enable matrix : 14 transitions.
[2022-05-16 06:40:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:40:45] [INFO ] Computing Do-Not-Accords matrix : 14 transitions.
[2022-05-16 06:40:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:40:45] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1960383602227565862
Running compilation step : cd /tmp/ltsmin1960383602227565862;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 166 ms.
Running link step : cd /tmp/ltsmin1960383602227565862;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1960383602227565862;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased777063703517445752.hoa' '--buchi-type=spotba'
LTSmin run took 89 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-06 finished in 2829 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))||X(X(p0)))))'
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 06:40:45] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 06:40:45] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 06:40:45] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 06:40:45] [INFO ] Implicit Places using invariants in 53 ms returned [0, 1, 2, 3, 19]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 54 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/33 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.
Finished structural reductions, in 2 iterations. Remains : 28/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 1 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-09 finished in 269 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((X((!X(p1) U p1))||p2))&&p0)))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 06:40:45] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 06:40:46] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 06:40:46] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 06:40:46] [INFO ] Implicit Places using invariants in 63 ms returned [0, 1, 2, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 68 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 29/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GT s3 s21) (GT s24 s0)), p2:(LEQ 3 s0), p1:(LEQ s24 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4993 reset in 328 ms.
Stack based approach found an accepted trace after 23 steps with 1 reset with depth 7 and stack size 7 in 1 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-12 finished in 677 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 32 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 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
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 10 place count 27 transition count 17
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 13 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 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 15
Applied a total of 15 rules in 8 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2022-05-16 06:40:46] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 06:40:46] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
// Phase 1: matrix 15 rows 24 cols
[2022-05-16 06:40:46] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 06:40:46] [INFO ] Implicit Places using invariants in 76 ms returned [0, 1, 2, 3, 13]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 77 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/33 places, 15/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 19 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 17 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 17 transition count 12
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 16 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 14 transition count 10
Applied a total of 10 rules in 4 ms. Remains 14 /19 variables (removed 5) and now considering 10/15 (removed 5) transitions.
// Phase 1: matrix 10 rows 14 cols
[2022-05-16 06:40:46] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 06:40:46] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 10 rows 14 cols
[2022-05-16 06:40:46] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 06:40:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 06:40:46] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/33 places, 10/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 14/33 places, 10/22 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ 2 s11) (LEQ s2 s12))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-14 finished in 322 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(G(X(p1)))&&p1)||p0))))'
[2022-05-16 06:40:47] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin934374785884646826
[2022-05-16 06:40:47] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2022-05-16 06:40:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:40:47] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2022-05-16 06:40:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:40:47] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2022-05-16 06:40:47] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:40:47] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin934374785884646826
Running compilation step : cd /tmp/ltsmin934374785884646826;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 06:40:47] [INFO ] Applying decomposition
[2022-05-16 06:40:47] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6057800631101363799.txt' '-o' '/tmp/graph6057800631101363799.bin' '-w' '/tmp/graph6057800631101363799.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6057800631101363799.bin' '-l' '-1' '-v' '-w' '/tmp/graph6057800631101363799.weights' '-q' '0' '-e' '0.001'
[2022-05-16 06:40:47] [INFO ] Decomposing Gal with order
[2022-05-16 06:40:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 06:40:47] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-16 06:40:47] [INFO ] Flatten gal took : 9 ms
[2022-05-16 06:40:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 06:40:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality13122893462037524781.gal : 2 ms
[2022-05-16 06:40:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality13830225910564815015.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13122893462037524781.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13830225910564815015.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...290
Read 1 LTL properties
Checking formula 0 : !((F(G(("((gu2.b1<=gu2.NADPplus)||(gu2.Gluc<=gu2.start))")||((F(G(X("(gu2.NADPplus<=gu2.start)"))))&&("(gu2.NADPplus<=gu2.start)")))))...156
Formula 0 simplified : !FG("((gu2.b1<=gu2.NADPplus)||(gu2.Gluc<=gu2.start))" | ("(gu2.NADPplus<=gu2.start)" & FGX"(gu2.NADPplus<=gu2.start)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2022-05-16 06:40:47] [INFO ] Flatten gal took : 4 ms
[2022-05-16 06:40:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality3755330299631314850.gal : 2 ms
[2022-05-16 06:40:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality18257291338080784412.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3755330299631314850.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18257291338080784412.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((F(G(("((b1<=NADPplus)||(Gluc<=start))")||((F(G(X("(NADPplus<=start)"))))&&("(NADPplus<=start)"))))))
Formula 0 simplified : !FG("((b1<=NADPplus)||(Gluc<=start))" | ("(NADPplus<=start)" & FGX"(NADPplus<=start)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2022-05-16 06:40:47] [INFO ] Flatten gal took : 4 ms
[2022-05-16 06:40:47] [INFO ] Input system was already deterministic with 22 transitions.
[2022-05-16 06:40:47] [INFO ] Transformed 33 places.
[2022-05-16 06:40:47] [INFO ] Transformed 22 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 06:40:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality3476062451419417368.gal : 1 ms
[2022-05-16 06:40:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality11839734027542776228.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3476062451419417368.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11839734027542776228.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(("((b1<=NADPplus)||(Gluc<=start))")||((F(G(X("(NADPplus<=start)"))))&&("(NADPplus<=start)"))))))
Formula 0 simplified : !FG("((b1<=NADPplus)||(Gluc<=start))" | ("(NADPplus<=start)" & FGX"(NADPplus<=start)"))
terminate called after throwing an instance of 'char const*'
Compilation finished in 221 ms.
Running link step : cd /tmp/ltsmin934374785884646826;'gcc' '-shared' '-o' 'gal.so' 'model.o'
ITS-tools command line returned an error code 134
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin934374785884646826;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((<>([](X((LTLAPp1==true))))&&(LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
LTSmin run took 29828 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Total runtime 222243 ms.

BK_STOP 1652683277293

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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 r096-smll-165260575900203"
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 ;