fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r109-tall-171624208500437
Last Updated
July 7, 2024

About the Execution of 2023-gold for DES-PT-30a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6004.020 1214120.00 4155359.00 1005.00 FTFFFFTTFFFFFFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r109-tall-171624208500437.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DES-PT-30a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208500437
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 08:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 12 08:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 70K May 18 16:42 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 DES-PT-30a-LTLCardinality-00
FORMULA_NAME DES-PT-30a-LTLCardinality-01
FORMULA_NAME DES-PT-30a-LTLCardinality-02
FORMULA_NAME DES-PT-30a-LTLCardinality-03
FORMULA_NAME DES-PT-30a-LTLCardinality-04
FORMULA_NAME DES-PT-30a-LTLCardinality-05
FORMULA_NAME DES-PT-30a-LTLCardinality-06
FORMULA_NAME DES-PT-30a-LTLCardinality-07
FORMULA_NAME DES-PT-30a-LTLCardinality-08
FORMULA_NAME DES-PT-30a-LTLCardinality-09
FORMULA_NAME DES-PT-30a-LTLCardinality-10
FORMULA_NAME DES-PT-30a-LTLCardinality-11
FORMULA_NAME DES-PT-30a-LTLCardinality-12
FORMULA_NAME DES-PT-30a-LTLCardinality-13
FORMULA_NAME DES-PT-30a-LTLCardinality-14
FORMULA_NAME DES-PT-30a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716336871053

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 00:14:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:14:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:14:32] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2024-05-22 00:14:32] [INFO ] Transformed 234 places.
[2024-05-22 00:14:32] [INFO ] Transformed 191 transitions.
[2024-05-22 00:14:32] [INFO ] Found NUPN structural information;
[2024-05-22 00:14:32] [INFO ] Parsed PT model containing 234 places and 191 transitions and 926 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-30a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 233 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 233 transition count 176
Applied a total of 2 rules in 46 ms. Remains 233 /234 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 233 cols
[2024-05-22 00:14:33] [INFO ] Computed 59 invariants in 20 ms
[2024-05-22 00:14:33] [INFO ] Implicit Places using invariants in 286 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 532 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 232/234 places, 176/177 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 585 ms. Remains : 232/234 places, 176/177 transitions.
Support contains 29 out of 232 places after structural reductions.
[2024-05-22 00:14:33] [INFO ] Flatten gal took : 44 ms
[2024-05-22 00:14:33] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:14:33] [INFO ] Input system was already deterministic with 176 transitions.
Support contains 25 out of 232 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 224 resets, run finished after 442 ms. (steps per millisecond=22 ) properties (out of 12) seen :7
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 00:14:34] [INFO ] Computed 58 invariants in 12 ms
[2024-05-22 00:14:34] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2024-05-22 00:14:34] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-22 00:14:34] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 00:14:34] [INFO ] [Nat]Absence check using 32 positive place invariants in 15 ms returned sat
[2024-05-22 00:14:34] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 35 ms returned sat
[2024-05-22 00:14:34] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 00:14:34] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 4 ms to minimize.
[2024-05-22 00:14:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-22 00:14:35] [INFO ] After 749ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 359 ms.
[2024-05-22 00:14:35] [INFO ] After 1284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 3 properties in 114 ms.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 174
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 232 transition count 174
Applied a total of 8 rules in 23 ms. Remains 232 /232 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 232/232 places, 174/176 transitions.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1044780 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :{}
Probabilistic random walk after 1044780 steps, saw 147256 distinct states, run finished after 3003 ms. (steps per millisecond=347 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 174 rows 232 cols
[2024-05-22 00:14:38] [INFO ] Computed 60 invariants in 17 ms
[2024-05-22 00:14:39] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 00:14:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 00:14:39] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 80 ms returned sat
[2024-05-22 00:14:39] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 00:14:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:14:39] [INFO ] After 57ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 00:14:39] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:14:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-05-22 00:14:39] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-22 00:14:39] [INFO ] After 581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 60 ms.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-22 00:14:39] [INFO ] Invariant cache hit.
[2024-05-22 00:14:39] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-22 00:14:39] [INFO ] Invariant cache hit.
[2024-05-22 00:14:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:14:40] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2024-05-22 00:14:40] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-22 00:14:40] [INFO ] Invariant cache hit.
[2024-05-22 00:14:40] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 665 ms. Remains : 232/232 places, 174/174 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 174
Applied a total of 1 rules in 18 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 174 rows 232 cols
[2024-05-22 00:14:40] [INFO ] Computed 60 invariants in 10 ms
[2024-05-22 00:14:40] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 00:14:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:14:40] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 81 ms returned sat
[2024-05-22 00:14:40] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 00:14:40] [INFO ] After 276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-05-22 00:14:40] [INFO ] After 493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Computed a total of 135 stabilizing places and 130 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 9 ms. Remains 231 /232 variables (removed 1) and now considering 175/176 (removed 1) transitions.
// Phase 1: matrix 175 rows 231 cols
[2024-05-22 00:14:41] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 00:14:41] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-22 00:14:41] [INFO ] Invariant cache hit.
[2024-05-22 00:14:41] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2024-05-22 00:14:41] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-22 00:14:41] [INFO ] Invariant cache hit.
[2024-05-22 00:14:41] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 474 ms. Remains : 231/232 places, 175/176 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 141 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-30a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s120 0) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 2 ms.
FORMULA DES-PT-30a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLCardinality-00 finished in 665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 00:14:41] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 00:14:41] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-22 00:14:41] [INFO ] Invariant cache hit.
[2024-05-22 00:14:42] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2024-05-22 00:14:42] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:14:42] [INFO ] Invariant cache hit.
[2024-05-22 00:14:42] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 497 ms. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-30a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s125 0) (EQ s186 1)) (OR (EQ s147 0) (EQ s22 1)) (OR (EQ s147 0) (EQ s22 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 2 ms.
FORMULA DES-PT-30a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLCardinality-02 finished in 550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p0&&X((!p0 U (!p1||G(!p0))))) U (G((!p0&&X((!p0 U (!p1||G(!p0))))))||(!p0&&X(((!p0 U (!p1||G(!p0)))&&X(p2)))))))))'
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-22 00:14:42] [INFO ] Invariant cache hit.
[2024-05-22 00:14:42] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-22 00:14:42] [INFO ] Invariant cache hit.
[2024-05-22 00:14:42] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-05-22 00:14:42] [INFO ] Invariant cache hit.
[2024-05-22 00:14:42] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 454 ms. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 317 ms :[p0, p0, (AND p0 p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : DES-PT-30a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 2}, { cond=(NOT p0), acceptance={1} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 4}, { cond=(NOT p0), acceptance={1} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 6}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 6}], [{ cond=(AND p0 (NOT p2)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=6 dest: 3}]], initial=0, aps=[p0:(OR (EQ s113 0) (EQ s153 1)), p1:(OR (EQ s27 0) (EQ s45 1)), p2:(NEQ s131 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA DES-PT-30a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLCardinality-03 finished in 803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 14 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-22 00:14:43] [INFO ] Invariant cache hit.
[2024-05-22 00:14:43] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-22 00:14:43] [INFO ] Invariant cache hit.
[2024-05-22 00:14:43] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-05-22 00:14:43] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:14:43] [INFO ] Invariant cache hit.
[2024-05-22 00:14:43] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 499 ms. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30a-LTLCardinality-04 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 (NEQ s206 0) (NEQ s222 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6280 reset in 300 ms.
Product exploration explored 100000 steps with 6314 reset in 273 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2024-05-22 00:14:44] [INFO ] Invariant cache hit.
[2024-05-22 00:14:44] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2024-05-22 00:14:44] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 24 ms returned sat
[2024-05-22 00:14:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:14:45] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2024-05-22 00:14:45] [INFO ] Computed and/alt/rep : 168/504/168 causal constraints (skipped 7 transitions) in 11 ms.
[2024-05-22 00:14:45] [INFO ] Added : 0 causal constraints over 0 iterations in 41 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-22 00:14:45] [INFO ] Invariant cache hit.
[2024-05-22 00:14:45] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-22 00:14:45] [INFO ] Invariant cache hit.
[2024-05-22 00:14:45] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-05-22 00:14:45] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:14:45] [INFO ] Invariant cache hit.
[2024-05-22 00:14:45] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 486 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-05-22 00:14:46] [INFO ] Invariant cache hit.
[2024-05-22 00:14:46] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2024-05-22 00:14:46] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 25 ms returned sat
[2024-05-22 00:14:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:14:46] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2024-05-22 00:14:46] [INFO ] Computed and/alt/rep : 168/504/168 causal constraints (skipped 7 transitions) in 11 ms.
[2024-05-22 00:14:46] [INFO ] Added : 0 causal constraints over 0 iterations in 40 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6392 reset in 213 ms.
Product exploration explored 100000 steps with 6309 reset in 241 ms.
Built C files in :
/tmp/ltsmin4103213178474086110
[2024-05-22 00:14:47] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2024-05-22 00:14:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:14:47] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2024-05-22 00:14:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:14:47] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2024-05-22 00:14:47] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:14:47] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4103213178474086110
Running compilation step : cd /tmp/ltsmin4103213178474086110;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 485 ms.
Running link step : cd /tmp/ltsmin4103213178474086110;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin4103213178474086110;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18364987481030304998.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-22 00:15:02] [INFO ] Invariant cache hit.
[2024-05-22 00:15:02] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-22 00:15:02] [INFO ] Invariant cache hit.
[2024-05-22 00:15:02] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-05-22 00:15:02] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:15:02] [INFO ] Invariant cache hit.
[2024-05-22 00:15:02] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 501 ms. Remains : 232/232 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin8537723088514552513
[2024-05-22 00:15:02] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2024-05-22 00:15:02] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:15:02] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2024-05-22 00:15:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:15:02] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2024-05-22 00:15:02] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:15:02] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8537723088514552513
Running compilation step : cd /tmp/ltsmin8537723088514552513;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 383 ms.
Running link step : cd /tmp/ltsmin8537723088514552513;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8537723088514552513;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17730289567589587863.hoa' '--buchi-type=spotba'
LTSmin run took 11522 ms.
FORMULA DES-PT-30a-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-30a-LTLCardinality-04 finished in 31687 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U ((X(p0)&&G(!p1))||X(G(p0))))))'
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-22 00:15:14] [INFO ] Invariant cache hit.
[2024-05-22 00:15:14] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-22 00:15:14] [INFO ] Invariant cache hit.
[2024-05-22 00:15:15] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-05-22 00:15:15] [INFO ] Invariant cache hit.
[2024-05-22 00:15:15] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 470 ms. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 246 ms :[true, (AND p1 (NOT p0)), p1, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 5}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 5}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 1}, { cond=(AND p1 p0), acceptance={} source=6 dest: 5}]], initial=3, aps=[p1:(OR (EQ s132 0) (EQ s200 1)), p0:(OR (EQ s36 0) (EQ s168 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2219 reset in 238 ms.
Product exploration explored 100000 steps with 2229 reset in 220 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 78 ms. Reduced automaton from 7 states, 16 edges and 2 AP (stutter sensitive) to 7 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 209 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 00:15:16] [INFO ] Invariant cache hit.
[2024-05-22 00:15:16] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:15:16] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2024-05-22 00:15:16] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 37 ms returned sat
[2024-05-22 00:15:17] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:15:17] [INFO ] After 485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 145 ms.
[2024-05-22 00:15:17] [INFO ] After 779ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 90 ms.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 174
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 232 transition count 174
Applied a total of 8 rules in 19 ms. Remains 232 /232 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 232/232 places, 174/176 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1651449 steps, run timeout after 3001 ms. (steps per millisecond=550 ) properties seen :{}
Probabilistic random walk after 1651449 steps, saw 231557 distinct states, run finished after 3001 ms. (steps per millisecond=550 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 232 cols
[2024-05-22 00:15:20] [INFO ] Computed 60 invariants in 5 ms
[2024-05-22 00:15:20] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:15:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:15:20] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 79 ms returned sat
[2024-05-22 00:15:21] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:15:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:15:21] [INFO ] After 39ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:15:21] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-22 00:15:21] [INFO ] After 512ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 10 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 7 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-22 00:15:21] [INFO ] Invariant cache hit.
[2024-05-22 00:15:21] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-22 00:15:21] [INFO ] Invariant cache hit.
[2024-05-22 00:15:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:15:21] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2024-05-22 00:15:21] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:15:21] [INFO ] Invariant cache hit.
[2024-05-22 00:15:21] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 591 ms. Remains : 232/232 places, 174/174 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 174
Applied a total of 1 rules in 11 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 232 cols
[2024-05-22 00:15:21] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 00:15:21] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:15:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:15:22] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 81 ms returned sat
[2024-05-22 00:15:22] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:15:22] [INFO ] After 270ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-22 00:15:22] [INFO ] After 444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND (NOT p1) p0)), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 7 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 00:15:23] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 00:15:23] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-22 00:15:23] [INFO ] Invariant cache hit.
[2024-05-22 00:15:23] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2024-05-22 00:15:23] [INFO ] Invariant cache hit.
[2024-05-22 00:15:23] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 529 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 7 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 223 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 00:15:24] [INFO ] Invariant cache hit.
[2024-05-22 00:15:24] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:15:24] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2024-05-22 00:15:24] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 39 ms returned sat
[2024-05-22 00:15:24] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:15:24] [INFO ] After 491ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 147 ms.
[2024-05-22 00:15:25] [INFO ] After 773ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 82 ms.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 174
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 232 transition count 174
Applied a total of 8 rules in 24 ms. Remains 232 /232 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 232/232 places, 174/176 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1707351 steps, run timeout after 3001 ms. (steps per millisecond=568 ) properties seen :{}
Probabilistic random walk after 1707351 steps, saw 239125 distinct states, run finished after 3001 ms. (steps per millisecond=568 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 232 cols
[2024-05-22 00:15:28] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 00:15:28] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:15:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:15:28] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 84 ms returned sat
[2024-05-22 00:15:28] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:15:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:15:28] [INFO ] After 27ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:15:28] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-22 00:15:28] [INFO ] After 500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-22 00:15:28] [INFO ] Invariant cache hit.
[2024-05-22 00:15:28] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-22 00:15:28] [INFO ] Invariant cache hit.
[2024-05-22 00:15:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:15:29] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2024-05-22 00:15:29] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:15:29] [INFO ] Invariant cache hit.
[2024-05-22 00:15:29] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 525 ms. Remains : 232/232 places, 174/174 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 174
Applied a total of 1 rules in 10 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 232 cols
[2024-05-22 00:15:29] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 00:15:29] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:15:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:15:29] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 80 ms returned sat
[2024-05-22 00:15:29] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:15:29] [INFO ] After 275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-22 00:15:29] [INFO ] After 434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND (NOT p1) p0)), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 7 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 350 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 239 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 233 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2221 reset in 215 ms.
Product exploration explored 100000 steps with 2245 reset in 235 ms.
Applying partial POR strategy [true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 244 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-22 00:15:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 00:15:31] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 00:15:31] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 232/232 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin12736491677215720877
[2024-05-22 00:15:31] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12736491677215720877
Running compilation step : cd /tmp/ltsmin12736491677215720877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 336 ms.
Running link step : cd /tmp/ltsmin12736491677215720877;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12736491677215720877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15754652999975777003.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 20 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-22 00:15:46] [INFO ] Invariant cache hit.
[2024-05-22 00:15:47] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-22 00:15:47] [INFO ] Invariant cache hit.
[2024-05-22 00:15:47] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-05-22 00:15:47] [INFO ] Invariant cache hit.
[2024-05-22 00:15:47] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 482 ms. Remains : 232/232 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin2111956195771145935
[2024-05-22 00:15:47] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2111956195771145935
Running compilation step : cd /tmp/ltsmin2111956195771145935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 332 ms.
Running link step : cd /tmp/ltsmin2111956195771145935;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2111956195771145935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9692580404270599873.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:16:02] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:16:02] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:16:02] [INFO ] Time to serialize gal into /tmp/LTL16166169575827086539.gal : 8 ms
[2024-05-22 00:16:02] [INFO ] Time to serialize properties into /tmp/LTL10046858681535469117.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16166169575827086539.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3637917925010718489.hoa' '-atoms' '/tmp/LTL10046858681535469117.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10046858681535469117.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3637917925010718489.hoa
Detected timeout of ITS tools.
[2024-05-22 00:16:17] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:16:17] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:16:17] [INFO ] Time to serialize gal into /tmp/LTL13814689791601322594.gal : 2 ms
[2024-05-22 00:16:17] [INFO ] Time to serialize properties into /tmp/LTL1199751126897757788.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13814689791601322594.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1199751126897757788.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((X("((p36==0)||(p169==1))"))U((X(G("((p36==0)||(p169==1))")))||((X("((p36==0)||(p169==1))"))&&(G(!("((p133==0)||(p201==1))"))))))...157
Formula 0 simplified : X(X!"((p36==0)||(p169==1))" R (XF!"((p36==0)||(p169==1))" & (X!"((p36==0)||(p169==1))" | F"((p133==0)||(p201==1))")))
Detected timeout of ITS tools.
[2024-05-22 00:16:32] [INFO ] Flatten gal took : 18 ms
[2024-05-22 00:16:32] [INFO ] Applying decomposition
[2024-05-22 00:16:32] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11407150947574466634.txt' '-o' '/tmp/graph11407150947574466634.bin' '-w' '/tmp/graph11407150947574466634.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11407150947574466634.bin' '-l' '-1' '-v' '-w' '/tmp/graph11407150947574466634.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:16:32] [INFO ] Decomposing Gal with order
[2024-05-22 00:16:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:16:33] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-22 00:16:33] [INFO ] Flatten gal took : 52 ms
[2024-05-22 00:16:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-22 00:16:33] [INFO ] Time to serialize gal into /tmp/LTL6204308869232731304.gal : 22 ms
[2024-05-22 00:16:33] [INFO ] Time to serialize properties into /tmp/LTL8150399608841031013.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6204308869232731304.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8150399608841031013.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((X("((u48.p36==0)||(i10.u22.p169==1))"))U((X(G("((u48.p36==0)||(i10.u22.p169==1))")))||((X("((u48.p36==0)||(i10.u22.p169==1))"))&...210
Formula 0 simplified : X(X!"((u48.p36==0)||(i10.u22.p169==1))" R (XF!"((u48.p36==0)||(i10.u22.p169==1))" & (X!"((u48.p36==0)||(i10.u22.p169==1))" | F"((i0....193
Reverse transition relation is NOT exact ! Due to transitions t1, t136, t137, t169, u13.t129, u14.t11, u48.t5, u48.t40, i0.i0.u0.t10, i0.i0.u6.t174, i0.i1....629
Computing Next relation with stutter on 1.99965e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3669262314575313867
[2024-05-22 00:16:48] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3669262314575313867
Running compilation step : cd /tmp/ltsmin3669262314575313867;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 314 ms.
Running link step : cd /tmp/ltsmin3669262314575313867;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3669262314575313867;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X((LTLAPp0==true)) U (X([]((LTLAPp0==true)))||(X((LTLAPp0==true))&&[](!(LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-30a-LTLCardinality-09 finished in 108437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-22 00:17:03] [INFO ] Invariant cache hit.
[2024-05-22 00:17:03] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-22 00:17:03] [INFO ] Invariant cache hit.
[2024-05-22 00:17:03] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2024-05-22 00:17:03] [INFO ] Invariant cache hit.
[2024-05-22 00:17:03] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 514 ms. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DES-PT-30a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s182 0) (EQ s156 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA DES-PT-30a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLCardinality-12 finished in 648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-22 00:17:03] [INFO ] Invariant cache hit.
[2024-05-22 00:17:04] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-22 00:17:04] [INFO ] Invariant cache hit.
[2024-05-22 00:17:04] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-05-22 00:17:04] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:17:04] [INFO ] Invariant cache hit.
[2024-05-22 00:17:04] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 458 ms. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-30a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s49 0) (EQ s2 1)), p0:(OR (EQ s1 0) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLCardinality-13 finished in 551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-22 00:17:04] [INFO ] Invariant cache hit.
[2024-05-22 00:17:04] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-22 00:17:04] [INFO ] Invariant cache hit.
[2024-05-22 00:17:04] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2024-05-22 00:17:04] [INFO ] Invariant cache hit.
[2024-05-22 00:17:04] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 487 ms. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DES-PT-30a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s216 0) (EQ s197 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 343 ms.
Product exploration explored 100000 steps with 50000 reset in 327 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-30a-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-30a-LTLCardinality-14 finished in 1297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U ((X(p0)&&G(!p1))||X(G(p0))))))'
[2024-05-22 00:17:05] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
[2024-05-22 00:17:05] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin4865010615439996310
[2024-05-22 00:17:05] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2024-05-22 00:17:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:17:05] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2024-05-22 00:17:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:17:05] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2024-05-22 00:17:05] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:17:05] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:17:05] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4865010615439996310
Running compilation step : cd /tmp/ltsmin4865010615439996310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6963105674619632034.txt' '-o' '/tmp/graph6963105674619632034.bin' '-w' '/tmp/graph6963105674619632034.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6963105674619632034.bin' '-l' '-1' '-v' '-w' '/tmp/graph6963105674619632034.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:17:06] [INFO ] Decomposing Gal with order
[2024-05-22 00:17:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:17:06] [INFO ] Removed a total of 38 redundant transitions.
[2024-05-22 00:17:06] [INFO ] Flatten gal took : 45 ms
[2024-05-22 00:17:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 6 ms.
[2024-05-22 00:17:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality16333628268061970691.gal : 2 ms
[2024-05-22 00:17:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality17210399292182334257.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16333628268061970691.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17210399292182334257.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X((X("((u49.p36==0)||(i6.u23.p169==1))"))U(((X("((u49.p36==0)||(i6.u23.p169==1))"))&&(G(!("((i1.i0.u5.p133==0)||(i6.u39.p201==1))")...206
Formula 0 simplified : X(X!"((u49.p36==0)||(i6.u23.p169==1))" R (XF!"((u49.p36==0)||(i6.u23.p169==1))" & (X!"((u49.p36==0)||(i6.u23.p169==1))" | F"((i1.i0....189
Compilation finished in 500 ms.
Running link step : cd /tmp/ltsmin4865010615439996310;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin4865010615439996310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X((LTLAPp0==true)) U ((X((LTLAPp0==true))&&[](!(LTLAPp1==true)))||X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t136, t137, t169, u13.t129, u49.t5, u49.t40, i0.u2.t8, i0.u2.t70, i0.u2.t74, i0.u2.t75, i...628
Computing Next relation with stutter on 1.99965e+06 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: LTL layer: formula: X((X((LTLAPp0==true)) U ((X((LTLAPp0==true))&&[](!(LTLAPp1==true)))||X([]((LTLAPp0==true))))))
pins2lts-mc-linux64( 5/ 8), 0.003: "X((X((LTLAPp0==true)) U ((X((LTLAPp0==true))&&[](!(LTLAPp1==true)))||X([]((LTLAPp0==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.027: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.074: DFS-FIFO for weak LTL, using special progress label 179
pins2lts-mc-linux64( 0/ 8), 0.074: There are 180 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.074: State length is 233, there are 192 groups
pins2lts-mc-linux64( 0/ 8), 0.074: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.074: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.074: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.074: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.503: ~1 levels ~960 states ~5208 transitions
pins2lts-mc-linux64( 5/ 8), 0.510: ~1 levels ~1920 states ~9312 transitions
pins2lts-mc-linux64( 5/ 8), 0.755: ~1 levels ~3840 states ~18848 transitions
pins2lts-mc-linux64( 2/ 8), 0.887: ~1 levels ~7680 states ~46224 transitions
pins2lts-mc-linux64( 4/ 8), 1.125: ~1 levels ~15360 states ~81120 transitions
pins2lts-mc-linux64( 4/ 8), 1.592: ~1 levels ~30720 states ~180824 transitions
pins2lts-mc-linux64( 0/ 8), 2.898: ~1 levels ~61440 states ~361032 transitions
pins2lts-mc-linux64( 0/ 8), 4.449: ~1 levels ~122880 states ~676152 transitions
pins2lts-mc-linux64( 0/ 8), 8.355: ~1 levels ~245760 states ~1292168 transitions
pins2lts-mc-linux64( 7/ 8), 15.400: ~1 levels ~491520 states ~3392472 transitions
pins2lts-mc-linux64( 3/ 8), 27.843: ~1 levels ~983040 states ~9468456 transitions
pins2lts-mc-linux64( 7/ 8), 38.687: ~1 levels ~1966080 states ~20062264 transitions
pins2lts-mc-linux64( 3/ 8), 58.103: ~1 levels ~3932160 states ~42918088 transitions
pins2lts-mc-linux64( 3/ 8), 98.587: ~1 levels ~7864320 states ~89513632 transitions
pins2lts-mc-linux64( 7/ 8), 164.234: ~1 levels ~15728640 states ~171428528 transitions
pins2lts-mc-linux64( 3/ 8), 292.118: ~1 levels ~31457280 states ~331886528 transitions
pins2lts-mc-linux64( 3/ 8), 519.451: ~1 levels ~62914560 states ~640578272 transitions
pins2lts-mc-linux64( 4/ 8), 903.899: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 903.957:
pins2lts-mc-linux64( 0/ 8), 903.957: mean standard work distribution: 3.3% (states) 1.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 903.957:
pins2lts-mc-linux64( 0/ 8), 903.957: Explored 103931389 states 1123516426 transitions, fanout: 10.810
pins2lts-mc-linux64( 0/ 8), 903.957: Total exploration time 903.850 sec (903.770 sec minimum, 903.814 sec on average)
pins2lts-mc-linux64( 0/ 8), 903.957: States per second: 114987, Transitions per second: 1243034
pins2lts-mc-linux64( 0/ 8), 903.957:
pins2lts-mc-linux64( 0/ 8), 903.957: Progress states detected: 134217146
pins2lts-mc-linux64( 0/ 8), 903.957: Redundant explorations: -22.5648
pins2lts-mc-linux64( 0/ 8), 903.957:
pins2lts-mc-linux64( 0/ 8), 903.957: Queue width: 8B, total height: 62826143, memory: 479.33MB
pins2lts-mc-linux64( 0/ 8), 903.957: Tree memory: 1030.2MB, 8.0 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 903.957: Tree fill ratio (roots/leafs): 99.0%/2.0%
pins2lts-mc-linux64( 0/ 8), 903.957: Stored 176 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 903.957: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 903.957: Est. total memory use: 1509.5MB (~1503.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4865010615439996310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X((LTLAPp0==true)) U ((X((LTLAPp0==true))&&[](!(LTLAPp1==true)))||X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4865010615439996310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X((LTLAPp0==true)) U ((X((LTLAPp0==true))&&[](!(LTLAPp1==true)))||X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
28648 unique states visited
1094 strongly connected components in search stack
31953 transitions explored
1142 items max in DFS search stack
55373 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,553.766,5332868,1,0,1.00155e+07,58346,934,9.95146e+06,930,339943,3385
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DES-PT-30a-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1211813 ms.

BK_STOP 1716338085173

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="DES-PT-30a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is DES-PT-30a, 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 r109-tall-171624208500437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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