About the Execution of ITS-Tools for CANInsertWithFailure-PT-060
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16217.052 | 3600000.00 | 9567960.00 | 34787.30 | F?FF?FFTFFF?FFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872400052.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CANInsertWithFailure-PT-060, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872400052
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 7.8K May 30 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 30 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 30 15:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 30 15:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 25 12:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 25 12:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 25 12:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 25 12:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 11K May 30 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K May 30 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 30 15:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K May 30 15:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 25 12:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 25 12:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 22M May 29 12:20 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 CANInsertWithFailure-PT-060-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1654705896443
Running Version 202205111006
[2022-06-08 16:31:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-08 16:31:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 16:31:40] [INFO ] Load time of PNML (sax parser for PT used): 1370 ms
[2022-06-08 16:31:40] [INFO ] Transformed 7924 places.
[2022-06-08 16:31:40] [INFO ] Transformed 21960 transitions.
[2022-06-08 16:31:40] [INFO ] Parsed PT model containing 7924 places and 21960 transitions in 1642 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 7924 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7924/7924 places, 21960/21960 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7923 transition count 21960
Applied a total of 1 rules in 2644 ms. Remains 7923 /7924 variables (removed 1) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:31:47] [INFO ] Computed 62 place invariants in 3437 ms
[2022-06-08 16:31:49] [INFO ] Implicit Places using invariants in 5329 ms returned []
Implicit Place search using SMT only with invariants took 5381 ms to find 0 implicit places.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:31:53] [INFO ] Computed 62 place invariants in 3785 ms
[2022-06-08 16:31:54] [INFO ] Dead Transitions using invariants and state equation in 5452 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7923/7924 places, 21960/21960 transitions.
Finished structural reductions, in 1 iterations. Remains : 7923/7924 places, 21960/21960 transitions.
Support contains 45 out of 7923 places after structural reductions.
[2022-06-08 16:31:56] [INFO ] Flatten gal took : 1345 ms
[2022-06-08 16:31:57] [INFO ] Flatten gal took : 1008 ms
[2022-06-08 16:31:59] [INFO ] Input system was already deterministic with 21960 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 1558 ms. (steps per millisecond=6 ) properties (out of 35) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:32:04] [INFO ] Computed 62 place invariants in 3263 ms
[2022-06-08 16:32:10] [INFO ] [Real]Absence check using 60 positive place invariants in 126 ms returned sat
[2022-06-08 16:32:10] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 175 ms returned sat
[2022-06-08 16:32:29] [INFO ] After 16568ms SMT Verify possible using state equation in real domain returned unsat :0 sat :19
[2022-06-08 16:32:30] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2022-06-08 16:32:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-08 16:32:30] [INFO ] After 25236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 21 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 7923 transition count 21541
Reduce places removed 419 places and 0 transitions.
Iterating post reduction 1 with 419 rules applied. Total rules applied 838 place count 7504 transition count 21541
Performed 3525 Post agglomeration using F-continuation condition.Transition count delta: 3525
Deduced a syphon composed of 3525 places in 12 ms
Reduce places removed 3525 places and 0 transitions.
Iterating global reduction 2 with 7050 rules applied. Total rules applied 7888 place count 3979 transition count 18016
Drop transitions removed 3407 transitions
Redundant transition composition rules discarded 3407 transitions
Iterating global reduction 2 with 3407 rules applied. Total rules applied 11295 place count 3979 transition count 14609
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11297 place count 3979 transition count 14607
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11299 place count 3977 transition count 14607
Partial Free-agglomeration rule applied 3656 times.
Drop transitions removed 3656 transitions
Iterating global reduction 3 with 3656 rules applied. Total rules applied 14955 place count 3977 transition count 14607
Applied a total of 14955 rules in 10496 ms. Remains 3977 /7923 variables (removed 3946) and now considering 14607/21960 (removed 7353) transitions.
Finished structural reductions, in 1 iterations. Remains : 3977/7923 places, 14607/21960 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 856 ms. (steps per millisecond=11 ) properties (out of 20) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 14607 rows 3977 cols
[2022-06-08 16:32:42] [INFO ] Computed 62 place invariants in 732 ms
[2022-06-08 16:32:44] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2022-06-08 16:32:44] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 83 ms returned sat
[2022-06-08 16:33:00] [INFO ] After 15784ms SMT Verify possible using state equation in real domain returned unsat :0 sat :10
[2022-06-08 16:33:00] [INFO ] State equation strengthened by 14378 read => feed constraints.
[2022-06-08 16:33:07] [INFO ] After 6770ms SMT Verify possible using 14378 Read/Feed constraints in real domain returned unsat :0 sat :9
[2022-06-08 16:33:07] [INFO ] After 6771ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-08 16:33:07] [INFO ] After 25061ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :9
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 2 properties in 390 ms.
Support contains 8 out of 3977 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3977/3977 places, 14607/14607 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 3967 transition count 14597
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 3967 transition count 14597
Applied a total of 22 rules in 4002 ms. Remains 3967 /3977 variables (removed 10) and now considering 14597/14607 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 3967/3977 places, 14597/14607 transitions.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 804 ms. (steps per millisecond=12 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 14597 rows 3967 cols
[2022-06-08 16:33:13] [INFO ] Computed 62 place invariants in 723 ms
[2022-06-08 16:33:14] [INFO ] [Real]Absence check using 60 positive place invariants in 86 ms returned sat
[2022-06-08 16:33:14] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 91 ms returned sat
[2022-06-08 16:33:30] [INFO ] After 14801ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2022-06-08 16:33:30] [INFO ] State equation strengthened by 14400 read => feed constraints.
[2022-06-08 16:33:36] [INFO ] After 6228ms SMT Verify possible using 14400 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-08 16:33:36] [INFO ] After 22712ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-08 16:33:37] [INFO ] [Nat]Absence check using 60 positive place invariants in 90 ms returned sat
[2022-06-08 16:33:37] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 84 ms returned sat
[2022-06-08 16:33:48] [INFO ] After 10294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-08 16:33:54] [INFO ] After 6356ms SMT Verify possible using 14400 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-08 16:33:58] [INFO ] After 10573ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2608 ms.
[2022-06-08 16:34:01] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 4 properties in 36 ms.
Computed a total of 242 stabilizing places and 420 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(((p1 U p2)&&p0)))))'
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1761 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:34:07] [INFO ] Computed 62 place invariants in 3269 ms
[2022-06-08 16:34:08] [INFO ] Implicit Places using invariants in 4457 ms returned []
Implicit Place search using SMT only with invariants took 4458 ms to find 0 implicit places.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:34:11] [INFO ] Computed 62 place invariants in 3007 ms
[2022-06-08 16:34:12] [INFO ] Dead Transitions using invariants and state equation in 4360 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 431 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s3828 1), p1:(GEQ s6150 1), p0:(AND (GEQ s6150 1) (OR (LT s441 1) (LT s6097 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1744 steps with 0 reset in 131 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-00 finished in 11302 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U G(X(p1))))'
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1740 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:34:18] [INFO ] Computed 62 place invariants in 3100 ms
[2022-06-08 16:34:19] [INFO ] Implicit Places using invariants in 4351 ms returned []
Implicit Place search using SMT only with invariants took 4381 ms to find 0 implicit places.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:34:23] [INFO ] Computed 62 place invariants in 3545 ms
[2022-06-08 16:34:24] [INFO ] Dead Transitions using invariants and state equation in 4672 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s693 1) (GEQ s5895 1)), p0:(AND (GEQ s105 1) (GEQ s6993 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 24972 reset in 6759 ms.
Product exploration explored 100000 steps with 25032 reset in 6609 ms.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 489 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 75686 steps, run timeout after 3002 ms. (steps per millisecond=25 ) properties seen :{0=1}
Probabilistic random walk after 75686 steps, saw 73450 distinct states, run finished after 3003 ms. (steps per millisecond=25 ) properties seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:34:45] [INFO ] Computed 62 place invariants in 3419 ms
[2022-06-08 16:34:47] [INFO ] [Real]Absence check using 60 positive place invariants in 133 ms returned sat
[2022-06-08 16:34:48] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 191 ms returned sat
[2022-06-08 16:35:10] [INFO ] After 25012ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-08 16:35:12] [INFO ] [Nat]Absence check using 60 positive place invariants in 112 ms returned sat
[2022-06-08 16:35:12] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 172 ms returned sat
[2022-06-08 16:35:35] [INFO ] After 22708ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-08 16:35:36] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2022-06-08 16:35:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-08 16:35:36] [INFO ] After 25213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 116 ms.
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 7923 transition count 21542
Reduce places removed 418 places and 0 transitions.
Iterating post reduction 1 with 418 rules applied. Total rules applied 836 place count 7505 transition count 21542
Performed 3540 Post agglomeration using F-continuation condition.Transition count delta: 3540
Deduced a syphon composed of 3540 places in 11 ms
Reduce places removed 3540 places and 0 transitions.
Iterating global reduction 2 with 7080 rules applied. Total rules applied 7916 place count 3965 transition count 18002
Drop transitions removed 3422 transitions
Redundant transition composition rules discarded 3422 transitions
Iterating global reduction 2 with 3422 rules applied. Total rules applied 11338 place count 3965 transition count 14580
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11341 place count 3965 transition count 14577
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 11344 place count 3962 transition count 14577
Partial Free-agglomeration rule applied 3659 times.
Drop transitions removed 3659 transitions
Iterating global reduction 3 with 3659 rules applied. Total rules applied 15003 place count 3962 transition count 14577
Applied a total of 15003 rules in 9287 ms. Remains 3962 /7923 variables (removed 3961) and now considering 14577/21960 (removed 7383) transitions.
Finished structural reductions, in 1 iterations. Remains : 3962/7923 places, 14577/21960 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 556 ms. (steps per millisecond=17 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14577 rows 3962 cols
[2022-06-08 16:35:46] [INFO ] Computed 62 place invariants in 737 ms
[2022-06-08 16:35:47] [INFO ] [Real]Absence check using 60 positive place invariants in 56 ms returned sat
[2022-06-08 16:35:47] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 80 ms returned sat
[2022-06-08 16:35:57] [INFO ] After 10122ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 16:35:58] [INFO ] State equation strengthened by 14396 read => feed constraints.
[2022-06-08 16:36:01] [INFO ] After 3515ms SMT Verify possible using 14396 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 16:36:01] [INFO ] After 14714ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 16:36:02] [INFO ] [Nat]Absence check using 60 positive place invariants in 54 ms returned sat
[2022-06-08 16:36:02] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 65 ms returned sat
[2022-06-08 16:36:11] [INFO ] After 9140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 16:36:16] [INFO ] After 5142ms SMT Verify possible using 14396 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 16:36:17] [INFO ] After 6127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 932 ms.
[2022-06-08 16:36:18] [INFO ] After 17142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 3962 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3962/3962 places, 14577/14577 transitions.
Applied a total of 0 rules in 1585 ms. Remains 3962 /3962 variables (removed 0) and now considering 14577/14577 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3962/3962 places, 14577/14577 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 418 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:36:24] [INFO ] Computed 62 place invariants in 3214 ms
Could not prove EG (NOT p1)
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 7923 transition count 21542
Reduce places removed 418 places and 0 transitions.
Iterating post reduction 1 with 418 rules applied. Total rules applied 836 place count 7505 transition count 21542
Performed 3540 Post agglomeration using F-continuation condition.Transition count delta: 3540
Deduced a syphon composed of 3540 places in 7 ms
Reduce places removed 3540 places and 0 transitions.
Iterating global reduction 2 with 7080 rules applied. Total rules applied 7916 place count 3965 transition count 18002
Drop transitions removed 3422 transitions
Redundant transition composition rules discarded 3422 transitions
Iterating global reduction 2 with 3422 rules applied. Total rules applied 11338 place count 3965 transition count 14580
Applied a total of 11338 rules in 7026 ms. Remains 3965 /7923 variables (removed 3958) and now considering 14580/21960 (removed 7380) transitions.
// Phase 1: matrix 14580 rows 3965 cols
[2022-06-08 16:36:48] [INFO ] Computed 62 place invariants in 1718 ms
[2022-06-08 16:36:49] [INFO ] Implicit Places using invariants in 2537 ms returned []
Implicit Place search using SMT only with invariants took 2544 ms to find 0 implicit places.
// Phase 1: matrix 14580 rows 3965 cols
[2022-06-08 16:36:50] [INFO ] Computed 62 place invariants in 1340 ms
[2022-06-08 16:37:02] [INFO ] Dead Transitions using invariants and state equation in 13677 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3965/7923 places, 14580/21960 transitions.
Finished structural reductions, in 1 iterations. Remains : 3965/7923 places, 14580/21960 transitions.
Computed a total of 185 stabilizing places and 302 stable transitions
Computed a total of 185 stabilizing places and 302 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 426 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 447 ms. (steps per millisecond=22 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 14580 rows 3965 cols
[2022-06-08 16:37:05] [INFO ] Computed 62 place invariants in 1543 ms
[2022-06-08 16:37:06] [INFO ] [Real]Absence check using 60 positive place invariants in 48 ms returned sat
[2022-06-08 16:37:06] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 68 ms returned sat
[2022-06-08 16:37:14] [INFO ] After 8209ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-06-08 16:37:15] [INFO ] State equation strengthened by 10738 read => feed constraints.
[2022-06-08 16:37:17] [INFO ] After 2773ms SMT Verify possible using 10738 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-08 16:37:17] [INFO ] After 12171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-08 16:37:18] [INFO ] [Nat]Absence check using 60 positive place invariants in 71 ms returned sat
[2022-06-08 16:37:18] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 64 ms returned sat
[2022-06-08 16:37:26] [INFO ] After 7412ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-08 16:37:31] [INFO ] After 4873ms SMT Verify possible using 10738 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-08 16:37:33] [INFO ] After 7183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1425 ms.
[2022-06-08 16:37:34] [INFO ] After 16979ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 3965 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3965/3965 places, 14580/14580 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 3965 transition count 14577
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 3962 transition count 14577
Partial Free-agglomeration rule applied 3659 times.
Drop transitions removed 3659 transitions
Iterating global reduction 1 with 3659 rules applied. Total rules applied 3665 place count 3962 transition count 14577
Applied a total of 3665 rules in 3594 ms. Remains 3962 /3965 variables (removed 3) and now considering 14577/14580 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 3962/3965 places, 14577/14580 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14577 rows 3962 cols
[2022-06-08 16:37:39] [INFO ] Computed 62 place invariants in 671 ms
[2022-06-08 16:37:40] [INFO ] [Real]Absence check using 60 positive place invariants in 47 ms returned sat
[2022-06-08 16:37:40] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 70 ms returned sat
[2022-06-08 16:37:48] [INFO ] After 8453ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 16:37:49] [INFO ] State equation strengthened by 14396 read => feed constraints.
[2022-06-08 16:37:52] [INFO ] After 3131ms SMT Verify possible using 14396 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 16:37:52] [INFO ] After 12696ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 16:37:53] [INFO ] [Nat]Absence check using 60 positive place invariants in 72 ms returned sat
[2022-06-08 16:37:53] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 100 ms returned sat
[2022-06-08 16:38:00] [INFO ] After 6966ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 16:38:05] [INFO ] After 4760ms SMT Verify possible using 14396 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 16:38:06] [INFO ] After 5803ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 749 ms.
[2022-06-08 16:38:06] [INFO ] After 14653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 3962 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3962/3962 places, 14577/14577 transitions.
Applied a total of 0 rules in 1309 ms. Remains 3962 /3962 variables (removed 0) and now considering 14577/14577 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3962/3962 places, 14577/14577 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 52921 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 52921 steps, saw 29364 distinct states, run finished after 3002 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14577 rows 3962 cols
[2022-06-08 16:38:12] [INFO ] Computed 62 place invariants in 1065 ms
[2022-06-08 16:38:13] [INFO ] [Real]Absence check using 60 positive place invariants in 47 ms returned sat
[2022-06-08 16:38:13] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 69 ms returned sat
[2022-06-08 16:38:22] [INFO ] After 8844ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 16:38:22] [INFO ] State equation strengthened by 14396 read => feed constraints.
[2022-06-08 16:38:25] [INFO ] After 3261ms SMT Verify possible using 14396 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 16:38:25] [INFO ] After 13303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 16:38:26] [INFO ] [Nat]Absence check using 60 positive place invariants in 48 ms returned sat
[2022-06-08 16:38:26] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 67 ms returned sat
[2022-06-08 16:38:35] [INFO ] After 8474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 16:38:40] [INFO ] After 5461ms SMT Verify possible using 14396 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 16:38:41] [INFO ] After 6376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 608 ms.
[2022-06-08 16:38:42] [INFO ] After 16367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 3962 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3962/3962 places, 14577/14577 transitions.
Applied a total of 0 rules in 1336 ms. Remains 3962 /3962 variables (removed 0) and now considering 14577/14577 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3962/3962 places, 14577/14577 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3962/3962 places, 14577/14577 transitions.
Applied a total of 0 rules in 1230 ms. Remains 3962 /3962 variables (removed 0) and now considering 14577/14577 (removed 0) transitions.
// Phase 1: matrix 14577 rows 3962 cols
[2022-06-08 16:38:45] [INFO ] Computed 62 place invariants in 782 ms
[2022-06-08 16:38:51] [INFO ] Implicit Places using invariants in 6187 ms returned []
Implicit Place search using SMT only with invariants took 6191 ms to find 0 implicit places.
// Phase 1: matrix 14577 rows 3962 cols
[2022-06-08 16:38:51] [INFO ] Computed 62 place invariants in 719 ms
[2022-06-08 16:39:05] [INFO ] Dead Transitions using invariants and state equation in 14615 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3962/3962 places, 14577/14577 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 417 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
// Phase 1: matrix 14580 rows 3965 cols
[2022-06-08 16:39:07] [INFO ] Computed 62 place invariants in 1217 ms
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
Product exploration explored 100000 steps with 33325 reset in 5480 ms.
Product exploration explored 100000 steps with 33243 reset in 5632 ms.
Built C files in :
/tmp/ltsmin10914788037171646620
[2022-06-08 16:39:34] [INFO ] Too many transitions (14580) to apply POR reductions. Disabling POR matrices.
[2022-06-08 16:39:34] [INFO ] Built C files in 279ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10914788037171646620
Running compilation step : cd /tmp/ltsmin10914788037171646620;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin10914788037171646620;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10914788037171646620;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 3965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3965/3965 places, 14580/14580 transitions.
Applied a total of 0 rules in 1158 ms. Remains 3965 /3965 variables (removed 0) and now considering 14580/14580 (removed 0) transitions.
// Phase 1: matrix 14580 rows 3965 cols
[2022-06-08 16:39:40] [INFO ] Computed 62 place invariants in 1375 ms
[2022-06-08 16:39:42] [INFO ] Implicit Places using invariants in 3449 ms returned []
Implicit Place search using SMT only with invariants took 3450 ms to find 0 implicit places.
// Phase 1: matrix 14580 rows 3965 cols
[2022-06-08 16:39:43] [INFO ] Computed 62 place invariants in 1319 ms
[2022-06-08 16:40:05] [INFO ] Dead Transitions using invariants and state equation in 23790 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3965/3965 places, 14580/14580 transitions.
Built C files in :
/tmp/ltsmin4560829204160557428
[2022-06-08 16:40:06] [INFO ] Too many transitions (14580) to apply POR reductions. Disabling POR matrices.
[2022-06-08 16:40:06] [INFO ] Built C files in 241ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4560829204160557428
Running compilation step : cd /tmp/ltsmin4560829204160557428;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin4560829204160557428;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4560829204160557428;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-08 16:40:10] [INFO ] Flatten gal took : 453 ms
[2022-06-08 16:40:11] [INFO ] Flatten gal took : 515 ms
[2022-06-08 16:40:11] [INFO ] Time to serialize gal into /tmp/LTL3841451058154222356.gal : 160 ms
[2022-06-08 16:40:11] [INFO ] Time to serialize properties into /tmp/LTL16127067908705071481.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3841451058154222356.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16127067908705071481.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3841451...267
Read 1 LTL properties
Checking formula 0 : !(((G(F(!("((Node7IsInserted>=1)&&(Node52requestsent7>=1))"))))U(G(X("((Node49IsInserted>=1)&&(Node42requestsent49>=1))")))))
Formula 0 simplified : !(GF!"((Node7IsInserted>=1)&&(Node52requestsent7>=1))" U GX"((Node49IsInserted>=1)&&(Node42requestsent49>=1))")
Detected timeout of ITS tools.
[2022-06-08 16:40:26] [INFO ] Flatten gal took : 457 ms
[2022-06-08 16:40:26] [INFO ] Applying decomposition
[2022-06-08 16:40:27] [INFO ] Flatten gal took : 477 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11483801702382376666.txt' '-o' '/tmp/graph11483801702382376666.bin' '-w' '/tmp/graph11483801702382376666.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11483801702382376666.bin' '-l' '-1' '-v' '-w' '/tmp/graph11483801702382376666.weights' '-q' '0' '-e' '0.001'
[2022-06-08 16:40:29] [INFO ] Decomposing Gal with order
[2022-06-08 16:40:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 16:40:34] [INFO ] Removed a total of 10807 redundant transitions.
[2022-06-08 16:40:35] [INFO ] Flatten gal took : 4934 ms
[2022-06-08 16:40:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 7081 labels/synchronizations in 2657 ms.
[2022-06-08 16:40:38] [INFO ] Time to serialize gal into /tmp/LTL17909548966895697744.gal : 130 ms
[2022-06-08 16:40:38] [INFO ] Time to serialize properties into /tmp/LTL17969178076201962984.ltl : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17909548966895697744.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17969178076201962984.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1790954...247
Read 1 LTL properties
Checking formula 0 : !(((G(F(!("((u8.Node7IsInserted>=1)&&(u53.Node52requestsent7>=1))"))))U(G(X("((u50.Node49IsInserted>=1)&&(u43.Node42requestsent49>=1))...161
Formula 0 simplified : !(GF!"((u8.Node7IsInserted>=1)&&(u53.Node52requestsent7>=1))" U GX"((u50.Node49IsInserted>=1)&&(u43.Node42requestsent49>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2849239930483634460
[2022-06-08 16:40:54] [INFO ] Built C files in 145ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2849239930483634460
Running compilation step : cd /tmp/ltsmin2849239930483634460;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin2849239930483634460;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2849239930483634460;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-01 finished in 403593 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X(G((G(p0)&&G(p1))))))&&X(p2)))'
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 3938 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:41:06] [INFO ] Computed 62 place invariants in 5514 ms
[2022-06-08 16:41:07] [INFO ] Implicit Places using invariants in 6807 ms returned []
Implicit Place search using SMT only with invariants took 6812 ms to find 0 implicit places.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:41:12] [INFO ] Computed 62 place invariants in 4255 ms
[2022-06-08 16:41:13] [INFO ] Dead Transitions using invariants and state equation in 5298 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LT s4474 1), p0:(GEQ s1190 1), p1:(GEQ s3442 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]]
Stuttering criterion allowed to conclude after 1696 steps with 0 reset in 113 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-02 finished in 16504 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 5533 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:41:24] [INFO ] Computed 62 place invariants in 5077 ms
[2022-06-08 16:41:25] [INFO ] Implicit Places using invariants in 6249 ms returned []
Implicit Place search using SMT only with invariants took 6250 ms to find 0 implicit places.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:41:30] [INFO ] Computed 62 place invariants in 5065 ms
[2022-06-08 16:41:31] [INFO ] Dead Transitions using invariants and state equation in 6220 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s651 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]]
Stuttering criterion allowed to conclude after 2160 steps with 2 reset in 79 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-03 finished in 18292 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(((!G((p0 U p1)) U !F(p0))||!p0)))))'
Support contains 2 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 3422 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:41:40] [INFO ] Computed 62 place invariants in 5051 ms
[2022-06-08 16:41:42] [INFO ] Implicit Places using invariants in 6802 ms returned []
Implicit Place search using SMT only with invariants took 6812 ms to find 0 implicit places.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:41:49] [INFO ] Computed 62 place invariants in 7053 ms
[2022-06-08 16:41:51] [INFO ] Dead Transitions using invariants and state equation in 9156 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 654 ms :[p0, p0, p0, p1]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s1911 1), p1:(GEQ s5914 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 69 reset in 3720 ms.
Product exploration explored 100000 steps with 69 reset in 4768 ms.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 184 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 498 ms :[p0, p0, p0, p1]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 756 ms. (steps per millisecond=13 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 37791 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37791 steps, saw 36973 distinct states, run finished after 3005 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:42:12] [INFO ] Computed 62 place invariants in 6368 ms
[2022-06-08 16:42:14] [INFO ] [Real]Absence check using 60 positive place invariants in 132 ms returned sat
[2022-06-08 16:42:14] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 188 ms returned sat
[2022-06-08 16:42:37] [INFO ] After 25018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 16:42:39] [INFO ] [Nat]Absence check using 60 positive place invariants in 172 ms returned sat
[2022-06-08 16:42:39] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 232 ms returned sat
[2022-06-08 16:43:02] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3539 Post agglomeration using F-continuation condition.Transition count delta: 3539
Deduced a syphon composed of 3539 places in 13 ms
Reduce places removed 3539 places and 0 transitions.
Iterating global reduction 2 with 7078 rules applied. Total rules applied 7918 place count 3964 transition count 18001
Drop transitions removed 3421 transitions
Redundant transition composition rules discarded 3421 transitions
Iterating global reduction 2 with 3421 rules applied. Total rules applied 11339 place count 3964 transition count 14580
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11340 place count 3964 transition count 14579
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11341 place count 3963 transition count 14579
Partial Free-agglomeration rule applied 3660 times.
Drop transitions removed 3660 transitions
Iterating global reduction 3 with 3660 rules applied. Total rules applied 15001 place count 3963 transition count 14579
Applied a total of 15001 rules in 15814 ms. Remains 3963 /7923 variables (removed 3960) and now considering 14579/21960 (removed 7381) transitions.
Finished structural reductions, in 1 iterations. Remains : 3963/7923 places, 14579/21960 transitions.
Incomplete random walk after 10000 steps, including 37 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14579 rows 3963 cols
[2022-06-08 16:43:19] [INFO ] Computed 62 place invariants in 831 ms
[2022-06-08 16:43:19] [INFO ] [Real]Absence check using 60 positive place invariants in 59 ms returned sat
[2022-06-08 16:43:19] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 82 ms returned sat
[2022-06-08 16:43:40] [INFO ] After 21141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3963/3963 places, 14579/14579 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3963 transition count 14579
Applied a total of 1 rules in 2688 ms. Remains 3963 /3963 variables (removed 0) and now considering 14579/14579 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3963/3963 places, 14579/14579 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 202 ms :[p0, p0, p0, p1]
Stuttering acceptance computed with spot in 250 ms :[p0, p0, p0, p1]
Support contains 2 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 2731 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:43:50] [INFO ] Computed 62 place invariants in 3630 ms
[2022-06-08 16:43:51] [INFO ] Implicit Places using invariants in 4812 ms returned []
Implicit Place search using SMT only with invariants took 4816 ms to find 0 implicit places.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:43:55] [INFO ] Computed 62 place invariants in 3780 ms
[2022-06-08 16:43:56] [INFO ] Dead Transitions using invariants and state equation in 5033 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7923/7923 places, 21960/21960 transitions.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 210 ms :[p0, p0, p0, p1]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:44:01] [INFO ] Computed 62 place invariants in 3853 ms
[2022-06-08 16:44:02] [INFO ] [Real]Absence check using 60 positive place invariants in 124 ms returned sat
[2022-06-08 16:44:03] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 222 ms returned sat
[2022-06-08 16:44:26] [INFO ] After 25030ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3539 Post agglomeration using F-continuation condition.Transition count delta: 3539
Deduced a syphon composed of 3539 places in 15 ms
Reduce places removed 3539 places and 0 transitions.
Iterating global reduction 2 with 7078 rules applied. Total rules applied 7918 place count 3964 transition count 18001
Drop transitions removed 3421 transitions
Redundant transition composition rules discarded 3421 transitions
Iterating global reduction 2 with 3421 rules applied. Total rules applied 11339 place count 3964 transition count 14580
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11340 place count 3964 transition count 14579
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11341 place count 3963 transition count 14579
Partial Free-agglomeration rule applied 3661 times.
Drop transitions removed 3661 transitions
Iterating global reduction 3 with 3661 rules applied. Total rules applied 15002 place count 3963 transition count 14579
Applied a total of 15002 rules in 12636 ms. Remains 3963 /7923 variables (removed 3960) and now considering 14579/21960 (removed 7381) transitions.
Finished structural reductions, in 1 iterations. Remains : 3963/7923 places, 14579/21960 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 49201 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 49201 steps, saw 28937 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14579 rows 3963 cols
[2022-06-08 16:44:43] [INFO ] Computed 62 place invariants in 1039 ms
[2022-06-08 16:44:44] [INFO ] [Real]Absence check using 60 positive place invariants in 62 ms returned sat
[2022-06-08 16:44:44] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 82 ms returned sat
[2022-06-08 16:44:56] [INFO ] After 11834ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 16:44:56] [INFO ] State equation strengthened by 14397 read => feed constraints.
[2022-06-08 16:45:00] [INFO ] After 3824ms SMT Verify possible using 14397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 16:45:00] [INFO ] After 16722ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 16:45:00] [INFO ] [Nat]Absence check using 60 positive place invariants in 73 ms returned sat
[2022-06-08 16:45:01] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 90 ms returned sat
[2022-06-08 16:45:15] [INFO ] After 14070ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 16:45:25] [INFO ] After 9967ms SMT Verify possible using 14397 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-06-08 16:45:25] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 28 ms.
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3963/3963 places, 14579/14579 transitions.
Applied a total of 0 rules in 2076 ms. Remains 3963 /3963 variables (removed 0) and now considering 14579/14579 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3963/3963 places, 14579/14579 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3963/3963 places, 14579/14579 transitions.
Applied a total of 0 rules in 2348 ms. Remains 3963 /3963 variables (removed 0) and now considering 14579/14579 (removed 0) transitions.
// Phase 1: matrix 14579 rows 3963 cols
[2022-06-08 16:45:30] [INFO ] Computed 62 place invariants in 853 ms
[2022-06-08 16:45:40] [INFO ] Implicit Places using invariants in 11355 ms returned []
Implicit Place search using SMT only with invariants took 11356 ms to find 0 implicit places.
// Phase 1: matrix 14579 rows 3963 cols
[2022-06-08 16:45:41] [INFO ] Computed 62 place invariants in 849 ms
[2022-06-08 16:46:04] [INFO ] Dead Transitions using invariants and state equation in 23357 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3963/3963 places, 14579/14579 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 2 factoid took 242 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 313 ms :[p0, p0, p0, p1]
Stuttering acceptance computed with spot in 295 ms :[p0, p0, p0, p1]
Stuttering acceptance computed with spot in 342 ms :[p0, p0, p0, p1]
Product exploration explored 100000 steps with 70 reset in 2241 ms.
Product exploration explored 100000 steps with 70 reset in 2175 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 426 ms :[p0, p0, p0, p1]
Support contains 2 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Performed 300 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 300 rules applied. Total rules applied 300 place count 7923 transition count 21960
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 60 Pre rules applied. Total rules applied 300 place count 7923 transition count 21960
Deduced a syphon composed of 360 places in 14 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 360 place count 7923 transition count 21960
Discarding 120 places :
Symmetric choice reduction at 1 with 120 rule applications. Total rules 480 place count 7803 transition count 21840
Deduced a syphon composed of 240 places in 12 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 600 place count 7803 transition count 21840
Performed 3599 Post agglomeration using F-continuation condition.Transition count delta: -6958
Deduced a syphon composed of 3839 places in 12 ms
Iterating global reduction 1 with 3599 rules applied. Total rules applied 4199 place count 7803 transition count 28798
Discarding 240 places :
Symmetric choice reduction at 1 with 240 rule applications. Total rules 4439 place count 7563 transition count 28558
Deduced a syphon composed of 3599 places in 13 ms
Iterating global reduction 1 with 240 rules applied. Total rules applied 4679 place count 7563 transition count 28558
Deduced a syphon composed of 3599 places in 8 ms
Applied a total of 4679 rules in 15579 ms. Remains 7563 /7923 variables (removed 360) and now considering 28558/21960 (removed -6598) transitions.
[2022-06-08 16:46:26] [INFO ] Flow matrix only has 25137 transitions (discarded 3421 similar events)
// Phase 1: matrix 25137 rows 7563 cols
[2022-06-08 16:46:30] [INFO ] Computed 62 place invariants in 4418 ms
[2022-06-08 16:46:31] [INFO ] Dead Transitions using invariants and state equation in 5553 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7563/7923 places, 28558/21960 transitions.
Finished structural reductions, in 1 iterations. Remains : 7563/7923 places, 28558/21960 transitions.
Product exploration explored 100000 steps with 333 reset in 3956 ms.
Product exploration explored 100000 steps with 330 reset in 3804 ms.
Built C files in :
/tmp/ltsmin11197082482732216704
[2022-06-08 16:46:40] [INFO ] Built C files in 190ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11197082482732216704
Running compilation step : cd /tmp/ltsmin11197082482732216704;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin11197082482732216704;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11197082482732216704;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 3136 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:46:50] [INFO ] Computed 62 place invariants in 3728 ms
[2022-06-08 16:46:53] [INFO ] Implicit Places using invariants in 6800 ms returned []
Implicit Place search using SMT only with invariants took 6819 ms to find 0 implicit places.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:46:56] [INFO ] Computed 62 place invariants in 3407 ms
[2022-06-08 16:46:59] [INFO ] Dead Transitions using invariants and state equation in 6585 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7923/7923 places, 21960/21960 transitions.
Built C files in :
/tmp/ltsmin2821265384268998406
[2022-06-08 16:47:00] [INFO ] Built C files in 316ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2821265384268998406
Running compilation step : cd /tmp/ltsmin2821265384268998406;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin2821265384268998406;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2821265384268998406;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-08 16:47:04] [INFO ] Flatten gal took : 663 ms
[2022-06-08 16:47:05] [INFO ] Flatten gal took : 707 ms
[2022-06-08 16:47:05] [INFO ] Time to serialize gal into /tmp/LTL13258823022129397944.gal : 134 ms
[2022-06-08 16:47:05] [INFO ] Time to serialize properties into /tmp/LTL6300237518535733807.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13258823022129397944.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6300237518535733807.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1325882...267
Read 1 LTL properties
Checking formula 0 : !((X(G(X(((!(G(("(Node9requestsent3>=1)")U("(Node42GiveAnswer58>=1)"))))U(!(F("(Node9requestsent3>=1)"))))||("(Node9requestsent3<1)"))...159
Formula 0 simplified : !XGX("(Node9requestsent3<1)" | (!G("(Node9requestsent3>=1)" U "(Node42GiveAnswer58>=1)") U !F"(Node9requestsent3>=1)"))
Detected timeout of ITS tools.
[2022-06-08 16:47:20] [INFO ] Flatten gal took : 668 ms
[2022-06-08 16:47:20] [INFO ] Applying decomposition
[2022-06-08 16:47:21] [INFO ] Flatten gal took : 712 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17770809832339618174.txt' '-o' '/tmp/graph17770809832339618174.bin' '-w' '/tmp/graph17770809832339618174.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17770809832339618174.bin' '-l' '-1' '-v' '-w' '/tmp/graph17770809832339618174.weights' '-q' '0' '-e' '0.001'
[2022-06-08 16:47:23] [INFO ] Decomposing Gal with order
[2022-06-08 16:47:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 16:47:26] [INFO ] Removed a total of 10826 redundant transitions.
[2022-06-08 16:47:27] [INFO ] Flatten gal took : 2411 ms
[2022-06-08 16:47:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 14710 labels/synchronizations in 3080 ms.
[2022-06-08 16:47:31] [INFO ] Time to serialize gal into /tmp/LTL7676265835309653566.gal : 181 ms
[2022-06-08 16:47:31] [INFO ] Time to serialize properties into /tmp/LTL7980289664762734200.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7676265835309653566.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7980289664762734200.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7676265...245
Read 1 LTL properties
Checking formula 0 : !((X(G(X(((!(G(("(i11.u38.Node9requestsent3>=1)")U("(i60.u232.Node42GiveAnswer58>=1)"))))U(!(F("(i11.u38.Node9requestsent3>=1)"))))||(...192
Formula 0 simplified : !XGX("(i11.u38.Node9requestsent3<1)" | (!G("(i11.u38.Node9requestsent3>=1)" U "(i60.u232.Node42GiveAnswer58>=1)") U !F"(i11.u38.Node...175
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17449462818949314315
[2022-06-08 16:47:46] [INFO ] Built C files in 158ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17449462818949314315
Running compilation step : cd /tmp/ltsmin17449462818949314315;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin17449462818949314315;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17449462818949314315;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-04 finished in 377541 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0 U p1))||G(p0)))'
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 7923 transition count 21542
Reduce places removed 418 places and 0 transitions.
Iterating post reduction 1 with 418 rules applied. Total rules applied 836 place count 7505 transition count 21542
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 836 place count 7505 transition count 21541
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 838 place count 7504 transition count 21541
Performed 3539 Post agglomeration using F-continuation condition.Transition count delta: 3539
Deduced a syphon composed of 3539 places in 17 ms
Reduce places removed 3539 places and 0 transitions.
Iterating global reduction 2 with 7078 rules applied. Total rules applied 7916 place count 3965 transition count 18002
Drop transitions removed 3422 transitions
Redundant transition composition rules discarded 3422 transitions
Iterating global reduction 2 with 3422 rules applied. Total rules applied 11338 place count 3965 transition count 14580
Applied a total of 11338 rules in 12230 ms. Remains 3965 /7923 variables (removed 3958) and now considering 14580/21960 (removed 7380) transitions.
// Phase 1: matrix 14580 rows 3965 cols
[2022-06-08 16:48:03] [INFO ] Computed 62 place invariants in 1238 ms
[2022-06-08 16:48:03] [INFO ] Implicit Places using invariants in 1867 ms returned []
Implicit Place search using SMT only with invariants took 1868 ms to find 0 implicit places.
// Phase 1: matrix 14580 rows 3965 cols
[2022-06-08 16:48:04] [INFO ] Computed 62 place invariants in 1202 ms
[2022-06-08 16:48:19] [INFO ] Dead Transitions using invariants and state equation in 15575 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3965/7923 places, 14580/21960 transitions.
Finished structural reductions, in 1 iterations. Remains : 3965/7923 places, 14580/21960 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s174 1) (GEQ s204 1)), p0:(GEQ s3643 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 320 steps with 0 reset in 9 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-05 finished in 29829 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 7923 transition count 21542
Reduce places removed 418 places and 0 transitions.
Iterating post reduction 1 with 418 rules applied. Total rules applied 836 place count 7505 transition count 21542
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 836 place count 7505 transition count 21541
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 838 place count 7504 transition count 21541
Performed 3538 Post agglomeration using F-continuation condition.Transition count delta: 3538
Deduced a syphon composed of 3538 places in 14 ms
Reduce places removed 3538 places and 0 transitions.
Iterating global reduction 2 with 7076 rules applied. Total rules applied 7914 place count 3966 transition count 18003
Drop transitions removed 3421 transitions
Redundant transition composition rules discarded 3421 transitions
Iterating global reduction 2 with 3421 rules applied. Total rules applied 11335 place count 3966 transition count 14582
Applied a total of 11335 rules in 13772 ms. Remains 3966 /7923 variables (removed 3957) and now considering 14582/21960 (removed 7378) transitions.
// Phase 1: matrix 14582 rows 3966 cols
[2022-06-08 16:48:34] [INFO ] Computed 62 place invariants in 1678 ms
[2022-06-08 16:48:35] [INFO ] Implicit Places using invariants in 2451 ms returned []
Implicit Place search using SMT only with invariants took 2452 ms to find 0 implicit places.
// Phase 1: matrix 14582 rows 3966 cols
[2022-06-08 16:48:37] [INFO ] Computed 62 place invariants in 1666 ms
[2022-06-08 16:48:37] [INFO ] Dead Transitions using invariants and state equation in 2368 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3966/7923 places, 14582/21960 transitions.
Finished structural reductions, in 1 iterations. Remains : 3966/7923 places, 14582/21960 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s77 1) (GEQ s109 1)), p1:(GEQ s2950 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 289 steps with 0 reset in 10 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-06 finished in 18795 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U G((p0 U !p1)))||X(p1)||p2)))'
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 7649 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:48:51] [INFO ] Computed 62 place invariants in 5255 ms
[2022-06-08 16:48:52] [INFO ] Implicit Places using invariants in 6488 ms returned []
Implicit Place search using SMT only with invariants took 6489 ms to find 0 implicit places.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:48:58] [INFO ] Computed 62 place invariants in 6099 ms
[2022-06-08 16:49:00] [INFO ] Dead Transitions using invariants and state equation in 7913 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 719 ms :[false, false, false, (AND (NOT p0) (NOT p1)), p1, (NOT p0), p1]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(OR (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(LT s499 1), p1:(AND (GEQ s7 1) (GEQ s418 1)), p0:(GEQ s4478 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 46850 steps with 23425 reset in 10001 ms.
Product exploration timeout after 53720 steps with 26860 reset in 10001 ms.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 5 factoid took 247 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-07 finished in 43309 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0 U F(p1)))&&X(p2)&&G(p0)&&p3)))'
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 5337 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:49:32] [INFO ] Computed 62 place invariants in 5252 ms
[2022-06-08 16:49:33] [INFO ] Implicit Places using invariants in 6889 ms returned []
Implicit Place search using SMT only with invariants took 6890 ms to find 0 implicit places.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:49:39] [INFO ] Computed 62 place invariants in 5656 ms
[2022-06-08 16:49:40] [INFO ] Dead Transitions using invariants and state equation in 7229 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p0), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p1) (NOT p3)), true]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p2 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 5}], [{ cond=(AND p3 p0), acceptance={} source=3 dest: 1}, { cond=(OR (NOT p3) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(GEQ s5259 1), p2:(GEQ s2916 1), p1:(LT s3024 1), p3:(GEQ s3136 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-08 finished in 19840 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((G(X(X(p0)))&&p1)))||X(p2)))'
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 6057 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:49:53] [INFO ] Computed 62 place invariants in 5869 ms
[2022-06-08 16:49:56] [INFO ] Implicit Places using invariants in 8745 ms returned []
Implicit Place search using SMT only with invariants took 8746 ms to find 0 implicit places.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:50:01] [INFO ] Computed 62 place invariants in 5351 ms
[2022-06-08 16:50:02] [INFO ] Dead Transitions using invariants and state equation in 6603 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 433 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=5, aps=[p2:(AND (GEQ s525 1) (GEQ s572 1)), p1:(GEQ s4598 1), p0:(GEQ s3622 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-09 finished in 21934 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 5779 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:50:14] [INFO ] Computed 62 place invariants in 5517 ms
[2022-06-08 16:50:15] [INFO ] Implicit Places using invariants in 6741 ms returned []
Implicit Place search using SMT only with invariants took 6742 ms to find 0 implicit places.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:50:21] [INFO ] Computed 62 place invariants in 5468 ms
[2022-06-08 16:50:22] [INFO ] Dead Transitions using invariants and state equation in 6831 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s399 1) (GEQ s897 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][false, false, false]]
Stuttering criterion allowed to conclude after 1510 steps with 0 reset in 64 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-10 finished in 19786 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X(G(F(p0)))))))'
Support contains 1 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3539 Post agglomeration using F-continuation condition.Transition count delta: 3539
Deduced a syphon composed of 3539 places in 28 ms
Reduce places removed 3539 places and 0 transitions.
Iterating global reduction 2 with 7078 rules applied. Total rules applied 7918 place count 3964 transition count 18001
Drop transitions removed 3421 transitions
Redundant transition composition rules discarded 3421 transitions
Iterating global reduction 2 with 3421 rules applied. Total rules applied 11339 place count 3964 transition count 14580
Applied a total of 11339 rules in 16029 ms. Remains 3964 /7923 variables (removed 3959) and now considering 14580/21960 (removed 7380) transitions.
// Phase 1: matrix 14580 rows 3964 cols
[2022-06-08 16:50:40] [INFO ] Computed 62 place invariants in 1648 ms
[2022-06-08 16:50:41] [INFO ] Implicit Places using invariants in 2900 ms returned []
Implicit Place search using SMT only with invariants took 2951 ms to find 0 implicit places.
// Phase 1: matrix 14580 rows 3964 cols
[2022-06-08 16:50:44] [INFO ] Computed 62 place invariants in 2433 ms
[2022-06-08 16:50:45] [INFO ] Dead Transitions using invariants and state equation in 3496 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3964/7923 places, 14580/21960 transitions.
Finished structural reductions, in 1 iterations. Remains : 3964/7923 places, 14580/21960 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-11 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:(LT s3647 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 335 reset in 3977 ms.
Product exploration explored 100000 steps with 331 reset in 3306 ms.
Computed a total of 183 stabilizing places and 300 stable transitions
Computed a total of 183 stabilizing places and 300 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 231 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Finished random walk after 9311 steps, including 30 resets, run visited all 1 properties in 413 ms. (steps per millisecond=22 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 221 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 3964 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3964/3964 places, 14580/14580 transitions.
Applied a total of 0 rules in 1995 ms. Remains 3964 /3964 variables (removed 0) and now considering 14580/14580 (removed 0) transitions.
// Phase 1: matrix 14580 rows 3964 cols
[2022-06-08 16:50:57] [INFO ] Computed 62 place invariants in 1502 ms
[2022-06-08 16:51:00] [INFO ] Implicit Places using invariants in 4487 ms returned []
Implicit Place search using SMT only with invariants took 4492 ms to find 0 implicit places.
// Phase 1: matrix 14580 rows 3964 cols
[2022-06-08 16:51:02] [INFO ] Computed 62 place invariants in 1747 ms
[2022-06-08 16:51:03] [INFO ] Dead Transitions using invariants and state equation in 2492 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3964/3964 places, 14580/14580 transitions.
Computed a total of 183 stabilizing places and 300 stable transitions
Computed a total of 183 stabilizing places and 300 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2012 steps, including 6 resets, run visited all 1 properties in 69 ms. (steps per millisecond=29 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 220 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 329 reset in 3616 ms.
Product exploration explored 100000 steps with 330 reset in 3729 ms.
Built C files in :
/tmp/ltsmin17326143162845978424
[2022-06-08 16:51:11] [INFO ] Too many transitions (14580) to apply POR reductions. Disabling POR matrices.
[2022-06-08 16:51:11] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17326143162845978424
Running compilation step : cd /tmp/ltsmin17326143162845978424;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin17326143162845978424;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17326143162845978424;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 3964 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3964/3964 places, 14580/14580 transitions.
Applied a total of 0 rules in 2747 ms. Remains 3964 /3964 variables (removed 0) and now considering 14580/14580 (removed 0) transitions.
// Phase 1: matrix 14580 rows 3964 cols
[2022-06-08 16:51:19] [INFO ] Computed 62 place invariants in 2238 ms
[2022-06-08 16:51:20] [INFO ] Implicit Places using invariants in 3262 ms returned []
Implicit Place search using SMT only with invariants took 3263 ms to find 0 implicit places.
// Phase 1: matrix 14580 rows 3964 cols
[2022-06-08 16:51:23] [INFO ] Computed 62 place invariants in 2105 ms
[2022-06-08 16:51:43] [INFO ] Dead Transitions using invariants and state equation in 22700 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3964/3964 places, 14580/14580 transitions.
Built C files in :
/tmp/ltsmin6866420834822553200
[2022-06-08 16:51:43] [INFO ] Too many transitions (14580) to apply POR reductions. Disabling POR matrices.
[2022-06-08 16:51:43] [INFO ] Built C files in 201ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6866420834822553200
Running compilation step : cd /tmp/ltsmin6866420834822553200;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin6866420834822553200;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6866420834822553200;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-08 16:51:48] [INFO ] Flatten gal took : 795 ms
[2022-06-08 16:51:48] [INFO ] Flatten gal took : 430 ms
[2022-06-08 16:51:49] [INFO ] Time to serialize gal into /tmp/LTL16275401365486171270.gal : 169 ms
[2022-06-08 16:51:49] [INFO ] Time to serialize properties into /tmp/LTL6630352571395424856.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16275401365486171270.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6630352571395424856.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1627540...267
Read 1 LTL properties
Checking formula 0 : !((F(G(X(X(G(F("(Node54GiveAnswer43<1)"))))))))
Formula 0 simplified : !FGXXGF"(Node54GiveAnswer43<1)"
Detected timeout of ITS tools.
[2022-06-08 16:52:04] [INFO ] Flatten gal took : 587 ms
[2022-06-08 16:52:04] [INFO ] Applying decomposition
[2022-06-08 16:52:05] [INFO ] Flatten gal took : 796 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4665612585864542911.txt' '-o' '/tmp/graph4665612585864542911.bin' '-w' '/tmp/graph4665612585864542911.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4665612585864542911.bin' '-l' '-1' '-v' '-w' '/tmp/graph4665612585864542911.weights' '-q' '0' '-e' '0.001'
[2022-06-08 16:52:08] [INFO ] Decomposing Gal with order
[2022-06-08 16:52:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 16:52:12] [INFO ] Removed a total of 10843 redundant transitions.
[2022-06-08 16:52:13] [INFO ] Flatten gal took : 4088 ms
[2022-06-08 16:52:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 7081 labels/synchronizations in 2451 ms.
[2022-06-08 16:52:16] [INFO ] Time to serialize gal into /tmp/LTL3940538971081303904.gal : 66 ms
[2022-06-08 16:52:16] [INFO ] Time to serialize properties into /tmp/LTL17265294705977393262.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3940538971081303904.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17265294705977393262.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3940538...246
Read 1 LTL properties
Checking formula 0 : !((F(G(X(X(G(F("(u44.Node54GiveAnswer43<1)"))))))))
Formula 0 simplified : !FGXXGF"(u44.Node54GiveAnswer43<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1567239976113479385
[2022-06-08 16:52:31] [INFO ] Built C files in 130ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1567239976113479385
Running compilation step : cd /tmp/ltsmin1567239976113479385;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin1567239976113479385;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1567239976113479385;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-11 finished in 131353 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U ((F(p1)||p2)&&p0)))'
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3537 Post agglomeration using F-continuation condition.Transition count delta: 3537
Deduced a syphon composed of 3537 places in 38 ms
Reduce places removed 3537 places and 0 transitions.
Iterating global reduction 2 with 7074 rules applied. Total rules applied 7914 place count 3966 transition count 18003
Drop transitions removed 3419 transitions
Redundant transition composition rules discarded 3419 transitions
Iterating global reduction 2 with 3419 rules applied. Total rules applied 11333 place count 3966 transition count 14584
Applied a total of 11333 rules in 18850 ms. Remains 3966 /7923 variables (removed 3957) and now considering 14584/21960 (removed 7376) transitions.
// Phase 1: matrix 14584 rows 3966 cols
[2022-06-08 16:52:55] [INFO ] Computed 62 place invariants in 2422 ms
[2022-06-08 16:52:56] [INFO ] Implicit Places using invariants in 3565 ms returned []
Implicit Place search using SMT only with invariants took 3568 ms to find 0 implicit places.
// Phase 1: matrix 14584 rows 3966 cols
[2022-06-08 16:52:59] [INFO ] Computed 62 place invariants in 2379 ms
[2022-06-08 16:53:00] [INFO ] Dead Transitions using invariants and state equation in 3207 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3966/7923 places, 14584/21960 transitions.
Finished structural reductions, in 1 iterations. Remains : 3966/7923 places, 14584/21960 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (AND p0 p2) (AND p0 p1)), true, p1]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LT s580 1), p2:(GEQ s1359 1), p1:(GEQ s942 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1491 steps with 4 reset in 117 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-12 finished in 26107 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||X(F(p1))||p2))))'
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 7002 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:53:14] [INFO ] Computed 62 place invariants in 6980 ms
[2022-06-08 16:53:15] [INFO ] Implicit Places using invariants in 8252 ms returned []
Implicit Place search using SMT only with invariants took 8257 ms to find 0 implicit places.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:53:22] [INFO ] Computed 62 place invariants in 7092 ms
[2022-06-08 16:53:24] [INFO ] Dead Transitions using invariants and state equation in 9107 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 341 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p2:(AND (GEQ s35 1) (GEQ s614 1)), p0:(OR (LT s105 1) (LT s348 1)), p1:(GEQ s6030 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 74 reset in 3762 ms.
Product exploration explored 100000 steps with 77 reset in 4321 ms.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 356 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 4201 steps, including 3 resets, run visited all 2 properties in 221 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 595 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 359 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 360 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 6033 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:53:48] [INFO ] Computed 62 place invariants in 6696 ms
[2022-06-08 16:53:50] [INFO ] Implicit Places using invariants in 8676 ms returned []
Implicit Place search using SMT only with invariants took 8677 ms to find 0 implicit places.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:53:58] [INFO ] Computed 62 place invariants in 7508 ms
[2022-06-08 16:54:00] [INFO ] Dead Transitions using invariants and state equation in 9524 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7923/7923 places, 21960/21960 transitions.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 262 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 348 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 618 ms. (steps per millisecond=16 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:54:07] [INFO ] Computed 62 place invariants in 6260 ms
[2022-06-08 16:54:10] [INFO ] [Real]Absence check using 60 positive place invariants in 267 ms returned sat
[2022-06-08 16:54:11] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 413 ms returned sat
[2022-06-08 16:54:32] [INFO ] After 25037ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 416 transitions
Trivial Post-agglo rules discarded 416 transitions
Performed 416 trivial Post agglomeration. Transition count delta: 416
Iterating post reduction 0 with 416 rules applied. Total rules applied 416 place count 7923 transition count 21544
Reduce places removed 416 places and 0 transitions.
Iterating post reduction 1 with 416 rules applied. Total rules applied 832 place count 7507 transition count 21544
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 832 place count 7507 transition count 21542
Deduced a syphon composed of 2 places in 15 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 836 place count 7505 transition count 21542
Performed 3537 Post agglomeration using F-continuation condition.Transition count delta: 3537
Deduced a syphon composed of 3537 places in 32 ms
Reduce places removed 3537 places and 0 transitions.
Iterating global reduction 2 with 7074 rules applied. Total rules applied 7910 place count 3968 transition count 18005
Drop transitions removed 3421 transitions
Redundant transition composition rules discarded 3421 transitions
Iterating global reduction 2 with 3421 rules applied. Total rules applied 11331 place count 3968 transition count 14584
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11334 place count 3968 transition count 14581
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 11337 place count 3965 transition count 14581
Partial Free-agglomeration rule applied 3663 times.
Drop transitions removed 3663 transitions
Iterating global reduction 3 with 3663 rules applied. Total rules applied 15000 place count 3965 transition count 14581
Partial Free-agglomeration rule applied 120 times.
Drop transitions removed 120 transitions
Iterating global reduction 3 with 120 rules applied. Total rules applied 15120 place count 3965 transition count 14581
Applied a total of 15120 rules in 39169 ms. Remains 3965 /7923 variables (removed 3958) and now considering 14581/21960 (removed 7379) transitions.
Finished structural reductions, in 1 iterations. Remains : 3965/7923 places, 14581/21960 transitions.
Finished random walk after 186 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 585 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 365 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 396 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 78 reset in 4325 ms.
Stack based approach found an accepted trace after 23059 steps with 17 reset with depth 1497 and stack size 1497 in 739 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-14 finished in 138535 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))&&p1)))'
Support contains 2 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 7829 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:55:34] [INFO ] Computed 62 place invariants in 7568 ms
[2022-06-08 16:55:35] [INFO ] Implicit Places using invariants in 9013 ms returned []
Implicit Place search using SMT only with invariants took 9014 ms to find 0 implicit places.
// Phase 1: matrix 21960 rows 7923 cols
[2022-06-08 16:55:42] [INFO ] Computed 62 place invariants in 7012 ms
[2022-06-08 16:55:45] [INFO ] Dead Transitions using invariants and state equation in 9096 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 459 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(GEQ s2985 1), p0:(GEQ s1444 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-15 finished in 26574 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U G(X(p1))))'
Found a SL insensitive property : CANInsertWithFailure-PT-060-LTLFireability-01
Stuttering acceptance computed with spot in 537 ms :[(NOT p1), (NOT p1), p0, (AND p0 p1)]
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 7923 transition count 21542
Reduce places removed 418 places and 0 transitions.
Iterating post reduction 1 with 418 rules applied. Total rules applied 836 place count 7505 transition count 21542
Performed 3540 Post agglomeration using F-continuation condition.Transition count delta: 3540
Deduced a syphon composed of 3540 places in 16 ms
Reduce places removed 3540 places and 0 transitions.
Iterating global reduction 2 with 7080 rules applied. Total rules applied 7916 place count 3965 transition count 18002
Drop transitions removed 3422 transitions
Redundant transition composition rules discarded 3422 transitions
Iterating global reduction 2 with 3422 rules applied. Total rules applied 11338 place count 3965 transition count 14580
Applied a total of 11338 rules in 19533 ms. Remains 3965 /7923 variables (removed 3958) and now considering 14580/21960 (removed 7380) transitions.
// Phase 1: matrix 14580 rows 3965 cols
[2022-06-08 16:56:07] [INFO ] Computed 62 place invariants in 1857 ms
[2022-06-08 16:56:08] [INFO ] Implicit Places using invariants in 2857 ms returned []
Implicit Place search using SMT only with invariants took 2861 ms to find 0 implicit places.
// Phase 1: matrix 14580 rows 3965 cols
[2022-06-08 16:56:11] [INFO ] Computed 62 place invariants in 2212 ms
[2022-06-08 16:56:33] [INFO ] Dead Transitions using invariants and state equation in 24855 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 3965/7923 places, 14580/21960 transitions.
Finished structural reductions, in 1 iterations. Remains : 3965/7923 places, 14580/21960 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s300 1) (GEQ s2933 1)), p0:(AND (GEQ s47 1) (GEQ s3492 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 95430 steps with 23972 reset in 10001 ms.
Product exploration explored 100000 steps with 25045 reset in 9009 ms.
Computed a total of 185 stabilizing places and 302 stable transitions
Computed a total of 185 stabilizing places and 302 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 800 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 427 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 913 ms. (steps per millisecond=10 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 14580 rows 3965 cols
[2022-06-08 16:56:57] [INFO ] Computed 62 place invariants in 2399 ms
[2022-06-08 16:56:59] [INFO ] [Real]Absence check using 60 positive place invariants in 100 ms returned sat
[2022-06-08 16:56:59] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 157 ms returned sat
[2022-06-08 16:57:17] [INFO ] After 17642ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-06-08 16:57:17] [INFO ] State equation strengthened by 10738 read => feed constraints.
[2022-06-08 16:57:22] [INFO ] After 4854ms SMT Verify possible using 10738 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-08 16:57:22] [INFO ] After 24767ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-08 16:57:23] [INFO ] [Nat]Absence check using 60 positive place invariants in 55 ms returned sat
[2022-06-08 16:57:23] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 89 ms returned sat
[2022-06-08 16:57:39] [INFO ] After 15510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-08 16:57:47] [INFO ] After 8223ms SMT Verify possible using 10738 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-08 16:57:47] [INFO ] After 8224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-08 16:57:47] [INFO ] After 25083ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 8 ms.
Support contains 4 out of 3965 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3965/3965 places, 14580/14580 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 3965 transition count 14577
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 3962 transition count 14577
Partial Free-agglomeration rule applied 3659 times.
Drop transitions removed 3659 transitions
Iterating global reduction 1 with 3659 rules applied. Total rules applied 3665 place count 3962 transition count 14577
Applied a total of 3665 rules in 10085 ms. Remains 3962 /3965 variables (removed 3) and now considering 14577/14580 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 3962/3965 places, 14577/14580 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 508 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 35893 steps, run timeout after 3008 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35893 steps, saw 27075 distinct states, run finished after 3009 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14577 rows 3962 cols
[2022-06-08 16:58:03] [INFO ] Computed 62 place invariants in 1868 ms
[2022-06-08 16:58:04] [INFO ] [Real]Absence check using 60 positive place invariants in 101 ms returned sat
[2022-06-08 16:58:04] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 167 ms returned sat
[2022-06-08 16:58:27] [INFO ] After 22979ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 16:58:27] [INFO ] State equation strengthened by 14396 read => feed constraints.
[2022-06-08 16:58:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-08 16:58:28] [INFO ] After 25064ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 54 ms.
Support contains 4 out of 3962 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3962/3962 places, 14577/14577 transitions.
Applied a total of 0 rules in 4143 ms. Remains 3962 /3962 variables (removed 0) and now considering 14577/14577 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3962/3962 places, 14577/14577 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3962/3962 places, 14577/14577 transitions.
Applied a total of 0 rules in 4361 ms. Remains 3962 /3962 variables (removed 0) and now considering 14577/14577 (removed 0) transitions.
// Phase 1: matrix 14577 rows 3962 cols
[2022-06-08 16:58:38] [INFO ] Computed 62 place invariants in 1314 ms
[2022-06-08 16:58:46] [INFO ] Implicit Places using invariants in 9883 ms returned []
Implicit Place search using SMT only with invariants took 9885 ms to find 0 implicit places.
// Phase 1: matrix 14577 rows 3962 cols
[2022-06-08 16:58:48] [INFO ] Computed 62 place invariants in 1535 ms
[2022-06-08 16:58:49] [INFO ] Dead Transitions using invariants and state equation in 2762 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3962/3962 places, 14577/14577 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 1043 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 465 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 458 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
// Phase 1: matrix 14580 rows 3965 cols
[2022-06-08 16:58:54] [INFO ] Computed 62 place invariants in 2746 ms
Could not prove EG (NOT p1)
Support contains 4 out of 3965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3965/3965 places, 14580/14580 transitions.
Applied a total of 0 rules in 4355 ms. Remains 3965 /3965 variables (removed 0) and now considering 14580/14580 (removed 0) transitions.
// Phase 1: matrix 14580 rows 3965 cols
[2022-06-08 16:59:16] [INFO ] Computed 62 place invariants in 2373 ms
[2022-06-08 16:59:17] [INFO ] Implicit Places using invariants in 3283 ms returned []
Implicit Place search using SMT only with invariants took 3296 ms to find 0 implicit places.
// Phase 1: matrix 14580 rows 3965 cols
[2022-06-08 16:59:19] [INFO ] Computed 62 place invariants in 2631 ms
[2022-06-08 16:59:20] [INFO ] Dead Transitions using invariants and state equation in 3788 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3965/3965 places, 14580/14580 transitions.
Computed a total of 185 stabilizing places and 302 stable transitions
Computed a total of 185 stabilizing places and 302 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 863 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 365 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 1020 ms. (steps per millisecond=9 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 32568 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 32568 steps, saw 29524 distinct states, run finished after 3002 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 14580 rows 3965 cols
[2022-06-08 16:59:29] [INFO ] Computed 62 place invariants in 2451 ms
[2022-06-08 16:59:30] [INFO ] [Real]Absence check using 60 positive place invariants in 126 ms returned sat
[2022-06-08 16:59:31] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 158 ms returned sat
[2022-06-08 16:59:51] [INFO ] After 20215ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2022-06-08 16:59:51] [INFO ] State equation strengthened by 10738 read => feed constraints.
[2022-06-08 16:59:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-08 16:59:54] [INFO ] After 25036ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 3965 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3965/3965 places, 14580/14580 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 3965 transition count 14577
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 3962 transition count 14577
Partial Free-agglomeration rule applied 3659 times.
Drop transitions removed 3659 transitions
Iterating global reduction 1 with 3659 rules applied. Total rules applied 3665 place count 3962 transition count 14577
Applied a total of 3665 rules in 13741 ms. Remains 3962 /3965 variables (removed 3) and now considering 14577/14580 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 3962/3965 places, 14577/14580 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 961 ms. (steps per millisecond=10 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14577 rows 3962 cols
[2022-06-08 17:00:10] [INFO ] Computed 62 place invariants in 1426 ms
[2022-06-08 17:00:11] [INFO ] [Real]Absence check using 60 positive place invariants in 118 ms returned sat
[2022-06-08 17:00:12] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 167 ms returned sat
[2022-06-08 17:00:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-08 17:00:35] [INFO ] After 25060ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3962 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3962/3962 places, 14577/14577 transitions.
Applied a total of 0 rules in 5164 ms. Remains 3962 /3962 variables (removed 0) and now considering 14577/14577 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3962/3962 places, 14577/14577 transitions.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 535 ms. (steps per millisecond=18 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 34934 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 34934 steps, saw 26936 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14577 rows 3962 cols
[2022-06-08 17:00:45] [INFO ] Computed 62 place invariants in 1164 ms
[2022-06-08 17:00:46] [INFO ] [Real]Absence check using 60 positive place invariants in 128 ms returned sat
[2022-06-08 17:00:47] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 170 ms returned sat
[2022-06-08 17:01:10] [INFO ] After 25051ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3962 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3962/3962 places, 14577/14577 transitions.
Applied a total of 0 rules in 2575 ms. Remains 3962 /3962 variables (removed 0) and now considering 14577/14577 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3962/3962 places, 14577/14577 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3962/3962 places, 14577/14577 transitions.
Applied a total of 0 rules in 2134 ms. Remains 3962 /3962 variables (removed 0) and now considering 14577/14577 (removed 0) transitions.
// Phase 1: matrix 14577 rows 3962 cols
[2022-06-08 17:01:16] [INFO ] Computed 62 place invariants in 930 ms
[2022-06-08 17:01:17] [INFO ] Implicit Places using invariants in 1912 ms returned []
Implicit Place search using SMT only with invariants took 1914 ms to find 0 implicit places.
// Phase 1: matrix 14577 rows 3962 cols
[2022-06-08 17:01:18] [INFO ] Computed 62 place invariants in 972 ms
[2022-06-08 17:01:34] [INFO ] Dead Transitions using invariants and state equation in 17730 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3962/3962 places, 14577/14577 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 747 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
// Phase 1: matrix 14580 rows 3965 cols
[2022-06-08 17:01:37] [INFO ] Computed 62 place invariants in 1590 ms
[2022-06-08 17:01:52] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2022-06-08 17:01:52] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 64 ms returned sat
[2022-06-08 17:01:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:518)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runSLCLLTLTest(LTLPropertySolver.java:277)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:687)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-08 17:01:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
Product exploration explored 100000 steps with 33302 reset in 5342 ms.
Product exploration explored 100000 steps with 33251 reset in 6149 ms.
Built C files in :
/tmp/ltsmin2951528656234789779
[2022-06-08 17:02:04] [INFO ] Too many transitions (14580) to apply POR reductions. Disabling POR matrices.
[2022-06-08 17:02:04] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2951528656234789779
Running compilation step : cd /tmp/ltsmin2951528656234789779;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin2951528656234789779;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2951528656234789779;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 3965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3965/3965 places, 14580/14580 transitions.
Applied a total of 0 rules in 2260 ms. Remains 3965 /3965 variables (removed 0) and now considering 14580/14580 (removed 0) transitions.
// Phase 1: matrix 14580 rows 3965 cols
[2022-06-08 17:02:11] [INFO ] Computed 62 place invariants in 1529 ms
[2022-06-08 17:02:12] [INFO ] Implicit Places using invariants in 2547 ms returned []
Implicit Place search using SMT only with invariants took 2548 ms to find 0 implicit places.
// Phase 1: matrix 14580 rows 3965 cols
[2022-06-08 17:02:13] [INFO ] Computed 62 place invariants in 1520 ms
[2022-06-08 17:02:14] [INFO ] Dead Transitions using invariants and state equation in 2547 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3965/3965 places, 14580/14580 transitions.
Built C files in :
/tmp/ltsmin8872994391183109064
[2022-06-08 17:02:15] [INFO ] Too many transitions (14580) to apply POR reductions. Disabling POR matrices.
[2022-06-08 17:02:15] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8872994391183109064
Running compilation step : cd /tmp/ltsmin8872994391183109064;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin8872994391183109064;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8872994391183109064;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-08 17:02:19] [INFO ] Flatten gal took : 606 ms
[2022-06-08 17:02:20] [INFO ] Flatten gal took : 509 ms
[2022-06-08 17:02:20] [INFO ] Time to serialize gal into /tmp/LTL686764196187897046.gal : 172 ms
[2022-06-08 17:02:20] [INFO ] Time to serialize properties into /tmp/LTL14158998530460754639.ltl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL686764196187897046.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14158998530460754639.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6867641...266
Read 1 LTL properties
Checking formula 0 : !(((G(F(!("((Node7IsInserted>=1)&&(Node52requestsent7>=1))"))))U(G(X("((Node49IsInserted>=1)&&(Node42requestsent49>=1))")))))
Formula 0 simplified : !(GF!"((Node7IsInserted>=1)&&(Node52requestsent7>=1))" U GX"((Node49IsInserted>=1)&&(Node42requestsent49>=1))")
Detected timeout of ITS tools.
[2022-06-08 17:02:36] [INFO ] Flatten gal took : 747 ms
[2022-06-08 17:02:36] [INFO ] Applying decomposition
[2022-06-08 17:02:36] [INFO ] Flatten gal took : 691 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7316087363097781659.txt' '-o' '/tmp/graph7316087363097781659.bin' '-w' '/tmp/graph7316087363097781659.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7316087363097781659.bin' '-l' '-1' '-v' '-w' '/tmp/graph7316087363097781659.weights' '-q' '0' '-e' '0.001'
[2022-06-08 17:02:38] [INFO ] Decomposing Gal with order
[2022-06-08 17:02:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 17:02:41] [INFO ] Removed a total of 10831 redundant transitions.
[2022-06-08 17:02:42] [INFO ] Flatten gal took : 3161 ms
[2022-06-08 17:02:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 7081 labels/synchronizations in 2206 ms.
[2022-06-08 17:02:44] [INFO ] Time to serialize gal into /tmp/LTL13087025951730249295.gal : 101 ms
[2022-06-08 17:02:44] [INFO ] Time to serialize properties into /tmp/LTL8678678141292621145.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13087025951730249295.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8678678141292621145.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1308702...246
Read 1 LTL properties
Checking formula 0 : !(((G(F(!("((u8.Node7IsInserted>=1)&&(u53.Node52requestsent7>=1))"))))U(G(X("((u50.Node49IsInserted>=1)&&(u43.Node42requestsent49>=1))...161
Formula 0 simplified : !(GF!"((u8.Node7IsInserted>=1)&&(u53.Node52requestsent7>=1))" U GX"((u50.Node49IsInserted>=1)&&(u43.Node42requestsent49>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1842402892760418022
[2022-06-08 17:02:59] [INFO ] Built C files in 178ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1842402892760418022
Running compilation step : cd /tmp/ltsmin1842402892760418022;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin1842402892760418022;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1842402892760418022;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-01 finished in 437345 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(((!G((p0 U p1)) U !F(p0))||!p0)))))'
Found a SL insensitive property : CANInsertWithFailure-PT-060-LTLFireability-04
Stuttering acceptance computed with spot in 385 ms :[p0, p0, p0, p1]
Support contains 2 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3539 Post agglomeration using F-continuation condition.Transition count delta: 3539
Deduced a syphon composed of 3539 places in 24 ms
Reduce places removed 3539 places and 0 transitions.
Iterating global reduction 2 with 7078 rules applied. Total rules applied 7918 place count 3964 transition count 18001
Drop transitions removed 3421 transitions
Redundant transition composition rules discarded 3421 transitions
Iterating global reduction 2 with 3421 rules applied. Total rules applied 11339 place count 3964 transition count 14580
Applied a total of 11339 rules in 13285 ms. Remains 3964 /7923 variables (removed 3959) and now considering 14580/21960 (removed 7380) transitions.
// Phase 1: matrix 14580 rows 3964 cols
[2022-06-08 17:03:19] [INFO ] Computed 62 place invariants in 2365 ms
[2022-06-08 17:03:19] [INFO ] Implicit Places using invariants in 3091 ms returned []
Implicit Place search using SMT only with invariants took 3103 ms to find 0 implicit places.
// Phase 1: matrix 14580 rows 3964 cols
[2022-06-08 17:03:21] [INFO ] Computed 62 place invariants in 1865 ms
[2022-06-08 17:03:22] [INFO ] Dead Transitions using invariants and state equation in 2921 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 3964/7923 places, 14580/21960 transitions.
Finished structural reductions, in 1 iterations. Remains : 3964/7923 places, 14580/21960 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s906 1), p1:(GEQ s2941 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 335 reset in 4490 ms.
Product exploration explored 100000 steps with 332 reset in 4533 ms.
Computed a total of 183 stabilizing places and 300 stable transitions
Computed a total of 183 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 367 ms :[p0, p0, p0, p1]
Finished random walk after 4619 steps, including 15 resets, run visited all 3 properties in 382 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 2 factoid took 445 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 446 ms :[p0, p0, p0, p1]
Stuttering acceptance computed with spot in 482 ms :[p0, p0, p0, p1]
Support contains 2 out of 3964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3964/3964 places, 14580/14580 transitions.
Applied a total of 0 rules in 2790 ms. Remains 3964 /3964 variables (removed 0) and now considering 14580/14580 (removed 0) transitions.
// Phase 1: matrix 14580 rows 3964 cols
[2022-06-08 17:03:39] [INFO ] Computed 62 place invariants in 2289 ms
[2022-06-08 17:03:40] [INFO ] Implicit Places using invariants in 3063 ms returned []
Implicit Place search using SMT only with invariants took 3075 ms to find 0 implicit places.
// Phase 1: matrix 14580 rows 3964 cols
[2022-06-08 17:03:42] [INFO ] Computed 62 place invariants in 2271 ms
[2022-06-08 17:03:43] [INFO ] Dead Transitions using invariants and state equation in 3320 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3964/3964 places, 14580/14580 transitions.
Computed a total of 183 stabilizing places and 300 stable transitions
Computed a total of 183 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 223 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 349 ms :[p0, p0, p0, p1]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 460 ms. (steps per millisecond=21 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14580 rows 3964 cols
[2022-06-08 17:03:46] [INFO ] Computed 62 place invariants in 1922 ms
[2022-06-08 17:03:47] [INFO ] [Real]Absence check using 60 positive place invariants in 97 ms returned sat
[2022-06-08 17:03:47] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 164 ms returned sat
[2022-06-08 17:04:02] [INFO ] After 14762ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 17:04:03] [INFO ] State equation strengthened by 10737 read => feed constraints.
[2022-06-08 17:04:10] [INFO ] After 7639ms SMT Verify possible using 10737 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 17:04:10] [INFO ] After 23948ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 17:04:11] [INFO ] [Nat]Absence check using 60 positive place invariants in 49 ms returned sat
[2022-06-08 17:04:11] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 106 ms returned sat
[2022-06-08 17:04:28] [INFO ] After 16622ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 17:04:31] [INFO ] After 3109ms SMT Verify possible using 10737 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 17:04:33] [INFO ] After 4781ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1223 ms.
[2022-06-08 17:04:34] [INFO ] After 23911ms 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 3 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 2 factoid took 400 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 408 ms :[p0, p0, p0, p1]
Stuttering acceptance computed with spot in 418 ms :[p0, p0, p0, p1]
Stuttering acceptance computed with spot in 425 ms :[p0, p0, p0, p1]
Product exploration explored 100000 steps with 335 reset in 4001 ms.
Product exploration explored 100000 steps with 333 reset in 3820 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 424 ms :[p0, p0, p0, p1]
Support contains 2 out of 3964 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3964/3964 places, 14580/14580 transitions.
Applied a total of 0 rules in 2991 ms. Remains 3964 /3964 variables (removed 0) and now considering 14580/14580 (removed 0) transitions.
// Phase 1: matrix 14580 rows 3964 cols
[2022-06-08 17:04:50] [INFO ] Computed 62 place invariants in 2504 ms
[2022-06-08 17:05:09] [INFO ] Dead Transitions using invariants and state equation in 21954 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3964/3964 places, 14580/14580 transitions.
Product exploration explored 100000 steps with 333 reset in 5221 ms.
Product exploration explored 100000 steps with 330 reset in 5360 ms.
Built C files in :
/tmp/ltsmin14335009848291446822
[2022-06-08 17:05:20] [INFO ] Built C files in 181ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14335009848291446822
Running compilation step : cd /tmp/ltsmin14335009848291446822;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin14335009848291446822;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14335009848291446822;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 3964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3964/3964 places, 14580/14580 transitions.
Applied a total of 0 rules in 2878 ms. Remains 3964 /3964 variables (removed 0) and now considering 14580/14580 (removed 0) transitions.
// Phase 1: matrix 14580 rows 3964 cols
[2022-06-08 17:05:29] [INFO ] Computed 62 place invariants in 2837 ms
[2022-06-08 17:05:30] [INFO ] Implicit Places using invariants in 3772 ms returned []
Implicit Place search using SMT only with invariants took 3773 ms to find 0 implicit places.
// Phase 1: matrix 14580 rows 3964 cols
[2022-06-08 17:05:33] [INFO ] Computed 62 place invariants in 2637 ms
[2022-06-08 17:05:33] [INFO ] Dead Transitions using invariants and state equation in 3572 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3964/3964 places, 14580/14580 transitions.
Built C files in :
/tmp/ltsmin11381308364204856658
[2022-06-08 17:05:34] [INFO ] Built C files in 177ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11381308364204856658
Running compilation step : cd /tmp/ltsmin11381308364204856658;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin11381308364204856658;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11381308364204856658;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-08 17:05:39] [INFO ] Flatten gal took : 892 ms
[2022-06-08 17:05:39] [INFO ] Flatten gal took : 870 ms
[2022-06-08 17:05:40] [INFO ] Time to serialize gal into /tmp/LTL2423291191722038076.gal : 111 ms
[2022-06-08 17:05:40] [INFO ] Time to serialize properties into /tmp/LTL16293703221400314179.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2423291191722038076.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16293703221400314179.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2423291...267
Read 1 LTL properties
Checking formula 0 : !((X(G(X(((!(G(("(Node9requestsent3>=1)")U("(Node42GiveAnswer58>=1)"))))U(!(F("(Node9requestsent3>=1)"))))||("(Node9requestsent3<1)"))...159
Formula 0 simplified : !XGX("(Node9requestsent3<1)" | (!G("(Node9requestsent3>=1)" U "(Node42GiveAnswer58>=1)") U !F"(Node9requestsent3>=1)"))
Detected timeout of ITS tools.
[2022-06-08 17:05:56] [INFO ] Flatten gal took : 921 ms
[2022-06-08 17:05:56] [INFO ] Applying decomposition
[2022-06-08 17:05:57] [INFO ] Flatten gal took : 897 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5684152227873060454.txt' '-o' '/tmp/graph5684152227873060454.bin' '-w' '/tmp/graph5684152227873060454.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5684152227873060454.bin' '-l' '-1' '-v' '-w' '/tmp/graph5684152227873060454.weights' '-q' '0' '-e' '0.001'
[2022-06-08 17:05:59] [INFO ] Decomposing Gal with order
[2022-06-08 17:05:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 17:06:04] [INFO ] Removed a total of 10819 redundant transitions.
[2022-06-08 17:06:05] [INFO ] Flatten gal took : 4850 ms
[2022-06-08 17:06:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 7081 labels/synchronizations in 3859 ms.
[2022-06-08 17:06:09] [INFO ] Time to serialize gal into /tmp/LTL5088687632406040842.gal : 147 ms
[2022-06-08 17:06:09] [INFO ] Time to serialize properties into /tmp/LTL120707498368295206.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5088687632406040842.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL120707498368295206.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5088687...244
Read 1 LTL properties
Checking formula 0 : !((X(G(X(((!(G(("(u10.Node9requestsent3>=1)")U("(u59.Node42GiveAnswer58>=1)"))))U(!(F("(u10.Node9requestsent3>=1)"))))||("(u10.Node9re...175
Formula 0 simplified : !XGX("(u10.Node9requestsent3<1)" | (!G("(u10.Node9requestsent3>=1)" U "(u59.Node42GiveAnswer58>=1)") U !F"(u10.Node9requestsent3>=1)...158
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16762284675533968746
[2022-06-08 17:06:24] [INFO ] Built C files in 212ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16762284675533968746
Running compilation step : cd /tmp/ltsmin16762284675533968746;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin16762284675533968746;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16762284675533968746;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-04 finished in 204823 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X(G(F(p0)))))))'
[2022-06-08 17:06:29] [INFO ] Flatten gal took : 1371 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17689274040553014249
[2022-06-08 17:06:30] [INFO ] Too many transitions (21960) to apply POR reductions. Disabling POR matrices.
[2022-06-08 17:06:30] [INFO ] Built C files in 355ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17689274040553014249
Running compilation step : cd /tmp/ltsmin17689274040553014249;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-08 17:06:31] [INFO ] Applying decomposition
[2022-06-08 17:06:33] [INFO ] Flatten gal took : 1752 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11800804086345895627.txt' '-o' '/tmp/graph11800804086345895627.bin' '-w' '/tmp/graph11800804086345895627.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11800804086345895627.bin' '-l' '-1' '-v' '-w' '/tmp/graph11800804086345895627.weights' '-q' '0' '-e' '0.001'
[2022-06-08 17:06:36] [INFO ] Decomposing Gal with order
[2022-06-08 17:06:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 17:06:44] [INFO ] Removed a total of 10832 redundant transitions.
[2022-06-08 17:06:45] [INFO ] Flatten gal took : 5189 ms
[2022-06-08 17:06:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 14938 labels/synchronizations in 4916 ms.
[2022-06-08 17:06:51] [INFO ] Time to serialize gal into /tmp/LTLFireability13029328170077626470.gal : 276 ms
[2022-06-08 17:06:51] [INFO ] Time to serialize properties into /tmp/LTLFireability11978457229797781447.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13029328170077626470.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11978457229797781447.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 3 LTL properties
Checking formula 0 : !(((G(F(!("((i12.u27.Node7IsInserted>=1)&&(i55.u210.Node52requestsent7>=1))"))))U(G(X("((i6.u195.Node49IsInserted>=1)&&(i44.u170.Node4...180
Formula 0 simplified : !(GF!"((i12.u27.Node7IsInserted>=1)&&(i55.u210.Node52requestsent7>=1))" U GX"((i6.u195.Node49IsInserted>=1)&&(i44.u170.Node42request...168
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/ltsmin17689274040553014249;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 240 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17689274040553014249;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 240 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
ITS-tools command line returned an error code 137
[2022-06-08 17:29:10] [INFO ] Flatten gal took : 3649 ms
[2022-06-08 17:29:10] [INFO ] Time to serialize gal into /tmp/LTLFireability459357969073447481.gal : 329 ms
[2022-06-08 17:29:10] [INFO ] Time to serialize properties into /tmp/LTLFireability7226853439435262775.ltl : 39 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability459357969073447481.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7226853439435262775.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...287
Read 3 LTL properties
Checking formula 0 : !(((G(F(!("((Node7IsInserted>=1)&&(Node52requestsent7>=1))"))))U(G(X("((Node49IsInserted>=1)&&(Node42requestsent49>=1))")))))
Formula 0 simplified : !(GF!"((Node7IsInserted>=1)&&(Node52requestsent7>=1))" U GX"((Node49IsInserted>=1)&&(Node42requestsent49>=1))")
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-060"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-060, 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 r294-smll-165463872400052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-060.tgz
mv CANInsertWithFailure-PT-060 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 '
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 ;