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.r087-tall-171620521400043.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 CANConstruction-PT-080, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521400043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.9M
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 12 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 12 20:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26K Apr 12 20:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.5M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANConstruction-PT-080-LTLFireability-00
FORMULA_NAME CANConstruction-PT-080-LTLFireability-01
FORMULA_NAME CANConstruction-PT-080-LTLFireability-02
FORMULA_NAME CANConstruction-PT-080-LTLFireability-03
FORMULA_NAME CANConstruction-PT-080-LTLFireability-04
FORMULA_NAME CANConstruction-PT-080-LTLFireability-05
FORMULA_NAME CANConstruction-PT-080-LTLFireability-06
FORMULA_NAME CANConstruction-PT-080-LTLFireability-07
FORMULA_NAME CANConstruction-PT-080-LTLFireability-08
FORMULA_NAME CANConstruction-PT-080-LTLFireability-09
FORMULA_NAME CANConstruction-PT-080-LTLFireability-10
FORMULA_NAME CANConstruction-PT-080-LTLFireability-11
FORMULA_NAME CANConstruction-PT-080-LTLFireability-12
FORMULA_NAME CANConstruction-PT-080-LTLFireability-13
FORMULA_NAME CANConstruction-PT-080-LTLFireability-14
FORMULA_NAME CANConstruction-PT-080-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716219805120

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-080
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-20 15:43:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 15:43:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 15:43:27] [INFO ] Load time of PNML (sax parser for PT used): 487 ms
[2024-05-20 15:43:27] [INFO ] Transformed 13762 places.
[2024-05-20 15:43:27] [INFO ] Transformed 26240 transitions.
[2024-05-20 15:43:27] [INFO ] Parsed PT model containing 13762 places and 26240 transitions and 78400 arcs in 654 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANConstruction-PT-080-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-080-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 13762 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13762/13762 places, 26240/26240 transitions.
Discarding 6220 places :
Symmetric choice reduction at 0 with 6220 rule applications. Total rules 6220 place count 7542 transition count 13800
Iterating global reduction 0 with 6220 rules applied. Total rules applied 12440 place count 7542 transition count 13800
Applied a total of 12440 rules in 4356 ms. Remains 7542 /13762 variables (removed 6220) and now considering 13800/26240 (removed 12440) transitions.
// Phase 1: matrix 13800 rows 7542 cols
[2024-05-20 15:43:32] [INFO ] Computed 161 invariants in 193 ms
[2024-05-20 15:43:33] [INFO ] Implicit Places using invariants in 1096 ms returned []
Implicit Place search using SMT only with invariants took 1122 ms to find 0 implicit places.
[2024-05-20 15:43:33] [INFO ] Invariant cache hit.
[2024-05-20 15:43:42] [INFO ] Dead Transitions using invariants and state equation in 9714 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7542/13762 places, 13800/26240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15198 ms. Remains : 7542/13762 places, 13800/26240 transitions.
Support contains 47 out of 7542 places after structural reductions.
[2024-05-20 15:43:43] [INFO ] Flatten gal took : 591 ms
[2024-05-20 15:43:44] [INFO ] Flatten gal took : 412 ms
[2024-05-20 15:43:44] [INFO ] Input system was already deterministic with 13800 transitions.
Support contains 44 out of 7542 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 595 ms. (steps per millisecond=16 ) properties (out of 30) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2024-05-20 15:43:45] [INFO ] Invariant cache hit.
[2024-05-20 15:43:48] [INFO ] [Real]Absence check using 81 positive place invariants in 158 ms returned sat
[2024-05-20 15:43:48] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 74 ms returned sat
[2024-05-20 15:44:04] [INFO ] After 14542ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7 real:11
[2024-05-20 15:44:04] [INFO ] State equation strengthened by 12720 read => feed constraints.
[2024-05-20 15:44:08] [INFO ] After 4231ms SMT Verify possible using 12720 Read/Feed constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-20 15:44:08] [INFO ] After 23193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-20 15:44:11] [INFO ] [Nat]Absence check using 81 positive place invariants in 189 ms returned sat
[2024-05-20 15:44:11] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 86 ms returned sat
[2024-05-20 15:44:27] [INFO ] After 14848ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-20 15:44:33] [INFO ] After 6090ms SMT Verify possible using 12720 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2024-05-20 15:44:33] [INFO ] After 6090ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-20 15:44:33] [INFO ] After 25102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 10 properties in 442 ms.
Support contains 13 out of 7542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7542/7542 places, 13800/13800 transitions.
Drop transitions removed 555 transitions
Trivial Post-agglo rules discarded 555 transitions
Performed 555 trivial Post agglomeration. Transition count delta: 555
Iterating post reduction 0 with 555 rules applied. Total rules applied 555 place count 7542 transition count 13245
Reduce places removed 555 places and 0 transitions.
Iterating post reduction 1 with 555 rules applied. Total rules applied 1110 place count 6987 transition count 13245
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1110 place count 6987 transition count 13243
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1114 place count 6985 transition count 13243
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1127 place count 6972 transition count 13217
Iterating global reduction 2 with 13 rules applied. Total rules applied 1140 place count 6972 transition count 13217
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 4 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 1296 place count 6894 transition count 13139
Free-agglomeration rule applied 148 times.
Iterating global reduction 2 with 148 rules applied. Total rules applied 1444 place count 6894 transition count 12991
Reduce places removed 148 places and 0 transitions.
Iterating post reduction 2 with 148 rules applied. Total rules applied 1592 place count 6746 transition count 12991
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 1595 place count 6746 transition count 12988
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1598 place count 6743 transition count 12988
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 1612 place count 6743 transition count 12988
Applied a total of 1612 rules in 11891 ms. Remains 6743 /7542 variables (removed 799) and now considering 12988/13800 (removed 812) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11895 ms. Remains : 6743/7542 places, 12988/13800 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 12988 rows 6743 cols
[2024-05-20 15:44:46] [INFO ] Computed 161 invariants in 98 ms
[2024-05-20 15:44:47] [INFO ] [Real]Absence check using 81 positive place invariants in 144 ms returned sat
[2024-05-20 15:44:47] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 78 ms returned sat
[2024-05-20 15:44:55] [INFO ] After 7658ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-20 15:44:55] [INFO ] State equation strengthened by 12806 read => feed constraints.
[2024-05-20 15:44:57] [INFO ] After 1838ms SMT Verify possible using 12806 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 15:44:57] [INFO ] After 10901ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 15:44:58] [INFO ] [Nat]Absence check using 81 positive place invariants in 132 ms returned sat
[2024-05-20 15:44:58] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 79 ms returned sat
[2024-05-20 15:45:06] [INFO ] After 7087ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 15:45:09] [INFO ] After 3601ms SMT Verify possible using 12806 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 15:45:11] [INFO ] After 5637ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1376 ms.
[2024-05-20 15:45:13] [INFO ] After 15309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 8 out of 6743 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6743/6743 places, 12988/12988 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 6739 transition count 12984
Applied a total of 8 rules in 3711 ms. Remains 6739 /6743 variables (removed 4) and now considering 12984/12988 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3711 ms. Remains : 6739/6743 places, 12984/12988 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 85045 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85045 steps, saw 74680 distinct states, run finished after 3004 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 12984 rows 6739 cols
[2024-05-20 15:45:20] [INFO ] Computed 161 invariants in 98 ms
[2024-05-20 15:45:21] [INFO ] [Real]Absence check using 81 positive place invariants in 130 ms returned sat
[2024-05-20 15:45:21] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 69 ms returned sat
[2024-05-20 15:45:28] [INFO ] After 7325ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2024-05-20 15:45:28] [INFO ] State equation strengthened by 12809 read => feed constraints.
[2024-05-20 15:45:31] [INFO ] After 2313ms SMT Verify possible using 12809 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 15:45:31] [INFO ] After 10965ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 15:45:32] [INFO ] [Nat]Absence check using 81 positive place invariants in 134 ms returned sat
[2024-05-20 15:45:32] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 66 ms returned sat
[2024-05-20 15:45:39] [INFO ] After 7199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 15:45:42] [INFO ] After 2687ms SMT Verify possible using 12809 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 15:45:44] [INFO ] After 4541ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1227 ms.
[2024-05-20 15:45:45] [INFO ] After 14163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 8 out of 6739 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6739/6739 places, 12984/12984 transitions.
Applied a total of 0 rules in 1976 ms. Remains 6739 /6739 variables (removed 0) and now considering 12984/12984 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1977 ms. Remains : 6739/6739 places, 12984/12984 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6739/6739 places, 12984/12984 transitions.
Applied a total of 0 rules in 1930 ms. Remains 6739 /6739 variables (removed 0) and now considering 12984/12984 (removed 0) transitions.
[2024-05-20 15:45:49] [INFO ] Invariant cache hit.
[2024-05-20 15:45:54] [INFO ] Implicit Places using invariants in 5053 ms returned []
Implicit Place search using SMT only with invariants took 5054 ms to find 0 implicit places.
[2024-05-20 15:45:54] [INFO ] Invariant cache hit.
[2024-05-20 15:46:02] [INFO ] Dead Transitions using invariants and state equation in 8605 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15594 ms. Remains : 6739/6739 places, 12984/12984 transitions.
FORMULA CANConstruction-PT-080-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CANConstruction-PT-080-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 321 stabilizing places and 400 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' '!(((p0&&X(F(p1))) U X(!p0)))'
Support contains 2 out of 7542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7542/7542 places, 13800/13800 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 7524 transition count 13764
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 7524 transition count 13764
Applied a total of 36 rules in 4143 ms. Remains 7524 /7542 variables (removed 18) and now considering 13764/13800 (removed 36) transitions.
// Phase 1: matrix 13764 rows 7524 cols
[2024-05-20 15:46:07] [INFO ] Computed 161 invariants in 81 ms
[2024-05-20 15:46:13] [INFO ] Implicit Places using invariants in 5798 ms returned []
Implicit Place search using SMT only with invariants took 5799 ms to find 0 implicit places.
[2024-05-20 15:46:13] [INFO ] Invariant cache hit.
[2024-05-20 15:46:22] [INFO ] Dead Transitions using invariants and state equation in 9599 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7524/7542 places, 13764/13800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19545 ms. Remains : 7524/7542 places, 13764/13800 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 261 ms :[p0, p0, p0, true, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s2743 1), p1:(LT s5368 1)], nbAcceptance=0, 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 50000 reset in 4399 ms.
Product exploration explored 100000 steps with 50000 reset in 4199 ms.
Computed a total of 321 stabilizing places and 400 stable transitions
Computed a total of 321 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), true, (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-080-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-080-LTLFireability-00 finished in 28558 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((F(p0) U p1))))'
Support contains 3 out of 7542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7542/7542 places, 13800/13800 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 7542 transition count 13242
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 6984 transition count 13242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1116 place count 6984 transition count 13241
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1118 place count 6983 transition count 13241
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1137 place count 6964 transition count 13203
Iterating global reduction 2 with 19 rules applied. Total rules applied 1156 place count 6964 transition count 13203
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 1314 place count 6885 transition count 13124
Applied a total of 1314 rules in 6152 ms. Remains 6885 /7542 variables (removed 657) and now considering 13124/13800 (removed 676) transitions.
// Phase 1: matrix 13124 rows 6885 cols
[2024-05-20 15:46:38] [INFO ] Computed 161 invariants in 76 ms
[2024-05-20 15:46:43] [INFO ] Implicit Places using invariants in 5323 ms returned []
Implicit Place search using SMT only with invariants took 5324 ms to find 0 implicit places.
[2024-05-20 15:46:43] [INFO ] Invariant cache hit.
[2024-05-20 15:46:51] [INFO ] Dead Transitions using invariants and state equation in 8522 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6885/7542 places, 13124/13800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20005 ms. Remains : 6885/7542 places, 13124/13800 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s262 1) (GEQ s348 1)), p0:(LT s4058 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 737 steps with 0 reset in 16 ms.
FORMULA CANConstruction-PT-080-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-02 finished in 20171 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((G(F(p0))||(F(p0)&&X(G(p1)))))))'
Support contains 2 out of 7542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7542/7542 places, 13800/13800 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 7524 transition count 13764
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 7524 transition count 13764
Applied a total of 36 rules in 4250 ms. Remains 7524 /7542 variables (removed 18) and now considering 13764/13800 (removed 36) transitions.
// Phase 1: matrix 13764 rows 7524 cols
[2024-05-20 15:46:56] [INFO ] Computed 161 invariants in 93 ms
[2024-05-20 15:47:02] [INFO ] Implicit Places using invariants in 5757 ms returned []
Implicit Place search using SMT only with invariants took 5758 ms to find 0 implicit places.
[2024-05-20 15:47:02] [INFO ] Invariant cache hit.
[2024-05-20 15:47:10] [INFO ] Dead Transitions using invariants and state equation in 8847 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7524/7542 places, 13764/13800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18861 ms. Remains : 7524/7542 places, 13764/13800 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s4513 1), p1:(LT s1719 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 6729 steps with 4 reset in 94 ms.
FORMULA CANConstruction-PT-080-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-03 finished in 19154 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) U p1))||((p2 U X(G(p3))) U p3)))'
Support contains 4 out of 7542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7542/7542 places, 13800/13800 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 7525 transition count 13766
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 7525 transition count 13766
Applied a total of 34 rules in 4328 ms. Remains 7525 /7542 variables (removed 17) and now considering 13766/13800 (removed 34) transitions.
// Phase 1: matrix 13766 rows 7525 cols
[2024-05-20 15:47:15] [INFO ] Computed 161 invariants in 84 ms
[2024-05-20 15:47:21] [INFO ] Implicit Places using invariants in 5829 ms returned []
Implicit Place search using SMT only with invariants took 5830 ms to find 0 implicit places.
[2024-05-20 15:47:21] [INFO ] Invariant cache hit.
[2024-05-20 15:47:31] [INFO ] Dead Transitions using invariants and state equation in 9732 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7525/7542 places, 13766/13800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19903 ms. Remains : 7525/7542 places, 13766/13800 transitions.
Stuttering acceptance computed with spot in 577 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=0 dest: 7}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 8}], [{ cond=(AND (NOT p0) p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 9}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=5 dest: 1}, { cond=p3, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 10}, { cond=(NOT p3), acceptance={} source=5 dest: 11}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(NOT p2), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=8 dest: 7}, { cond=p2, acceptance={} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 9}, { cond=(NOT p1), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=11 dest: 9}, { cond=(NOT p1), acceptance={} source=11 dest: 10}, { cond=true, acceptance={} source=11 dest: 11}]], initial=0, aps=[p3:(GEQ s773 1), p2:(GEQ s3884 1), p1:(GEQ s3512 1), p0:(GEQ s6845 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1399 steps with 0 reset in 23 ms.
FORMULA CANConstruction-PT-080-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-05 finished in 20563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 7542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7542/7542 places, 13800/13800 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 7542 transition count 13241
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 6983 transition count 13241
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1137 place count 6964 transition count 13203
Iterating global reduction 2 with 19 rules applied. Total rules applied 1156 place count 6964 transition count 13203
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1316 place count 6884 transition count 13123
Applied a total of 1316 rules in 5929 ms. Remains 6884 /7542 variables (removed 658) and now considering 13123/13800 (removed 677) transitions.
// Phase 1: matrix 13123 rows 6884 cols
[2024-05-20 15:47:37] [INFO ] Computed 161 invariants in 87 ms
[2024-05-20 15:47:43] [INFO ] Implicit Places using invariants in 5622 ms returned []
Implicit Place search using SMT only with invariants took 5623 ms to find 0 implicit places.
[2024-05-20 15:47:43] [INFO ] Invariant cache hit.
[2024-05-20 15:47:52] [INFO ] Dead Transitions using invariants and state equation in 8742 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6884/7542 places, 13123/13800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20295 ms. Remains : 6884/7542 places, 13123/13800 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s364 1) (GEQ s1096 1) (GEQ s5982 1)) (AND (GEQ s364 1) (GEQ s1096 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 680 steps with 0 reset in 15 ms.
FORMULA CANConstruction-PT-080-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-06 finished in 20427 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 1 out of 7542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7542/7542 places, 13800/13800 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 7542 transition count 13240
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 6982 transition count 13240
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1139 place count 6963 transition count 13202
Iterating global reduction 2 with 19 rules applied. Total rules applied 1158 place count 6963 transition count 13202
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1318 place count 6883 transition count 13122
Applied a total of 1318 rules in 5760 ms. Remains 6883 /7542 variables (removed 659) and now considering 13122/13800 (removed 678) transitions.
// Phase 1: matrix 13122 rows 6883 cols
[2024-05-20 15:47:58] [INFO ] Computed 161 invariants in 82 ms
[2024-05-20 15:48:03] [INFO ] Implicit Places using invariants in 5595 ms returned []
Implicit Place search using SMT only with invariants took 5596 ms to find 0 implicit places.
[2024-05-20 15:48:03] [INFO ] Invariant cache hit.
[2024-05-20 15:48:11] [INFO ] Dead Transitions using invariants and state equation in 8089 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6883/7542 places, 13122/13800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19449 ms. Remains : 6883/7542 places, 13122/13800 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s569 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 728 steps with 0 reset in 16 ms.
FORMULA CANConstruction-PT-080-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-07 finished in 19546 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((F(G(p0))||G(p1)))))'
Support contains 3 out of 7542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7542/7542 places, 13800/13800 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 7523 transition count 13762
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 7523 transition count 13762
Applied a total of 38 rules in 4421 ms. Remains 7523 /7542 variables (removed 19) and now considering 13762/13800 (removed 38) transitions.
// Phase 1: matrix 13762 rows 7523 cols
[2024-05-20 15:48:16] [INFO ] Computed 161 invariants in 84 ms
[2024-05-20 15:48:21] [INFO ] Implicit Places using invariants in 5802 ms returned []
Implicit Place search using SMT only with invariants took 5812 ms to find 0 implicit places.
[2024-05-20 15:48:21] [INFO ] Invariant cache hit.
[2024-05-20 15:48:30] [INFO ] Dead Transitions using invariants and state equation in 9032 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7523/7542 places, 13762/13800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19267 ms. Remains : 7523/7542 places, 13762/13800 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(LT s7407 1), p0:(OR (LT s6 1) (LT s7048 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 70 reset in 1340 ms.
Product exploration explored 100000 steps with 71 reset in 1467 ms.
Computed a total of 321 stabilizing places and 400 stable transitions
Computed a total of 321 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 222576 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{1=1}
Probabilistic random walk after 222576 steps, saw 216748 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :1
Running SMT prover for 1 properties.
[2024-05-20 15:48:37] [INFO ] Invariant cache hit.
[2024-05-20 15:48:38] [INFO ] [Real]Absence check using 81 positive place invariants in 161 ms returned sat
[2024-05-20 15:48:38] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 92 ms returned sat
[2024-05-20 15:48:46] [INFO ] After 7690ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 15:48:46] [INFO ] State equation strengthened by 12720 read => feed constraints.
[2024-05-20 15:48:47] [INFO ] After 1258ms SMT Verify possible using 12720 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 15:48:47] [INFO ] After 10121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 15:48:48] [INFO ] [Nat]Absence check using 81 positive place invariants in 158 ms returned sat
[2024-05-20 15:48:48] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 88 ms returned sat
[2024-05-20 15:48:56] [INFO ] After 8211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 15:48:58] [INFO ] After 1344ms SMT Verify possible using 12720 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 15:48:58] [INFO ] After 1955ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 401 ms.
[2024-05-20 15:48:59] [INFO ] After 11572ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 7523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7523/7523 places, 13762/13762 transitions.
Applied a total of 0 rules in 2154 ms. Remains 7523 /7523 variables (removed 0) and now considering 13762/13762 (removed 0) transitions.
[2024-05-20 15:49:01] [INFO ] Invariant cache hit.
[2024-05-20 15:49:07] [INFO ] Implicit Places using invariants in 5743 ms returned []
Implicit Place search using SMT only with invariants took 5744 ms to find 0 implicit places.
[2024-05-20 15:49:07] [INFO ] Invariant cache hit.
[2024-05-20 15:49:17] [INFO ] Dead Transitions using invariants and state equation in 9761 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17661 ms. Remains : 7523/7523 places, 13762/13762 transitions.
Computed a total of 321 stabilizing places and 400 stable transitions
Computed a total of 321 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 15:49:17] [INFO ] Invariant cache hit.
[2024-05-20 15:49:18] [INFO ] [Real]Absence check using 81 positive place invariants in 161 ms returned sat
[2024-05-20 15:49:18] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 91 ms returned sat
[2024-05-20 15:49:26] [INFO ] After 7950ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 15:49:26] [INFO ] State equation strengthened by 12720 read => feed constraints.
[2024-05-20 15:49:28] [INFO ] After 1331ms SMT Verify possible using 12720 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 15:49:28] [INFO ] After 10417ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 15:49:29] [INFO ] [Nat]Absence check using 81 positive place invariants in 158 ms returned sat
[2024-05-20 15:49:29] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 94 ms returned sat
[2024-05-20 15:49:37] [INFO ] After 8252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 15:49:38] [INFO ] After 1275ms SMT Verify possible using 12720 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 15:49:39] [INFO ] After 1859ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 388 ms.
[2024-05-20 15:49:39] [INFO ] After 11510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 69 reset in 1300 ms.
Product exploration explored 100000 steps with 70 reset in 1372 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 7523 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7523/7523 places, 13762/13762 transitions.
Performed 399 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 399 rules applied. Total rules applied 399 place count 7523 transition count 13762
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 81 Pre rules applied. Total rules applied 399 place count 7523 transition count 13762
Deduced a syphon composed of 480 places in 3 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 480 place count 7523 transition count 13762
Discarding 160 places :
Symmetric choice reduction at 1 with 160 rule applications. Total rules 640 place count 7363 transition count 13602
Deduced a syphon composed of 320 places in 3 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 800 place count 7363 transition count 13602
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 479 places in 3 ms
Iterating global reduction 1 with 159 rules applied. Total rules applied 959 place count 7363 transition count 13602
Discarding 318 places :
Symmetric choice reduction at 1 with 318 rule applications. Total rules 1277 place count 7045 transition count 13284
Deduced a syphon composed of 161 places in 2 ms
Iterating global reduction 1 with 318 rules applied. Total rules applied 1595 place count 7045 transition count 13284
Deduced a syphon composed of 161 places in 2 ms
Applied a total of 1595 rules in 9049 ms. Remains 7045 /7523 variables (removed 478) and now considering 13284/13762 (removed 478) transitions.
// Phase 1: matrix 13284 rows 7045 cols
[2024-05-20 15:49:52] [INFO ] Computed 161 invariants in 76 ms
[2024-05-20 15:50:01] [INFO ] Dead Transitions using invariants and state equation in 8734 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7045/7523 places, 13284/13762 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17784 ms. Remains : 7045/7523 places, 13284/13762 transitions.
Built C files in :
/tmp/ltsmin1308077573496738386
[2024-05-20 15:50:01] [INFO ] Built C files in 153ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1308077573496738386
Running compilation step : cd /tmp/ltsmin1308077573496738386;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1308077573496738386;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1308077573496738386;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 7523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7523/7523 places, 13762/13762 transitions.
Applied a total of 0 rules in 2321 ms. Remains 7523 /7523 variables (removed 0) and now considering 13762/13762 (removed 0) transitions.
// Phase 1: matrix 13762 rows 7523 cols
[2024-05-20 15:50:06] [INFO ] Computed 161 invariants in 81 ms
[2024-05-20 15:50:12] [INFO ] Implicit Places using invariants in 5985 ms returned []
Implicit Place search using SMT only with invariants took 5986 ms to find 0 implicit places.
[2024-05-20 15:50:12] [INFO ] Invariant cache hit.
[2024-05-20 15:50:22] [INFO ] Dead Transitions using invariants and state equation in 9952 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18260 ms. Remains : 7523/7523 places, 13762/13762 transitions.
Built C files in :
/tmp/ltsmin5472109923298104034
[2024-05-20 15:50:22] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5472109923298104034
Running compilation step : cd /tmp/ltsmin5472109923298104034;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5472109923298104034;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5472109923298104034;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 15:50:26] [INFO ] Flatten gal took : 337 ms
[2024-05-20 15:50:26] [INFO ] Flatten gal took : 312 ms
[2024-05-20 15:50:26] [INFO ] Time to serialize gal into /tmp/LTL1657985448598964804.gal : 76 ms
[2024-05-20 15:50:26] [INFO ] Time to serialize properties into /tmp/LTL10921976883984586278.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1657985448598964804.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15379933906875774891.hoa' '-atoms' '/tmp/LTL10921976883984586278.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/LTL10921976883984586278.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15379933906875774891.hoa
Detected timeout of ITS tools.
[2024-05-20 15:50:42] [INFO ] Flatten gal took : 287 ms
[2024-05-20 15:50:42] [INFO ] Flatten gal took : 297 ms
[2024-05-20 15:50:42] [INFO ] Time to serialize gal into /tmp/LTL12552440681952657443.gal : 52 ms
[2024-05-20 15:50:42] [INFO ] Time to serialize properties into /tmp/LTL17840884852486168948.ltl : 3 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/LTL12552440681952657443.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17840884852486168948.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...277
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((Node0IsInserted<1)||(Node74requestsent0<1))")))||(G("(Node78GiveAnswer42<1)"))))))
Formula 0 simplified : XX(GF!"((Node0IsInserted<1)||(Node74requestsent0<1))" & F!"(Node78GiveAnswer42<1)")
Detected timeout of ITS tools.
[2024-05-20 15:50:58] [INFO ] Flatten gal took : 282 ms
[2024-05-20 15:50:58] [INFO ] Applying decomposition
[2024-05-20 15:50:58] [INFO ] Flatten gal took : 300 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/graph62765590910552162.txt' '-o' '/tmp/graph62765590910552162.bin' '-w' '/tmp/graph62765590910552162.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph62765590910552162.bin' '-l' '-1' '-v' '-w' '/tmp/graph62765590910552162.weights' '-q' '0' '-e' '0.001'
[2024-05-20 15:50:59] [INFO ] Decomposing Gal with order
[2024-05-20 15:50:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 15:51:01] [INFO ] Removed a total of 12925 redundant transitions.
[2024-05-20 15:51:01] [INFO ] Flatten gal took : 1845 ms
[2024-05-20 15:51:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 25334 labels/synchronizations in 1844 ms.
[2024-05-20 15:51:03] [INFO ] Time to serialize gal into /tmp/LTL5863270813619996891.gal : 97 ms
[2024-05-20 15:51:03] [INFO ] Time to serialize properties into /tmp/LTL15891596351322965979.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/LTL5863270813619996891.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15891596351322965979.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((i32.u0.Node0IsInserted<1)||(i75.u299.Node74requestsent0<1))")))||(G("(i43.u320.Node78GiveAnswer42<1)"))))))
Formula 0 simplified : XX(GF!"((i32.u0.Node0IsInserted<1)||(i75.u299.Node74requestsent0<1))" & F!"(i43.u320.Node78GiveAnswer42<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin878999983105061523
[2024-05-20 15:51:19] [INFO ] Built C files in 158ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin878999983105061523
Running compilation step : cd /tmp/ltsmin878999983105061523;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin878999983105061523;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin878999983105061523;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANConstruction-PT-080-LTLFireability-08 finished in 190510 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(p0)&&X((F(G(p1))||G(p2)))))'
Support contains 4 out of 7542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7542/7542 places, 13800/13800 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 7524 transition count 13764
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 7524 transition count 13764
Applied a total of 36 rules in 4706 ms. Remains 7524 /7542 variables (removed 18) and now considering 13764/13800 (removed 36) transitions.
// Phase 1: matrix 13764 rows 7524 cols
[2024-05-20 15:51:26] [INFO ] Computed 161 invariants in 82 ms
[2024-05-20 15:51:32] [INFO ] Implicit Places using invariants in 5648 ms returned []
Implicit Place search using SMT only with invariants took 5653 ms to find 0 implicit places.
[2024-05-20 15:51:32] [INFO ] Invariant cache hit.
[2024-05-20 15:51:41] [INFO ] Dead Transitions using invariants and state equation in 9346 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7524/7542 places, 13764/13800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19718 ms. Remains : 7524/7542 places, 13764/13800 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s6311 1), p2:(AND (GEQ s440 1) (GEQ s627 1)), p1:(LT s1704 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1480 steps with 0 reset in 19 ms.
FORMULA CANConstruction-PT-080-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-10 finished in 19907 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)||(p1&&F(!p1))))||G(p1)))'
Support contains 2 out of 7542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7542/7542 places, 13800/13800 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 7524 transition count 13764
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 7524 transition count 13764
Applied a total of 36 rules in 4357 ms. Remains 7524 /7542 variables (removed 18) and now considering 13764/13800 (removed 36) transitions.
// Phase 1: matrix 13764 rows 7524 cols
[2024-05-20 15:51:46] [INFO ] Computed 161 invariants in 81 ms
[2024-05-20 15:51:52] [INFO ] Implicit Places using invariants in 5575 ms returned []
Implicit Place search using SMT only with invariants took 5576 ms to find 0 implicit places.
[2024-05-20 15:51:52] [INFO ] Invariant cache hit.
[2024-05-20 15:52:01] [INFO ] Dead Transitions using invariants and state equation in 9074 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7524/7542 places, 13764/13800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19008 ms. Remains : 7524/7542 places, 13764/13800 transitions.
Stuttering acceptance computed with spot in 341 ms :[true, p1, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND p1 (NOT p0))]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(LT s5219 1), p0:(AND (GEQ s5219 1) (GEQ s5780 1))], 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4199 ms.
Product exploration explored 100000 steps with 50000 reset in 4210 ms.
Computed a total of 321 stabilizing places and 400 stable transitions
Computed a total of 321 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 20 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-080-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-080-LTLFireability-11 finished in 27853 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&&(X(p2)||p1))))'
Support contains 7 out of 7542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7542/7542 places, 13800/13800 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 7523 transition count 13762
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 7523 transition count 13762
Applied a total of 38 rules in 4517 ms. Remains 7523 /7542 variables (removed 19) and now considering 13762/13800 (removed 38) transitions.
// Phase 1: matrix 13762 rows 7523 cols
[2024-05-20 15:52:14] [INFO ] Computed 161 invariants in 82 ms
[2024-05-20 15:52:20] [INFO ] Implicit Places using invariants in 5826 ms returned []
Implicit Place search using SMT only with invariants took 5827 ms to find 0 implicit places.
[2024-05-20 15:52:20] [INFO ] Invariant cache hit.
[2024-05-20 15:52:29] [INFO ] Dead Transitions using invariants and state equation in 8972 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7523/7542 places, 13762/13800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19317 ms. Remains : 7523/7542 places, 13762/13800 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s678 1) (LT s963 1) (LT s5875 1)), p1:(OR (GEQ s5875 1) (LT s67 1) (LT s608 1)), p2:(AND (GEQ s104 1) (GEQ s2710 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 737 steps with 0 reset in 12 ms.
FORMULA CANConstruction-PT-080-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-13 finished in 19464 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)))'
Support contains 3 out of 7542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7542/7542 places, 13800/13800 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 7523 transition count 13762
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 7523 transition count 13762
Applied a total of 38 rules in 4435 ms. Remains 7523 /7542 variables (removed 19) and now considering 13762/13800 (removed 38) transitions.
// Phase 1: matrix 13762 rows 7523 cols
[2024-05-20 15:52:33] [INFO ] Computed 161 invariants in 82 ms
[2024-05-20 15:52:39] [INFO ] Implicit Places using invariants in 5894 ms returned []
Implicit Place search using SMT only with invariants took 5894 ms to find 0 implicit places.
[2024-05-20 15:52:39] [INFO ] Invariant cache hit.
[2024-05-20 15:52:49] [INFO ] Dead Transitions using invariants and state equation in 9699 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7523/7542 places, 13762/13800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20030 ms. Remains : 7523/7542 places, 13762/13800 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s2825 1) (LT s720 1) (LT s6705 1))], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 4265 ms.
Product exploration explored 100000 steps with 50000 reset in 4353 ms.
Computed a total of 321 stabilizing places and 400 stable transitions
Computed a total of 321 stabilizing places and 400 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-080-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-080-LTLFireability-14 finished in 28823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!X(p0) U p1)))'
Support contains 3 out of 7542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7542/7542 places, 13800/13800 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 7523 transition count 13762
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 7523 transition count 13762
Applied a total of 38 rules in 4675 ms. Remains 7523 /7542 variables (removed 19) and now considering 13762/13800 (removed 38) transitions.
// Phase 1: matrix 13762 rows 7523 cols
[2024-05-20 15:53:03] [INFO ] Computed 161 invariants in 78 ms
[2024-05-20 15:53:03] [INFO ] Implicit Places using invariants in 783 ms returned []
Implicit Place search using SMT only with invariants took 784 ms to find 0 implicit places.
[2024-05-20 15:53:03] [INFO ] Invariant cache hit.
[2024-05-20 15:53:13] [INFO ] Dead Transitions using invariants and state equation in 9457 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7523/7542 places, 13762/13800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14917 ms. Remains : 7523/7542 places, 13762/13800 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (OR (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (GEQ s342 1) (GEQ s4781 1)), p0:(GEQ s6721 1)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1097 steps with 0 reset in 17 ms.
FORMULA CANConstruction-PT-080-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-15 finished in 15100 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((F(G(p0))||G(p1)))))'
Found a Lengthening insensitive property : CANConstruction-PT-080-LTLFireability-08
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 7542 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 7542/7542 places, 13800/13800 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 7542 transition count 13241
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 6983 transition count 13241
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1137 place count 6964 transition count 13203
Iterating global reduction 2 with 19 rules applied. Total rules applied 1156 place count 6964 transition count 13203
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1316 place count 6884 transition count 13123
Applied a total of 1316 rules in 6034 ms. Remains 6884 /7542 variables (removed 658) and now considering 13123/13800 (removed 677) transitions.
// Phase 1: matrix 13123 rows 6884 cols
[2024-05-20 15:53:19] [INFO ] Computed 161 invariants in 78 ms
[2024-05-20 15:53:25] [INFO ] Implicit Places using invariants in 5657 ms returned []
Implicit Place search using SMT only with invariants took 5659 ms to find 0 implicit places.
[2024-05-20 15:53:25] [INFO ] Invariant cache hit.
[2024-05-20 15:53:34] [INFO ] Dead Transitions using invariants and state equation in 8797 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 6884/7542 places, 13123/13800 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 20492 ms. Remains : 6884/7542 places, 13123/13800 transitions.
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(LT s6768 1), p0:(OR (LT s4 1) (LT s6409 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 140 reset in 1836 ms.
Product exploration explored 100000 steps with 141 reset in 1919 ms.
Computed a total of 243 stabilizing places and 241 stable transitions
Computed a total of 243 stabilizing places and 241 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 15:53:38] [INFO ] Invariant cache hit.
[2024-05-20 15:53:39] [INFO ] [Real]Absence check using 81 positive place invariants in 141 ms returned sat
[2024-05-20 15:53:39] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 95 ms returned sat
[2024-05-20 15:53:47] [INFO ] After 8252ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 15:53:47] [INFO ] State equation strengthened by 12800 read => feed constraints.
[2024-05-20 15:53:48] [INFO ] After 1229ms SMT Verify possible using 12800 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 15:53:48] [INFO ] After 10568ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 15:53:49] [INFO ] [Nat]Absence check using 81 positive place invariants in 127 ms returned sat
[2024-05-20 15:53:49] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 97 ms returned sat
[2024-05-20 15:53:57] [INFO ] After 7376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 15:53:58] [INFO ] After 1234ms SMT Verify possible using 12800 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 15:53:59] [INFO ] After 1785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 382 ms.
[2024-05-20 15:53:59] [INFO ] After 10508ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 6884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6884/6884 places, 13123/13123 transitions.
Applied a total of 0 rules in 1950 ms. Remains 6884 /6884 variables (removed 0) and now considering 13123/13123 (removed 0) transitions.
[2024-05-20 15:54:01] [INFO ] Invariant cache hit.
[2024-05-20 15:54:07] [INFO ] Implicit Places using invariants in 5405 ms returned []
Implicit Place search using SMT only with invariants took 5406 ms to find 0 implicit places.
[2024-05-20 15:54:07] [INFO ] Invariant cache hit.
[2024-05-20 15:54:15] [INFO ] Dead Transitions using invariants and state equation in 8699 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16058 ms. Remains : 6884/6884 places, 13123/13123 transitions.
Computed a total of 243 stabilizing places and 241 stable transitions
Computed a total of 243 stabilizing places and 241 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 321747 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{1=1}
Probabilistic random walk after 321747 steps, saw 310984 distinct states, run finished after 3002 ms. (steps per millisecond=107 ) properties seen :1
Running SMT prover for 1 properties.
[2024-05-20 15:54:19] [INFO ] Invariant cache hit.
[2024-05-20 15:54:20] [INFO ] [Real]Absence check using 81 positive place invariants in 127 ms returned sat
[2024-05-20 15:54:20] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 83 ms returned sat
[2024-05-20 15:54:27] [INFO ] After 7251ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 15:54:27] [INFO ] State equation strengthened by 12800 read => feed constraints.
[2024-05-20 15:54:29] [INFO ] After 1223ms SMT Verify possible using 12800 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 15:54:29] [INFO ] After 9516ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 15:54:29] [INFO ] [Nat]Absence check using 81 positive place invariants in 132 ms returned sat
[2024-05-20 15:54:30] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 95 ms returned sat
[2024-05-20 15:54:37] [INFO ] After 7133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 15:54:38] [INFO ] After 1261ms SMT Verify possible using 12800 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 15:54:39] [INFO ] After 1818ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 375 ms.
[2024-05-20 15:54:39] [INFO ] After 10292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 141 reset in 1908 ms.
Product exploration explored 100000 steps with 140 reset in 1921 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 6884 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6884/6884 places, 13123/13123 transitions.
Applied a total of 0 rules in 2174 ms. Remains 6884 /6884 variables (removed 0) and now considering 13123/13123 (removed 0) transitions.
[2024-05-20 15:54:46] [INFO ] Invariant cache hit.
[2024-05-20 15:54:54] [INFO ] Dead Transitions using invariants and state equation in 8664 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10840 ms. Remains : 6884/6884 places, 13123/13123 transitions.
Built C files in :
/tmp/ltsmin3948851902427087830
[2024-05-20 15:54:55] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3948851902427087830
Running compilation step : cd /tmp/ltsmin3948851902427087830;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3948851902427087830;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3948851902427087830;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 6884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6884/6884 places, 13123/13123 transitions.
Applied a total of 0 rules in 1938 ms. Remains 6884 /6884 variables (removed 0) and now considering 13123/13123 (removed 0) transitions.
[2024-05-20 15:55:00] [INFO ] Invariant cache hit.
[2024-05-20 15:55:05] [INFO ] Implicit Places using invariants in 5302 ms returned []
Implicit Place search using SMT only with invariants took 5302 ms to find 0 implicit places.
[2024-05-20 15:55:05] [INFO ] Invariant cache hit.
[2024-05-20 15:55:13] [INFO ] Dead Transitions using invariants and state equation in 8545 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15785 ms. Remains : 6884/6884 places, 13123/13123 transitions.
Built C files in :
/tmp/ltsmin4050711282793631334
[2024-05-20 15:55:13] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4050711282793631334
Running compilation step : cd /tmp/ltsmin4050711282793631334;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4050711282793631334;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4050711282793631334;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 15:55:17] [INFO ] Flatten gal took : 274 ms
[2024-05-20 15:55:17] [INFO ] Flatten gal took : 285 ms
[2024-05-20 15:55:17] [INFO ] Time to serialize gal into /tmp/LTL12513902214358778642.gal : 44 ms
[2024-05-20 15:55:17] [INFO ] Time to serialize properties into /tmp/LTL2295581466773436144.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/LTL12513902214358778642.gal' '-t' 'CGAL' '-hoa' '/tmp/aut236193997531984453.hoa' '-atoms' '/tmp/LTL2295581466773436144.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...317
Loading property file /tmp/LTL2295581466773436144.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut236193997531984453.hoa
Detected timeout of ITS tools.
[2024-05-20 15:55:33] [INFO ] Flatten gal took : 275 ms
[2024-05-20 15:55:33] [INFO ] Flatten gal took : 291 ms
[2024-05-20 15:55:33] [INFO ] Time to serialize gal into /tmp/LTL18070298650933015527.gal : 46 ms
[2024-05-20 15:55:33] [INFO ] Time to serialize properties into /tmp/LTL17425671309103237428.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/LTL18070298650933015527.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17425671309103237428.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...277
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((Node0IsInserted<1)||(Node74requestsent0<1))")))||(G("(Node78GiveAnswer42<1)"))))))
Formula 0 simplified : XX(GF!"((Node0IsInserted<1)||(Node74requestsent0<1))" & F!"(Node78GiveAnswer42<1)")
Detected timeout of ITS tools.
[2024-05-20 15:55:48] [INFO ] Flatten gal took : 277 ms
[2024-05-20 15:55:48] [INFO ] Applying decomposition
[2024-05-20 15:55:49] [INFO ] Flatten gal took : 292 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/graph15155023153052403367.txt' '-o' '/tmp/graph15155023153052403367.bin' '-w' '/tmp/graph15155023153052403367.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15155023153052403367.bin' '-l' '-1' '-v' '-w' '/tmp/graph15155023153052403367.weights' '-q' '0' '-e' '0.001'
[2024-05-20 15:55:49] [INFO ] Decomposing Gal with order
[2024-05-20 15:55:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 15:55:51] [INFO ] Removed a total of 12618 redundant transitions.
[2024-05-20 15:55:51] [INFO ] Flatten gal took : 1431 ms
[2024-05-20 15:55:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 12634 labels/synchronizations in 1512 ms.
[2024-05-20 15:55:53] [INFO ] Time to serialize gal into /tmp/LTL8287838544616461723.gal : 53 ms
[2024-05-20 15:55:53] [INFO ] Time to serialize properties into /tmp/LTL7763266741820862401.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/LTL8287838544616461723.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7763266741820862401.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((u63.Node0IsInserted<1)||(u76.Node74requestsent0<1))")))||(G("(i43.u44.Node78GiveAnswer42<1)"))))))
Formula 0 simplified : XX(GF!"((u63.Node0IsInserted<1)||(u76.Node74requestsent0<1))" & F!"(i43.u44.Node78GiveAnswer42<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16457948388429164823
[2024-05-20 15:56:08] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16457948388429164823
Running compilation step : cd /tmp/ltsmin16457948388429164823;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16457948388429164823;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16457948388429164823;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANConstruction-PT-080-LTLFireability-08 finished in 178190 ms.
[2024-05-20 15:56:11] [INFO ] Flatten gal took : 285 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13743477294792062169
[2024-05-20 15:56:12] [INFO ] Too many transitions (13800) to apply POR reductions. Disabling POR matrices.
[2024-05-20 15:56:12] [INFO ] Built C files in 135ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13743477294792062169
Running compilation step : cd /tmp/ltsmin13743477294792062169;'/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'
[2024-05-20 15:56:12] [INFO ] Applying decomposition
[2024-05-20 15:56:12] [INFO ] Flatten gal took : 320 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/graph16047453752588022848.txt' '-o' '/tmp/graph16047453752588022848.bin' '-w' '/tmp/graph16047453752588022848.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16047453752588022848.bin' '-l' '-1' '-v' '-w' '/tmp/graph16047453752588022848.weights' '-q' '0' '-e' '0.001'
[2024-05-20 15:56:13] [INFO ] Decomposing Gal with order
[2024-05-20 15:56:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 15:56:15] [INFO ] Removed a total of 12919 redundant transitions.
[2024-05-20 15:56:15] [INFO ] Flatten gal took : 1526 ms
[2024-05-20 15:56:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 28002 labels/synchronizations in 1702 ms.
[2024-05-20 15:56:17] [INFO ] Time to serialize gal into /tmp/LTLFireability14321052349950287898.gal : 76 ms
[2024-05-20 15:56:17] [INFO ] Time to serialize properties into /tmp/LTLFireability15340207201779312017.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/LTLFireability14321052349950287898.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15340207201779312017.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((i45.u325.Node0IsInserted<1)||(i79.u304.Node74requestsent0<1))")))||(G("(i41.u339.Node78GiveAnswer42<1)"))))))
Formula 0 simplified : XX(GF!"((i45.u325.Node0IsInserted<1)||(i79.u304.Node74requestsent0<1))" & F!"(i41.u339.Node78GiveAnswer42<1)")
Compilation finished in 113528 ms.
Running link step : cd /tmp/ltsmin13743477294792062169;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 119 ms.
Running LTSmin : cd /tmp/ltsmin13743477294792062169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>([]((LTLAPp0==true)))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-20 16:20:36] [INFO ] Flatten gal took : 982 ms
[2024-05-20 16:20:36] [INFO ] Time to serialize gal into /tmp/LTLFireability16779585238682754344.gal : 89 ms
[2024-05-20 16:20:36] [INFO ] Time to serialize properties into /tmp/LTLFireability9637366978971191371.ltl : 4 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/LTLFireability16779585238682754344.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9637366978971191371.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 : !((X(X((F(G("((Node0IsInserted<1)||(Node74requestsent0<1))")))||(G("(Node78GiveAnswer42<1)"))))))
Formula 0 simplified : XX(GF!"((Node0IsInserted<1)||(Node74requestsent0<1))" & F!"(Node78GiveAnswer42<1)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4526932 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15922920 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="CANConstruction-PT-080"
export BK_EXAMINATION="LTLFireability"
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 CANConstruction-PT-080, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r087-tall-171620521400043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-080.tgz
mv CANConstruction-PT-080 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;