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.r263-tall-171654372200162.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 Murphy-COL-D2N100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372200162
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.6K Apr 11 22:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 22:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 11 22:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 11 22:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 6 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 6 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 6 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 6 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 23:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 23:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 11 23:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 23:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 20K May 18 16:43 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 Murphy-COL-D2N100-LTLCardinality-00
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-01
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-02
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-03
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-04
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-05
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-06
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-07
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-08
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-09
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-10
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-11
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-12
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-13
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-14
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716671552999

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=Murphy-COL-D2N100
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-25 21:12:34] [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-25 21:12:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 21:12:34] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 21:12:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 21:12:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 635 ms
[2024-05-25 21:12:35] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 18 PT places and 21.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 21:12:35] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 6 ms.
[2024-05-25 21:12:35] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Murphy-COL-D2N100-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D2N100-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10198 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=242 ) properties (out of 20) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 7 rows 6 cols
[2024-05-25 21:12:35] [INFO ] Computed 2 invariants in 2 ms
[2024-05-25 21:12:35] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-25 21:12:35] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 21:12:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 21:12:35] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA Murphy-COL-D2N100-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 21:12:35] [INFO ] Flatten gal took : 12 ms
[2024-05-25 21:12:35] [INFO ] Flatten gal took : 2 ms
Arc [2:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2024-05-25 21:12:35] [INFO ] Unfolded HLPN to a Petri net with 18 places and 21 transitions 81 arcs in 5 ms.
[2024-05-25 21:12:35] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 5 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2024-05-25 21:12:35] [INFO ] Computed 4 invariants in 1 ms
[2024-05-25 21:12:35] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2024-05-25 21:12:35] [INFO ] Invariant cache hit.
[2024-05-25 21:12:35] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-25 21:12:35] [INFO ] Invariant cache hit.
[2024-05-25 21:12:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 21:12:36] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-25 21:12:36] [INFO ] Invariant cache hit.
[2024-05-25 21:12:36] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 18/18 places, 21/21 transitions.
Support contains 18 out of 18 places after structural reductions.
[2024-05-25 21:12:36] [INFO ] Flatten gal took : 25 ms
[2024-05-25 21:12:36] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:12:36] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 10044 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=772 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 21:12:36] [INFO ] Invariant cache hit.
[2024-05-25 21:12:36] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 21:12:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 30 ms returned sat
[2024-05-25 21:12:36] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-25 21:12:36] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 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' '!(G((G(p0)||F(p1))))'
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 5 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 21:12:36] [INFO ] Invariant cache hit.
[2024-05-25 21:12:36] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2024-05-25 21:12:36] [INFO ] Invariant cache hit.
[2024-05-25 21:12:36] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-25 21:12:36] [INFO ] Invariant cache hit.
[2024-05-25 21:12:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 21:12:36] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-25 21:12:36] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 21:12:36] [INFO ] Invariant cache hit.
[2024-05-25 21:12:36] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 18/18 places, 21/21 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 207 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LEQ (ADD s3 s4 s5) (ADD s6 s7 s8)) (LEQ 1 (ADD s3 s4 s5))) (LEQ 1 (ADD s3 s4 s5))), p1:(GT (ADD s6 s7 s8) (ADD s15 s16 s17))], 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 0 reset in 285 ms.
Product exploration explored 100000 steps with 0 reset in 371 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 p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10054 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=591 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 21:12:37] [INFO ] Invariant cache hit.
[2024-05-25 21:12:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:12:38] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 21:12:38] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 21:12:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 21:12:38] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 21:12:38] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 21:12:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 21:12:38] [INFO ] After 8ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 21:12:38] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-25 21:12:38] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 21:12:38] [INFO ] Invariant cache hit.
[2024-05-25 21:12:38] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2259191 steps, run timeout after 3001 ms. (steps per millisecond=752 ) properties seen :{}
Probabilistic random walk after 2259191 steps, saw 1457292 distinct states, run finished after 3003 ms. (steps per millisecond=752 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 21:12:41] [INFO ] Invariant cache hit.
[2024-05-25 21:12:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:12:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 21:12:41] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 21:12:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:12:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 21:12:41] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 21:12:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 21:12:41] [INFO ] After 6ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 21:12:41] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-25 21:12:41] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 21:12:41] [INFO ] Invariant cache hit.
[2024-05-25 21:12:41] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 21:12:41] [INFO ] Invariant cache hit.
[2024-05-25 21:12:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 21:12:41] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-25 21:12:41] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 21:12:41] [INFO ] Invariant cache hit.
[2024-05-25 21:12:41] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-25 21:12:41] [INFO ] Invariant cache hit.
[2024-05-25 21:12:41] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 21:12:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 21:12:41] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 21:12:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 21:12:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 21:12:41] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 21:12:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 21:12:41] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 21:12:41] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-25 21:12:41] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 21:12:41] [INFO ] Invariant cache hit.
[2024-05-25 21:12:41] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2024-05-25 21:12:41] [INFO ] Invariant cache hit.
[2024-05-25 21:12:41] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-25 21:12:41] [INFO ] Invariant cache hit.
[2024-05-25 21:12:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 21:12:41] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-25 21:12:41] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 21:12:41] [INFO ] Invariant cache hit.
[2024-05-25 21:12:41] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 18/18 places, 21/21 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 p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10038 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1115 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 21:12:42] [INFO ] Invariant cache hit.
[2024-05-25 21:12:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:12:42] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 21:12:42] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 21:12:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:12:42] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 21:12:42] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 21:12:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 21:12:42] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 21:12:42] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-25 21:12:42] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 21:12:42] [INFO ] Invariant cache hit.
[2024-05-25 21:12:42] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10075 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2015 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2227265 steps, run timeout after 3001 ms. (steps per millisecond=742 ) properties seen :{}
Probabilistic random walk after 2227265 steps, saw 1436147 distinct states, run finished after 3001 ms. (steps per millisecond=742 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 21:12:45] [INFO ] Invariant cache hit.
[2024-05-25 21:12:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:12:45] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 21:12:45] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 21:12:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:12:45] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 21:12:45] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 21:12:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 21:12:45] [INFO ] After 7ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 21:12:45] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-25 21:12:45] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 21:12:45] [INFO ] Invariant cache hit.
[2024-05-25 21:12:45] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 21:12:45] [INFO ] Invariant cache hit.
[2024-05-25 21:12:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 21:12:45] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-25 21:12:45] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 21:12:45] [INFO ] Invariant cache hit.
[2024-05-25 21:12:45] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-25 21:12:45] [INFO ] Invariant cache hit.
[2024-05-25 21:12:45] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 21:12:45] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 21:12:45] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 21:12:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2024-05-25 21:12:45] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 21:12:45] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 21:12:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 21:12:45] [INFO ] After 7ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 21:12:45] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-25 21:12:45] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 172 ms.
Product exploration explored 100000 steps with 0 reset in 193 ms.
Built C files in :
/tmp/ltsmin9668230390777146018
[2024-05-25 21:12:46] [INFO ] Computing symmetric may disable matrix : 21 transitions.
[2024-05-25 21:12:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:12:46] [INFO ] Computing symmetric may enable matrix : 21 transitions.
[2024-05-25 21:12:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:12:46] [INFO ] Computing Do-Not-Accords matrix : 21 transitions.
[2024-05-25 21:12:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:12:46] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9668230390777146018
Running compilation step : cd /tmp/ltsmin9668230390777146018;'/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 323 ms.
Running link step : cd /tmp/ltsmin9668230390777146018;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin9668230390777146018;'/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/stateBased14584904503314718015.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 4 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 21:13:01] [INFO ] Invariant cache hit.
[2024-05-25 21:13:01] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2024-05-25 21:13:01] [INFO ] Invariant cache hit.
[2024-05-25 21:13:01] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-25 21:13:01] [INFO ] Invariant cache hit.
[2024-05-25 21:13:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 21:13:01] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-25 21:13:01] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 21:13:01] [INFO ] Invariant cache hit.
[2024-05-25 21:13:01] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 18/18 places, 21/21 transitions.
Built C files in :
/tmp/ltsmin17319161151114971369
[2024-05-25 21:13:01] [INFO ] Computing symmetric may disable matrix : 21 transitions.
[2024-05-25 21:13:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:13:01] [INFO ] Computing symmetric may enable matrix : 21 transitions.
[2024-05-25 21:13:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:13:01] [INFO ] Computing Do-Not-Accords matrix : 21 transitions.
[2024-05-25 21:13:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:13:01] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17319161151114971369
Running compilation step : cd /tmp/ltsmin17319161151114971369;'/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 111 ms.
Running link step : cd /tmp/ltsmin17319161151114971369;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17319161151114971369;'/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/stateBased18350798380978216849.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 21:13:16] [INFO ] Flatten gal took : 6 ms
[2024-05-25 21:13:16] [INFO ] Flatten gal took : 2 ms
[2024-05-25 21:13:16] [INFO ] Time to serialize gal into /tmp/LTL12023873673207751268.gal : 1 ms
[2024-05-25 21:13:16] [INFO ] Time to serialize properties into /tmp/LTL15989726253113320615.prop : 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/LTL12023873673207751268.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7703788736904492108.hoa' '-atoms' '/tmp/LTL15989726253113320615.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/LTL15989726253113320615.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7703788736904492108.hoa
Detected timeout of ITS tools.
[2024-05-25 21:13:32] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:13:32] [INFO ] Flatten gal took : 2 ms
[2024-05-25 21:13:32] [INFO ] Time to serialize gal into /tmp/LTL14798554202315686430.gal : 1 ms
[2024-05-25 21:13:32] [INFO ] Time to serialize properties into /tmp/LTL758917544770203027.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/LTL14798554202315686430.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL758917544770203027.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...275
Read 1 LTL properties
Checking formula 0 : !((G((G("(((((p1_0+p1_1)+p1_2)<=((p2_0+p2_1)+p2_2))||(((p1_0+p1_1)+p1_2)>=1))&&(((p1_0+p1_1)+p1_2)>=1))"))||(F("(((p2_0+p2_1)+p2_2)>((...178
Formula 0 simplified : F(F!"(((((p1_0+p1_1)+p1_2)<=((p2_0+p2_1)+p2_2))||(((p1_0+p1_1)+p1_2)>=1))&&(((p1_0+p1_1)+p1_2)>=1))" & G!"(((p2_0+p2_1)+p2_2)>((p5_0...170
Detected timeout of ITS tools.
[2024-05-25 21:13:47] [INFO ] Flatten gal took : 7 ms
[2024-05-25 21:13:47] [INFO ] Applying decomposition
[2024-05-25 21:13:47] [INFO ] Flatten gal took : 4 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/graph14621168274423586306.txt' '-o' '/tmp/graph14621168274423586306.bin' '-w' '/tmp/graph14621168274423586306.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14621168274423586306.bin' '-l' '-1' '-v' '-w' '/tmp/graph14621168274423586306.weights' '-q' '0' '-e' '0.001'
[2024-05-25 21:13:47] [INFO ] Decomposing Gal with order
[2024-05-25 21:13:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 21:13:47] [INFO ] Flatten gal took : 20 ms
[2024-05-25 21:13:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-25 21:13:47] [INFO ] Time to serialize gal into /tmp/LTL8527496929690278562.gal : 2 ms
[2024-05-25 21:13:47] [INFO ] Time to serialize properties into /tmp/LTL17336248109250427634.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/LTL8527496929690278562.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17336248109250427634.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 : !((G((G("(((((gu0.p1_0+gu0.p1_1)+gu0.p1_2)<=((gi1.gu1.p2_0+gi1.gu1.p2_1)+gi1.gu1.p2_2))||(((gu0.p1_0+gu0.p1_1)+gu0.p1_2)>=1))&&(((gu0....286
Formula 0 simplified : F(F!"(((((gu0.p1_0+gu0.p1_1)+gu0.p1_2)<=((gi1.gu1.p2_0+gi1.gu1.p2_1)+gi1.gu1.p2_2))||(((gu0.p1_0+gu0.p1_1)+gu0.p1_2)>=1))&&(((gu0.p1...278
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18093316774144771806
[2024-05-25 21:14:02] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18093316774144771806
Running compilation step : cd /tmp/ltsmin18093316774144771806;'/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 86 ms.
Running link step : cd /tmp/ltsmin18093316774144771806;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin18093316774144771806;'/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' '[](([]((LTLAPp0==true))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Murphy-COL-D2N100-LTLCardinality-00 finished in 100649 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(G(p0)))'
Support contains 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 3 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 21:14:17] [INFO ] Invariant cache hit.
[2024-05-25 21:14:17] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
[2024-05-25 21:14:17] [INFO ] Invariant cache hit.
[2024-05-25 21:14:17] [INFO ] Implicit Places using invariants in 38 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s12 s13 s14) (ADD s9 s10 s11))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Murphy-COL-D2N100-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D2N100-LTLCardinality-01 finished in 209 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)&&F(G(p1)))))'
Support contains 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 21:14:17] [INFO ] Invariant cache hit.
[2024-05-25 21:14:17] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2024-05-25 21:14:17] [INFO ] Invariant cache hit.
[2024-05-25 21:14:17] [INFO ] Implicit Places using invariants in 28 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 29 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 65 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 (ADD s9 s10 s11)), p1:(GT 2 (ADD s3 s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 155 ms.
Stack based approach found an accepted trace after 42 steps with 1 reset with depth 37 and stack size 37 in 0 ms.
FORMULA Murphy-COL-D2N100-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D2N100-LTLCardinality-02 finished in 362 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 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 21:14:17] [INFO ] Invariant cache hit.
[2024-05-25 21:14:17] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2024-05-25 21:14:17] [INFO ] Invariant cache hit.
[2024-05-25 21:14:18] [INFO ] Implicit Places using invariants in 36 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 78 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s3 s4 s5) (ADD s6 s7 s8))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 155 ms.
Stack based approach found an accepted trace after 3887 steps with 0 reset with depth 3888 and stack size 3756 in 8 ms.
FORMULA Murphy-COL-D2N100-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D2N100-LTLCardinality-04 finished in 298 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 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 21:14:18] [INFO ] Invariant cache hit.
[2024-05-25 21:14:18] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-25 21:14:18] [INFO ] Invariant cache hit.
[2024-05-25 21:14:18] [INFO ] Implicit Places using invariants in 24 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 39 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 83 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s12 s13 s14) (ADD s3 s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 149 ms.
Stack based approach found an accepted trace after 2974 steps with 0 reset with depth 2975 and stack size 2897 in 6 ms.
FORMULA Murphy-COL-D2N100-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D2N100-LTLCardinality-05 finished in 287 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((p0||G(!p1)))||X(G((p0&&X(p1))))))'
Support contains 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 21:14:18] [INFO ] Invariant cache hit.
[2024-05-25 21:14:18] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2024-05-25 21:14:18] [INFO ] Invariant cache hit.
[2024-05-25 21:14:18] [INFO ] Implicit Places using invariants in 35 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 281 ms :[true, (AND (NOT p0) p1), (OR (NOT p0) (NOT p1)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, (AND p1 (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1), acceptance={} source=4 dest: 7}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=7 dest: 0}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}]], initial=1, aps=[p0:(LEQ (ADD s3 s4 s5) (ADD s9 s10 s11)), p1:(LEQ 1 (ADD s9 s10 s11))], 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, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Murphy-COL-D2N100-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D2N100-LTLCardinality-06 finished in 379 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((F(p0)&&G(F(p1)))))'
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 21:14:18] [INFO ] Invariant cache hit.
[2024-05-25 21:14:18] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2024-05-25 21:14:18] [INFO ] Invariant cache hit.
[2024-05-25 21:14:18] [INFO ] Implicit Places using invariants in 26 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 29 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s3 s4 s5) (ADD s9 s10 s11)), p1:(LEQ (ADD s0 s1 s2) (ADD s6 s7 s8))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 146 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 0 ms.
FORMULA Murphy-COL-D2N100-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D2N100-LTLCardinality-07 finished in 455 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(X(X(F(!p0))))||G(p1))))'
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 21:14:19] [INFO ] Invariant cache hit.
[2024-05-25 21:14:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2024-05-25 21:14:19] [INFO ] Invariant cache hit.
[2024-05-25 21:14:19] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-25 21:14:19] [INFO ] Invariant cache hit.
[2024-05-25 21:14:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 21:14:19] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-25 21:14:19] [INFO ] Invariant cache hit.
[2024-05-25 21:14:19] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 18/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 331 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 7}], [{ cond=p1, acceptance={} source=7 dest: 2}, { cond=(NOT p1), acceptance={} source=7 dest: 4}]], initial=1, aps=[p0:(LEQ 1 (ADD s12 s13 s14)), p1:(GT (ADD s9 s10 s11) (ADD s6 s7 s8))], 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, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1602 reset in 210 ms.
Stack based approach found an accepted trace after 95 steps with 5 reset with depth 9 and stack size 9 in 0 ms.
FORMULA Murphy-COL-D2N100-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D2N100-LTLCardinality-08 finished in 672 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((X(X(p0)) U X(p1)))))'
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 21:14:20] [INFO ] Invariant cache hit.
[2024-05-25 21:14:20] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-25 21:14:20] [INFO ] Invariant cache hit.
[2024-05-25 21:14:20] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-25 21:14:20] [INFO ] Invariant cache hit.
[2024-05-25 21:14:20] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 21:14:20] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-25 21:14:20] [INFO ] Invariant cache hit.
[2024-05-25 21:14:20] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 18/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p1:(LEQ (ADD s6 s7 s8) (ADD s9 s10 s11)), p0:(LEQ (ADD s15 s16 s17) (ADD s3 s4 s5))], 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3203 steps with 0 reset in 11 ms.
FORMULA Murphy-COL-D2N100-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D2N100-LTLCardinality-10 finished in 363 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(F((X((X(p1) U (p2&&X(p1))))||p0))))'
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 21:14:20] [INFO ] Invariant cache hit.
[2024-05-25 21:14:20] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2024-05-25 21:14:20] [INFO ] Invariant cache hit.
[2024-05-25 21:14:20] [INFO ] Implicit Places using invariants in 22 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 23 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LEQ 2 (ADD s3 s4 s5)) (GT (ADD s12 s13 s14) (ADD s9 s10 s11))), p2:(OR (LEQ 2 (ADD s3 s4 s5)) (GT (ADD s12 s13 s14) (ADD s9 s10 s11))), p1:(LEQ (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 50000 reset in 84 ms.
Product exploration explored 100000 steps with 50000 reset in 100 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 p2 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Murphy-COL-D2N100-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Murphy-COL-D2N100-LTLCardinality-11 finished in 443 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(p0)||G(p1)))'
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 21:14:20] [INFO ] Invariant cache hit.
[2024-05-25 21:14:20] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2024-05-25 21:14:20] [INFO ] Invariant cache hit.
[2024-05-25 21:14:20] [INFO ] Implicit Places using invariants in 44 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 83 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(GT 1 (ADD s6 s7 s8)), p0:(LEQ (ADD s3 s4 s5) (ADD s9 s10 s11))], 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, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Murphy-COL-D2N100-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D2N100-LTLCardinality-12 finished in 229 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 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 21:14:21] [INFO ] Invariant cache hit.
[2024-05-25 21:14:21] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-25 21:14:21] [INFO ] Invariant cache hit.
[2024-05-25 21:14:21] [INFO ] Implicit Places using invariants in 30 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 (ADD s0 s1 s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 127 ms.
Stack based approach found an accepted trace after 51 steps with 0 reset with depth 52 and stack size 52 in 0 ms.
FORMULA Murphy-COL-D2N100-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D2N100-LTLCardinality-13 finished in 252 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&&(G(p1)||F(!p2))))))'
Support contains 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 21:14:21] [INFO ] Invariant cache hit.
[2024-05-25 21:14:21] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-25 21:14:21] [INFO ] Invariant cache hit.
[2024-05-25 21:14:21] [INFO ] Implicit Places using invariants in 21 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 22 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0 p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0 p2), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p0 p2), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 (ADD s3 s4 s5)), p1:(LEQ 2 (ADD s6 s7 s8)), p2:(GT (ADD s3 s4 s5) (ADD s6 s7 s8))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 30 reset in 157 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 0 ms.
FORMULA Murphy-COL-D2N100-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D2N100-LTLCardinality-14 finished in 365 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((G(p0)||F(p1))))'
[2024-05-25 21:14:21] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18356641222705710013
[2024-05-25 21:14:21] [INFO ] Computing symmetric may disable matrix : 21 transitions.
[2024-05-25 21:14:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:14:21] [INFO ] Computing symmetric may enable matrix : 21 transitions.
[2024-05-25 21:14:21] [INFO ] Applying decomposition
[2024-05-25 21:14:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:14:21] [INFO ] Computing Do-Not-Accords matrix : 21 transitions.
[2024-05-25 21:14:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:14:21] [INFO ] Flatten gal took : 2 ms
[2024-05-25 21:14:21] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18356641222705710013
Running compilation step : cd /tmp/ltsmin18356641222705710013;'/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/graph5184227831099161357.txt' '-o' '/tmp/graph5184227831099161357.bin' '-w' '/tmp/graph5184227831099161357.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5184227831099161357.bin' '-l' '-1' '-v' '-w' '/tmp/graph5184227831099161357.weights' '-q' '0' '-e' '0.001'
[2024-05-25 21:14:21] [INFO ] Decomposing Gal with order
[2024-05-25 21:14:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 21:14:21] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:14:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 21:14:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality7817292734861120117.gal : 1 ms
[2024-05-25 21:14:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality12425751372195663602.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/LTLCardinality7817292734861120117.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12425751372195663602.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...298
Read 1 LTL properties
Checking formula 0 : !((G((G("(((((gu0.p1_0+gu0.p1_1)+gu0.p1_2)<=((gi1.gu1.p2_0+gi1.gu1.p2_1)+gi1.gu1.p2_2))||(((gu0.p1_0+gu0.p1_1)+gu0.p1_2)>=1))&&(((gu0....286
Formula 0 simplified : F(F!"(((((gu0.p1_0+gu0.p1_1)+gu0.p1_2)<=((gi1.gu1.p2_0+gi1.gu1.p2_1)+gi1.gu1.p2_2))||(((gu0.p1_0+gu0.p1_1)+gu0.p1_2)>=1))&&(((gu0.p1...278
Compilation finished in 104 ms.
Running link step : cd /tmp/ltsmin18356641222705710013;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin18356641222705710013;'/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' '--ltl' '[](([]((LTLAPp0==true))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Initializing POR dependencies: labels 23, guards 21
pins2lts-mc-linux64( 0/ 8), 0.006: LTL layer: formula: [](([]((LTLAPp0==true))||<>((LTLAPp1==true))))
pins2lts-mc-linux64( 0/ 8), 0.006: "[](([]((LTLAPp0==true))||<>((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
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.006: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: buchi has 2 states
pins2lts-mc-linux64( 0/ 8), 0.023: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.023: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.033: There are 25 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.033: State length is 19, there are 24 groups
pins2lts-mc-linux64( 0/ 8), 0.033: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.033: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.033: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.033: Visible groups: 0 / 24, labels: 2 / 25
pins2lts-mc-linux64( 0/ 8), 0.033: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.033: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.100: [Blue] ~120 levels ~960 states ~6896 transitions
pins2lts-mc-linux64( 3/ 8), 0.130: [Blue] ~240 levels ~1920 states ~11688 transitions
pins2lts-mc-linux64( 3/ 8), 0.183: [Blue] ~480 levels ~3840 states ~24320 transitions
pins2lts-mc-linux64( 3/ 8), 0.301: [Blue] ~960 levels ~7680 states ~48576 transitions
pins2lts-mc-linux64( 7/ 8), 0.432: [Blue] ~1920 levels ~15360 states ~115632 transitions
pins2lts-mc-linux64( 7/ 8), 0.635: [Blue] ~3840 levels ~30720 states ~232592 transitions
pins2lts-mc-linux64( 3/ 8), 1.047: [Blue] ~7680 levels ~61440 states ~420224 transitions
pins2lts-mc-linux64( 3/ 8), 1.551: [Blue] ~15359 levels ~122880 states ~862304 transitions
pins2lts-mc-linux64( 3/ 8), 2.154: [Blue] ~30718 levels ~245760 states ~1776696 transitions
pins2lts-mc-linux64( 3/ 8), 2.917: [Blue] ~61433 levels ~491520 states ~3564904 transitions
pins2lts-mc-linux64( 3/ 8), 4.312: [Blue] ~122865 levels ~983040 states ~7068160 transitions
pins2lts-mc-linux64( 3/ 8), 6.953: [Blue] ~245717 levels ~1966080 states ~14148616 transitions
pins2lts-mc-linux64( 3/ 8), 12.549: [Blue] ~491433 levels ~3932160 states ~28308680 transitions
pins2lts-mc-linux64( 3/ 8), 23.600: [Blue] ~982878 levels ~7864320 states ~56678864 transitions
pins2lts-mc-linux64( 3/ 8), 54.272: [Blue] ~1965726 levels ~15728640 states ~113828088 transitions
pins2lts-mc-linux64( 3/ 8), 121.282: [Blue] ~3930400 levels ~31457280 states ~241290992 transitions
pins2lts-mc-linux64( 3/ 8), 134.032: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 134.126:
pins2lts-mc-linux64( 0/ 8), 134.126: Explored 26686770 states 239931675 transitions, fanout: 8.991
pins2lts-mc-linux64( 0/ 8), 134.126: Total exploration time 134.060 sec (133.990 sec minimum, 134.021 sec on average)
pins2lts-mc-linux64( 0/ 8), 134.126: States per second: 199066, Transitions per second: 1789734
pins2lts-mc-linux64( 0/ 8), 134.126:
pins2lts-mc-linux64( 0/ 8), 134.127: State space has 45410693 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 134.127: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 134.127: blue states: 26686770 (58.77%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 134.127: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 134.127: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 134.127:
pins2lts-mc-linux64( 0/ 8), 134.127: Total memory used for local state coloring: 404.7MB
pins2lts-mc-linux64( 0/ 8), 134.127:
pins2lts-mc-linux64( 0/ 8), 134.127: Queue width: 8B, total height: 26524096, memory: 202.36MB
pins2lts-mc-linux64( 0/ 8), 134.127: Tree memory: 602.5MB, 13.9 B/state, compr.: 17.8%
pins2lts-mc-linux64( 0/ 8), 134.127: Tree fill ratio (roots/leafs): 33.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 134.127: Stored 21 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 134.127: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 134.127: Est. total memory use: 804.8MB (~1226.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18356641222705710013;'/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' '--ltl' '[](([]((LTLAPp0==true))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18356641222705710013;'/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' '--ltl' '[](([]((LTLAPp0==true))||<>((LTLAPp1==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)
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...171
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
40383 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,403.846,4281500,1,0,45,4.22659e+06,67,21,223859,4.49952e+06,55
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Murphy-COL-D2N100-LTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 600746 ms.

BK_STOP 1716672156307

--------------------
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="Murphy-COL-D2N100"
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 Murphy-COL-D2N100, 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 r263-tall-171654372200162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-COL-D2N100.tgz
mv Murphy-COL-D2N100 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 ;