Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690800739.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CANInsertWithFailure-PT-050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690800739
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.8K Feb 26 00:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 00:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 00:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 01:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 00:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 00:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 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-050-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678377937433

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-050
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 16:05:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 16:05:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 16:05:39] [INFO ] Load time of PNML (sax parser for PT used): 440 ms
[2023-03-09 16:05:39] [INFO ] Transformed 5604 places.
[2023-03-09 16:05:39] [INFO ] Transformed 15300 transitions.
[2023-03-09 16:05:39] [INFO ] Parsed PT model containing 5604 places and 15300 transitions and 41000 arcs in 567 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 5604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5604/5604 places, 15300/15300 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5603 transition count 15300
Applied a total of 1 rules in 1093 ms. Remains 5603 /5604 variables (removed 1) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-09 16:05:42] [INFO ] Computed 52 place invariants in 1266 ms
[2023-03-09 16:05:43] [INFO ] Implicit Places using invariants in 2719 ms returned []
Implicit Place search using SMT only with invariants took 2760 ms to find 0 implicit places.
[2023-03-09 16:05:43] [INFO ] Invariant cache hit.
[2023-03-09 16:05:44] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5603/5604 places, 15300/15300 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4569 ms. Remains : 5603/5604 places, 15300/15300 transitions.
Support contains 33 out of 5603 places after structural reductions.
[2023-03-09 16:05:45] [INFO ] Flatten gal took : 664 ms
[2023-03-09 16:05:45] [INFO ] Flatten gal took : 335 ms
[2023-03-09 16:05:46] [INFO ] Input system was already deterministic with 15300 transitions.
Support contains 30 out of 5603 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 673 ms. (steps per millisecond=14 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-09 16:05:47] [INFO ] Invariant cache hit.
[2023-03-09 16:05:50] [INFO ] [Real]Absence check using 50 positive place invariants in 98 ms returned sat
[2023-03-09 16:05:50] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 92 ms returned sat
[2023-03-09 16:05:50] [INFO ] After 2678ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-09 16:05:52] [INFO ] [Nat]Absence check using 50 positive place invariants in 91 ms returned sat
[2023-03-09 16:05:53] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 121 ms returned sat
[2023-03-09 16:06:14] [INFO ] After 19484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-09 16:06:14] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-09 16:06:15] [INFO ] After 830ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-09 16:06:15] [INFO ] After 831ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-09 16:06:15] [INFO ] After 25089ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 16 Parikh solutions to 14 different solutions.
Parikh walk visited 1 properties in 801 ms.
Support contains 25 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 343 transitions
Trivial Post-agglo rules discarded 343 transitions
Performed 343 trivial Post agglomeration. Transition count delta: 343
Iterating post reduction 0 with 343 rules applied. Total rules applied 343 place count 5603 transition count 14957
Reduce places removed 343 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 345 rules applied. Total rules applied 688 place count 5260 transition count 14955
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 690 place count 5258 transition count 14955
Performed 2390 Post agglomeration using F-continuation condition.Transition count delta: 2390
Deduced a syphon composed of 2390 places in 10 ms
Reduce places removed 2390 places and 0 transitions.
Iterating global reduction 3 with 4780 rules applied. Total rules applied 5470 place count 2868 transition count 12565
Drop transitions removed 2293 transitions
Redundant transition composition rules discarded 2293 transitions
Iterating global reduction 3 with 2293 rules applied. Total rules applied 7763 place count 2868 transition count 10272
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7765 place count 2868 transition count 10270
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 7767 place count 2866 transition count 10270
Partial Free-agglomeration rule applied 2686 times.
Drop transitions removed 2686 transitions
Iterating global reduction 4 with 2686 rules applied. Total rules applied 10453 place count 2866 transition count 10270
Applied a total of 10453 rules in 3933 ms. Remains 2866 /5603 variables (removed 2737) and now considering 10270/15300 (removed 5030) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3935 ms. Remains : 2866/5603 places, 10270/15300 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 445 ms. (steps per millisecond=22 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 10270 rows 2866 cols
[2023-03-09 16:06:21] [INFO ] Computed 52 place invariants in 521 ms
[2023-03-09 16:06:22] [INFO ] [Real]Absence check using 50 positive place invariants in 29 ms returned sat
[2023-03-09 16:06:22] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 39 ms returned sat
[2023-03-09 16:06:22] [INFO ] After 926ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 16:06:23] [INFO ] [Nat]Absence check using 50 positive place invariants in 53 ms returned sat
[2023-03-09 16:06:23] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 60 ms returned sat
[2023-03-09 16:06:28] [INFO ] After 5366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-09 16:06:28] [INFO ] State equation strengthened by 10024 read => feed constraints.
[2023-03-09 16:06:35] [INFO ] After 6580ms SMT Verify possible using 10024 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-09 16:06:42] [INFO ] After 13672ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 4419 ms.
[2023-03-09 16:06:47] [INFO ] After 24738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 2 properties in 167 ms.
Support contains 12 out of 2866 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2866/2866 places, 10270/10270 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 2866 transition count 10268
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 2864 transition count 10268
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 2859 transition count 10263
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 2859 transition count 10263
Applied a total of 20 rules in 1199 ms. Remains 2859 /2866 variables (removed 7) and now considering 10263/10270 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1200 ms. Remains : 2859/2866 places, 10263/10270 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 86748 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86748 steps, saw 30448 distinct states, run finished after 3005 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 10263 rows 2859 cols
[2023-03-09 16:06:52] [INFO ] Computed 52 place invariants in 524 ms
[2023-03-09 16:06:53] [INFO ] [Real]Absence check using 50 positive place invariants in 52 ms returned sat
[2023-03-09 16:06:53] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 56 ms returned sat
[2023-03-09 16:06:53] [INFO ] After 1130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 16:06:54] [INFO ] [Nat]Absence check using 50 positive place invariants in 30 ms returned sat
[2023-03-09 16:06:54] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 39 ms returned sat
[2023-03-09 16:06:58] [INFO ] After 4474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-09 16:06:59] [INFO ] State equation strengthened by 10040 read => feed constraints.
[2023-03-09 16:07:04] [INFO ] After 5605ms SMT Verify possible using 10040 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-09 16:07:11] [INFO ] After 11996ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 3505 ms.
[2023-03-09 16:07:14] [INFO ] After 21075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 132 ms.
Support contains 12 out of 2859 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2859/2859 places, 10263/10263 transitions.
Applied a total of 0 rules in 544 ms. Remains 2859 /2859 variables (removed 0) and now considering 10263/10263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 544 ms. Remains : 2859/2859 places, 10263/10263 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2859/2859 places, 10263/10263 transitions.
Applied a total of 0 rules in 429 ms. Remains 2859 /2859 variables (removed 0) and now considering 10263/10263 (removed 0) transitions.
[2023-03-09 16:07:15] [INFO ] Invariant cache hit.
[2023-03-09 16:07:19] [INFO ] Implicit Places using invariants in 3592 ms returned []
Implicit Place search using SMT only with invariants took 3594 ms to find 0 implicit places.
[2023-03-09 16:07:19] [INFO ] Invariant cache hit.
[2023-03-09 16:07:23] [INFO ] Dead Transitions using invariants and state equation in 4620 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8646 ms. Remains : 2859/2859 places, 10263/10263 transitions.
Graph (trivial) has 9875 edges and 2859 vertex of which 2644 / 2859 are part of one of the 2 SCC in 9 ms
Free SCC test removed 2642 places
Drop transitions removed 7484 transitions
Ensure Unique test removed 2539 transitions
Reduce isomorphic transitions removed 10023 transitions.
Graph (complete) has 542 edges and 217 vertex of which 68 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.0 ms
Discarding 149 places :
Also discarding 49 output transitions
Drop transitions removed 49 transitions
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 68 transition count 92
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 148 place count 21 transition count 45
Iterating global reduction 1 with 47 rules applied. Total rules applied 195 place count 21 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 197 place count 20 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 198 place count 20 transition count 43
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 200 place count 20 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 202 place count 18 transition count 39
Applied a total of 202 rules in 41 ms. Remains 18 /2859 variables (removed 2841) and now considering 39/10263 (removed 10224) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 39 rows 18 cols
[2023-03-09 16:07:23] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-09 16:07:24] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 16:07:24] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-09 16:07:24] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 16:07:24] [INFO ] After 70ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Computed a total of 202 stabilizing places and 350 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2449 Post agglomeration using F-continuation condition.Transition count delta: 2449
Deduced a syphon composed of 2449 places in 7 ms
Reduce places removed 2449 places and 0 transitions.
Iterating global reduction 2 with 4898 rules applied. Total rules applied 5598 place count 2804 transition count 12501
Drop transitions removed 2351 transitions
Redundant transition composition rules discarded 2351 transitions
Iterating global reduction 2 with 2351 rules applied. Total rules applied 7949 place count 2804 transition count 10150
Applied a total of 7949 rules in 2178 ms. Remains 2804 /5603 variables (removed 2799) and now considering 10150/15300 (removed 5150) transitions.
// Phase 1: matrix 10150 rows 2804 cols
[2023-03-09 16:07:26] [INFO ] Computed 52 place invariants in 370 ms
[2023-03-09 16:07:28] [INFO ] Implicit Places using invariants in 2349 ms returned []
Implicit Place search using SMT only with invariants took 2353 ms to find 0 implicit places.
[2023-03-09 16:07:28] [INFO ] Invariant cache hit.
[2023-03-09 16:07:33] [INFO ] Dead Transitions using invariants and state equation in 4588 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5603 places, 10150/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9124 ms. Remains : 2804/5603 places, 10150/15300 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 3 s2276) (LEQ 2 s2062))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 301 steps with 0 reset in 20 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-01 finished in 9405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||F(p1))))'
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 687 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-09 16:07:35] [INFO ] Computed 52 place invariants in 1171 ms
[2023-03-09 16:07:36] [INFO ] Implicit Places using invariants in 2424 ms returned []
Implicit Place search using SMT only with invariants took 2425 ms to find 0 implicit places.
[2023-03-09 16:07:36] [INFO ] Invariant cache hit.
[2023-03-09 16:07:44] [INFO ] Dead Transitions using invariants and state equation in 7892 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11008 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s1064 s3496), p0:(LEQ 1 s4729)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 85 reset in 1445 ms.
Product exploration explored 100000 steps with 82 reset in 1358 ms.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 77120 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77120 steps, saw 62113 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 16:07:51] [INFO ] Invariant cache hit.
[2023-03-09 16:07:51] [INFO ] After 558ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 16:07:52] [INFO ] [Nat]Absence check using 50 positive place invariants in 85 ms returned sat
[2023-03-09 16:07:52] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 92 ms returned sat
[2023-03-09 16:08:00] [INFO ] After 7799ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 16:08:00] [INFO ] State equation strengthened by 4950 read => feed constraints.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-09 16:08:17] [INFO ] After 16065ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 16:08:17] [INFO ] After 16066ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 16:08:17] [INFO ] After 25172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2448 Post agglomeration using F-continuation condition.Transition count delta: 2448
Deduced a syphon composed of 2448 places in 7 ms
Reduce places removed 2448 places and 0 transitions.
Iterating global reduction 2 with 4896 rules applied. Total rules applied 5596 place count 2805 transition count 12502
Drop transitions removed 2350 transitions
Redundant transition composition rules discarded 2350 transitions
Iterating global reduction 2 with 2350 rules applied. Total rules applied 7946 place count 2805 transition count 10152
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7947 place count 2805 transition count 10151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7948 place count 2804 transition count 10151
Partial Free-agglomeration rule applied 2550 times.
Drop transitions removed 2550 transitions
Iterating global reduction 3 with 2550 rules applied. Total rules applied 10498 place count 2804 transition count 10151
Applied a total of 10498 rules in 3208 ms. Remains 2804 /5603 variables (removed 2799) and now considering 10151/15300 (removed 5149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3212 ms. Remains : 2804/5603 places, 10151/15300 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 75194 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75194 steps, saw 28000 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10151 rows 2804 cols
[2023-03-09 16:08:23] [INFO ] Computed 52 place invariants in 292 ms
[2023-03-09 16:08:24] [INFO ] After 441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 16:08:24] [INFO ] [Nat]Absence check using 50 positive place invariants in 22 ms returned sat
[2023-03-09 16:08:24] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 27 ms returned sat
[2023-03-09 16:08:28] [INFO ] After 3793ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 16:08:28] [INFO ] State equation strengthened by 9995 read => feed constraints.
[2023-03-09 16:08:31] [INFO ] After 2299ms SMT Verify possible using 9995 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 16:08:32] [INFO ] After 3382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 672 ms.
[2023-03-09 16:08:32] [INFO ] After 8428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 40 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=20 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 241 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 598 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-09 16:08:35] [INFO ] Computed 52 place invariants in 1104 ms
[2023-03-09 16:08:36] [INFO ] Implicit Places using invariants in 2214 ms returned []
Implicit Place search using SMT only with invariants took 2216 ms to find 0 implicit places.
[2023-03-09 16:08:36] [INFO ] Invariant cache hit.
[2023-03-09 16:08:43] [INFO ] Dead Transitions using invariants and state equation in 7775 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10593 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 75749 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75749 steps, saw 61722 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 16:08:47] [INFO ] Invariant cache hit.
[2023-03-09 16:08:48] [INFO ] After 894ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 16:08:49] [INFO ] [Nat]Absence check using 50 positive place invariants in 80 ms returned sat
[2023-03-09 16:08:49] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 90 ms returned sat
[2023-03-09 16:08:57] [INFO ] After 7878ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 16:08:57] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-09 16:09:13] [INFO ] After 15994ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-09 16:09:13] [INFO ] After 25120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 98 ms.
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2448 Post agglomeration using F-continuation condition.Transition count delta: 2448
Deduced a syphon composed of 2448 places in 6 ms
Reduce places removed 2448 places and 0 transitions.
Iterating global reduction 2 with 4896 rules applied. Total rules applied 5596 place count 2805 transition count 12502
Drop transitions removed 2350 transitions
Redundant transition composition rules discarded 2350 transitions
Iterating global reduction 2 with 2350 rules applied. Total rules applied 7946 place count 2805 transition count 10152
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7947 place count 2805 transition count 10151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7948 place count 2804 transition count 10151
Partial Free-agglomeration rule applied 2550 times.
Drop transitions removed 2550 transitions
Iterating global reduction 3 with 2550 rules applied. Total rules applied 10498 place count 2804 transition count 10151
Applied a total of 10498 rules in 3256 ms. Remains 2804 /5603 variables (removed 2799) and now considering 10151/15300 (removed 5149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3257 ms. Remains : 2804/5603 places, 10151/15300 transitions.
Finished random walk after 7819 steps, including 33 resets, run visited all 2 properties in 169 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 236 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 84 reset in 1350 ms.
Product exploration explored 100000 steps with 83 reset in 1307 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Performed 250 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 5603 transition count 15300
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 50 Pre rules applied. Total rules applied 250 place count 5603 transition count 15300
Deduced a syphon composed of 300 places in 6 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 300 place count 5603 transition count 15300
Discarding 100 places :
Symmetric choice reduction at 1 with 100 rule applications. Total rules 400 place count 5503 transition count 15200
Deduced a syphon composed of 200 places in 5 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 500 place count 5503 transition count 15200
Performed 2498 Post agglomeration using F-continuation condition.Transition count delta: -4796
Deduced a syphon composed of 2698 places in 6 ms
Iterating global reduction 1 with 2498 rules applied. Total rules applied 2998 place count 5503 transition count 19996
Discarding 200 places :
Symmetric choice reduction at 1 with 200 rule applications. Total rules 3198 place count 5303 transition count 19796
Deduced a syphon composed of 2498 places in 4 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 3398 place count 5303 transition count 19796
Deduced a syphon composed of 2498 places in 3 ms
Drop transitions removed 2350 transitions
Redundant transition composition rules discarded 2350 transitions
Iterating global reduction 1 with 2350 rules applied. Total rules applied 5748 place count 5303 transition count 17446
Deduced a syphon composed of 2498 places in 2 ms
Applied a total of 5748 rules in 4264 ms. Remains 5303 /5603 variables (removed 300) and now considering 17446/15300 (removed -2146) transitions.
// Phase 1: matrix 17446 rows 5303 cols
[2023-03-09 16:09:26] [INFO ] Computed 52 place invariants in 1176 ms
[2023-03-09 16:09:35] [INFO ] Dead Transitions using invariants and state equation in 10343 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5303/5603 places, 17446/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14610 ms. Remains : 5303/5603 places, 17446/15300 transitions.
Built C files in :
/tmp/ltsmin4273929606574506930
[2023-03-09 16:09:35] [INFO ] Built C files in 168ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4273929606574506930
Running compilation step : cd /tmp/ltsmin4273929606574506930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4273929606574506930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4273929606574506930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 571 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-09 16:09:40] [INFO ] Computed 52 place invariants in 1099 ms
[2023-03-09 16:09:41] [INFO ] Implicit Places using invariants in 2054 ms returned []
Implicit Place search using SMT only with invariants took 2055 ms to find 0 implicit places.
[2023-03-09 16:09:41] [INFO ] Invariant cache hit.
[2023-03-09 16:09:49] [INFO ] Dead Transitions using invariants and state equation in 8042 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10672 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Built C files in :
/tmp/ltsmin1270757573731533555
[2023-03-09 16:09:49] [INFO ] Built C files in 196ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1270757573731533555
Running compilation step : cd /tmp/ltsmin1270757573731533555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1270757573731533555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1270757573731533555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 16:09:53] [INFO ] Flatten gal took : 350 ms
[2023-03-09 16:09:53] [INFO ] Flatten gal took : 284 ms
[2023-03-09 16:09:53] [INFO ] Time to serialize gal into /tmp/LTL10316920600211828705.gal : 84 ms
[2023-03-09 16:09:53] [INFO ] Time to serialize properties into /tmp/LTL16981530951499496071.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10316920600211828705.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3517451931327670776.hoa' '-atoms' '/tmp/LTL16981530951499496071.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16981530951499496071.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3517451931327670776.hoa
Detected timeout of ITS tools.
[2023-03-09 16:10:09] [INFO ] Flatten gal took : 442 ms
[2023-03-09 16:10:10] [INFO ] Flatten gal took : 357 ms
[2023-03-09 16:10:10] [INFO ] Time to serialize gal into /tmp/LTL15590777494125145931.gal : 69 ms
[2023-03-09 16:10:10] [INFO ] Time to serialize properties into /tmp/LTL11617180550116095746.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15590777494125145931.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11617180550116095746.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((X("(Node41requestsent4>=1)"))||(F("(Node3GiveAnswer34<=Node28GiveAnswer24)")))))
Formula 0 simplified : F(X!"(Node41requestsent4>=1)" & G!"(Node3GiveAnswer34<=Node28GiveAnswer24)")
Detected timeout of ITS tools.
[2023-03-09 16:10:25] [INFO ] Flatten gal took : 406 ms
[2023-03-09 16:10:25] [INFO ] Applying decomposition
[2023-03-09 16:10:26] [INFO ] Flatten gal took : 446 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18018161996213372297.txt' '-o' '/tmp/graph18018161996213372297.bin' '-w' '/tmp/graph18018161996213372297.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18018161996213372297.bin' '-l' '-1' '-v' '-w' '/tmp/graph18018161996213372297.weights' '-q' '0' '-e' '0.001'
[2023-03-09 16:10:26] [INFO ] Decomposing Gal with order
[2023-03-09 16:10:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 16:10:28] [INFO ] Removed a total of 7536 redundant transitions.
[2023-03-09 16:10:28] [INFO ] Flatten gal took : 1200 ms
[2023-03-09 16:10:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 4811 labels/synchronizations in 560 ms.
[2023-03-09 16:10:30] [INFO ] Time to serialize gal into /tmp/LTL13718086558525259285.gal : 82 ms
[2023-03-09 16:10:30] [INFO ] Time to serialize properties into /tmp/LTL4874009972896020719.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13718086558525259285.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4874009972896020719.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X("(gi0.gi1.gi49.gu166.Node41requestsent4>=1)"))||(F("(gu199.Node3GiveAnswer34<=gu199.Node28GiveAnswer24)")))))
Formula 0 simplified : F(X!"(gi0.gi1.gi49.gu166.Node41requestsent4>=1)" & G!"(gu199.Node3GiveAnswer34<=gu199.Node28GiveAnswer24)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16501805003021815795
[2023-03-09 16:10:46] [INFO ] Built C files in 208ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16501805003021815795
Running compilation step : cd /tmp/ltsmin16501805003021815795;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16501805003021815795;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16501805003021815795;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-03 finished in 195414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2450 Post agglomeration using F-continuation condition.Transition count delta: 2450
Deduced a syphon composed of 2450 places in 6 ms
Reduce places removed 2450 places and 0 transitions.
Iterating global reduction 2 with 4900 rules applied. Total rules applied 5600 place count 2803 transition count 12500
Drop transitions removed 2352 transitions
Redundant transition composition rules discarded 2352 transitions
Iterating global reduction 2 with 2352 rules applied. Total rules applied 7952 place count 2803 transition count 10148
Applied a total of 7952 rules in 2228 ms. Remains 2803 /5603 variables (removed 2800) and now considering 10148/15300 (removed 5152) transitions.
// Phase 1: matrix 10148 rows 2803 cols
[2023-03-09 16:10:51] [INFO ] Computed 52 place invariants in 262 ms
[2023-03-09 16:10:53] [INFO ] Implicit Places using invariants in 2086 ms returned []
Implicit Place search using SMT only with invariants took 2088 ms to find 0 implicit places.
[2023-03-09 16:10:53] [INFO ] Invariant cache hit.
[2023-03-09 16:10:57] [INFO ] Dead Transitions using invariants and state equation in 4338 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2803/5603 places, 10148/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8655 ms. Remains : 2803/5603 places, 10148/15300 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1984 s867)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 235 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-04 finished in 8757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Support contains 5 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 347 transitions
Trivial Post-agglo rules discarded 347 transitions
Performed 347 trivial Post agglomeration. Transition count delta: 347
Iterating post reduction 0 with 347 rules applied. Total rules applied 347 place count 5603 transition count 14953
Reduce places removed 347 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 348 rules applied. Total rules applied 695 place count 5256 transition count 14952
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 696 place count 5255 transition count 14952
Performed 2447 Post agglomeration using F-continuation condition.Transition count delta: 2447
Deduced a syphon composed of 2447 places in 6 ms
Reduce places removed 2447 places and 0 transitions.
Iterating global reduction 3 with 4894 rules applied. Total rules applied 5590 place count 2808 transition count 12505
Drop transitions removed 2349 transitions
Redundant transition composition rules discarded 2349 transitions
Iterating global reduction 3 with 2349 rules applied. Total rules applied 7939 place count 2808 transition count 10156
Applied a total of 7939 rules in 2163 ms. Remains 2808 /5603 variables (removed 2795) and now considering 10156/15300 (removed 5144) transitions.
// Phase 1: matrix 10156 rows 2808 cols
[2023-03-09 16:11:00] [INFO ] Computed 52 place invariants in 393 ms
[2023-03-09 16:11:02] [INFO ] Implicit Places using invariants in 2592 ms returned []
Implicit Place search using SMT only with invariants took 2596 ms to find 0 implicit places.
[2023-03-09 16:11:02] [INFO ] Invariant cache hit.
[2023-03-09 16:11:07] [INFO ] Dead Transitions using invariants and state equation in 4436 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2808/5603 places, 10156/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9202 ms. Remains : 2808/5603 places, 10156/15300 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LEQ 1 s1359) (LEQ s2505 s867)), p0:(LEQ s2515 s71)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 288 steps with 0 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-07 finished in 9326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 692 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-09 16:11:09] [INFO ] Computed 52 place invariants in 1187 ms
[2023-03-09 16:11:10] [INFO ] Implicit Places using invariants in 2298 ms returned []
Implicit Place search using SMT only with invariants took 2299 ms to find 0 implicit places.
[2023-03-09 16:11:10] [INFO ] Invariant cache hit.
[2023-03-09 16:11:18] [INFO ] Dead Transitions using invariants and state equation in 8045 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11040 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s366 s4437)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-08 finished in 11223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U (p1||G((p2||G(p3))))))'
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2450 Post agglomeration using F-continuation condition.Transition count delta: 2450
Deduced a syphon composed of 2450 places in 6 ms
Reduce places removed 2450 places and 0 transitions.
Iterating global reduction 2 with 4900 rules applied. Total rules applied 5600 place count 2803 transition count 12500
Drop transitions removed 2352 transitions
Redundant transition composition rules discarded 2352 transitions
Iterating global reduction 2 with 2352 rules applied. Total rules applied 7952 place count 2803 transition count 10148
Applied a total of 7952 rules in 2133 ms. Remains 2803 /5603 variables (removed 2800) and now considering 10148/15300 (removed 5152) transitions.
// Phase 1: matrix 10148 rows 2803 cols
[2023-03-09 16:11:21] [INFO ] Computed 52 place invariants in 391 ms
[2023-03-09 16:11:23] [INFO ] Implicit Places using invariants in 2530 ms returned []
Implicit Place search using SMT only with invariants took 2531 ms to find 0 implicit places.
[2023-03-09 16:11:23] [INFO ] Invariant cache hit.
[2023-03-09 16:11:27] [INFO ] Dead Transitions using invariants and state equation in 4599 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2803/5603 places, 10148/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9269 ms. Remains : 2803/5603 places, 10148/15300 transitions.
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), p0, p0, (AND p0 (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p3) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p3)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={1} source=0 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) p0), acceptance={} source=3 dest: 1}, { cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 3 s752), p2:(LEQ 1 s390), p3:(LEQ s1032 s1038), p0:(OR (LEQ 3 s752) (LEQ s1032 s1038))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1883 steps with 7 reset in 51 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-09 finished in 9703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 5603 transition count 14952
Reduce places removed 348 places and 0 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 696 place count 5255 transition count 14952
Performed 2450 Post agglomeration using F-continuation condition.Transition count delta: 2450
Deduced a syphon composed of 2450 places in 4 ms
Reduce places removed 2450 places and 0 transitions.
Iterating global reduction 2 with 4900 rules applied. Total rules applied 5596 place count 2805 transition count 12502
Drop transitions removed 2352 transitions
Redundant transition composition rules discarded 2352 transitions
Iterating global reduction 2 with 2352 rules applied. Total rules applied 7948 place count 2805 transition count 10150
Applied a total of 7948 rules in 1972 ms. Remains 2805 /5603 variables (removed 2798) and now considering 10150/15300 (removed 5150) transitions.
// Phase 1: matrix 10150 rows 2805 cols
[2023-03-09 16:11:30] [INFO ] Computed 52 place invariants in 389 ms
[2023-03-09 16:11:32] [INFO ] Implicit Places using invariants in 2418 ms returned []
Implicit Place search using SMT only with invariants took 2419 ms to find 0 implicit places.
[2023-03-09 16:11:32] [INFO ] Invariant cache hit.
[2023-03-09 16:11:37] [INFO ] Dead Transitions using invariants and state equation in 4638 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2805/5603 places, 10150/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9034 ms. Remains : 2805/5603 places, 10150/15300 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT 3 s1662) (GT s2368 s119)), p0:(GT s2368 s119)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 247 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-10 finished in 9174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p1&&X((p1 U (p2||G(p1)))))||p0)))))'
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 478 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-09 16:11:38] [INFO ] Computed 52 place invariants in 1153 ms
[2023-03-09 16:11:40] [INFO ] Implicit Places using invariants in 2322 ms returned []
Implicit Place search using SMT only with invariants took 2323 ms to find 0 implicit places.
[2023-03-09 16:11:40] [INFO ] Invariant cache hit.
[2023-03-09 16:11:47] [INFO ] Dead Transitions using invariants and state equation in 7718 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10520 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(OR (GT s336 s4662) (GT 2 s1128)), p1:(GT 3 s3110), p2:(GT 2 s1128)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 81 reset in 1351 ms.
Product exploration explored 100000 steps with 82 reset in 1415 ms.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 67946 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67946 steps, saw 59318 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-09 16:11:54] [INFO ] Invariant cache hit.
[2023-03-09 16:11:55] [INFO ] [Real]Absence check using 50 positive place invariants in 84 ms returned sat
[2023-03-09 16:11:56] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 68 ms returned sat
[2023-03-09 16:12:06] [INFO ] After 11295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 16:12:07] [INFO ] [Nat]Absence check using 50 positive place invariants in 92 ms returned sat
[2023-03-09 16:12:07] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 92 ms returned sat
[2023-03-09 16:12:21] [INFO ] After 13624ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 16:12:21] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-09 16:12:31] [INFO ] After 9460ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-09 16:12:31] [INFO ] After 9462ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-09 16:12:31] [INFO ] After 25141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 224 ms.
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2398 Post agglomeration using F-continuation condition.Transition count delta: 2398
Deduced a syphon composed of 2398 places in 5 ms
Reduce places removed 2398 places and 0 transitions.
Iterating global reduction 2 with 4796 rules applied. Total rules applied 5496 place count 2855 transition count 12552
Drop transitions removed 2301 transitions
Redundant transition composition rules discarded 2301 transitions
Iterating global reduction 2 with 2301 rules applied. Total rules applied 7797 place count 2855 transition count 10251
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7798 place count 2855 transition count 10250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7799 place count 2854 transition count 10250
Partial Free-agglomeration rule applied 2649 times.
Drop transitions removed 2649 transitions
Iterating global reduction 3 with 2649 rules applied. Total rules applied 10448 place count 2854 transition count 10250
Applied a total of 10448 rules in 2813 ms. Remains 2854 /5603 variables (removed 2749) and now considering 10250/15300 (removed 5050) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2813 ms. Remains : 2854/5603 places, 10250/15300 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 83833 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83833 steps, saw 30112 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10250 rows 2854 cols
[2023-03-09 16:12:38] [INFO ] Computed 52 place invariants in 549 ms
[2023-03-09 16:12:39] [INFO ] [Real]Absence check using 50 positive place invariants in 31 ms returned sat
[2023-03-09 16:12:39] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 39 ms returned sat
[2023-03-09 16:12:42] [INFO ] After 4004ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 16:12:43] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2023-03-09 16:12:43] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 46 ms returned sat
[2023-03-09 16:12:47] [INFO ] After 4564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 16:12:48] [INFO ] State equation strengthened by 10043 read => feed constraints.
[2023-03-09 16:12:53] [INFO ] After 4950ms SMT Verify possible using 10043 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 16:12:56] [INFO ] After 8598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2703 ms.
[2023-03-09 16:12:59] [INFO ] After 17009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 4 out of 2854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2854/2854 places, 10250/10250 transitions.
Applied a total of 0 rules in 482 ms. Remains 2854 /2854 variables (removed 0) and now considering 10250/10250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 484 ms. Remains : 2854/2854 places, 10250/10250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2854/2854 places, 10250/10250 transitions.
Applied a total of 0 rules in 421 ms. Remains 2854 /2854 variables (removed 0) and now considering 10250/10250 (removed 0) transitions.
[2023-03-09 16:13:00] [INFO ] Invariant cache hit.
[2023-03-09 16:13:03] [INFO ] Implicit Places using invariants in 3425 ms returned []
Implicit Place search using SMT only with invariants took 3428 ms to find 0 implicit places.
[2023-03-09 16:13:03] [INFO ] Invariant cache hit.
[2023-03-09 16:13:08] [INFO ] Dead Transitions using invariants and state equation in 4522 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8375 ms. Remains : 2854/2854 places, 10250/10250 transitions.
Graph (trivial) has 9890 edges and 2854 vertex of which 2648 / 2854 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2646 places
Drop transitions removed 7493 transitions
Ensure Unique test removed 2541 transitions
Reduce isomorphic transitions removed 10034 transitions.
Graph (complete) has 517 edges and 208 vertex of which 59 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.0 ms
Discarding 149 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 59 transition count 67
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 58 transition count 66
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 152 place count 11 transition count 19
Iterating global reduction 2 with 47 rules applied. Total rules applied 199 place count 11 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 11 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 204 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 8 transition count 13
Applied a total of 206 rules in 21 ms. Remains 8 /2854 variables (removed 2846) and now considering 13/10250 (removed 10237) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 13 rows 8 cols
[2023-03-09 16:13:08] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 16:13:08] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 16:13:08] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 16:13:08] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 16:13:08] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 574 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-09 16:13:10] [INFO ] Computed 52 place invariants in 1111 ms
[2023-03-09 16:13:11] [INFO ] Implicit Places using invariants in 2281 ms returned []
Implicit Place search using SMT only with invariants took 2283 ms to find 0 implicit places.
[2023-03-09 16:13:11] [INFO ] Invariant cache hit.
[2023-03-09 16:13:19] [INFO ] Dead Transitions using invariants and state equation in 7544 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10403 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 69621 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69621 steps, saw 59870 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-09 16:13:23] [INFO ] Invariant cache hit.
[2023-03-09 16:13:24] [INFO ] [Real]Absence check using 50 positive place invariants in 88 ms returned sat
[2023-03-09 16:13:24] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 98 ms returned sat
[2023-03-09 16:13:34] [INFO ] After 11358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 16:13:35] [INFO ] [Nat]Absence check using 50 positive place invariants in 90 ms returned sat
[2023-03-09 16:13:36] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 98 ms returned sat
[2023-03-09 16:13:50] [INFO ] After 13938ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 16:13:50] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-09 16:13:59] [INFO ] After 8920ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-09 16:13:59] [INFO ] After 8921ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 16:13:59] [INFO ] After 25070ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 186 ms.
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2398 Post agglomeration using F-continuation condition.Transition count delta: 2398
Deduced a syphon composed of 2398 places in 5 ms
Reduce places removed 2398 places and 0 transitions.
Iterating global reduction 2 with 4796 rules applied. Total rules applied 5496 place count 2855 transition count 12552
Drop transitions removed 2301 transitions
Redundant transition composition rules discarded 2301 transitions
Iterating global reduction 2 with 2301 rules applied. Total rules applied 7797 place count 2855 transition count 10251
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7798 place count 2855 transition count 10250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7799 place count 2854 transition count 10250
Partial Free-agglomeration rule applied 2649 times.
Drop transitions removed 2649 transitions
Iterating global reduction 3 with 2649 rules applied. Total rules applied 10448 place count 2854 transition count 10250
Applied a total of 10448 rules in 2687 ms. Remains 2854 /5603 variables (removed 2749) and now considering 10250/15300 (removed 5050) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2689 ms. Remains : 2854/5603 places, 10250/15300 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 490 ms. (steps per millisecond=20 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 74046 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74046 steps, saw 29042 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10250 rows 2854 cols
[2023-03-09 16:14:06] [INFO ] Computed 52 place invariants in 344 ms
[2023-03-09 16:14:07] [INFO ] [Real]Absence check using 50 positive place invariants in 51 ms returned sat
[2023-03-09 16:14:07] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 62 ms returned sat
[2023-03-09 16:14:10] [INFO ] After 4237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 16:14:11] [INFO ] [Nat]Absence check using 50 positive place invariants in 25 ms returned sat
[2023-03-09 16:14:11] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2023-03-09 16:14:16] [INFO ] After 4636ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 16:14:16] [INFO ] State equation strengthened by 10043 read => feed constraints.
[2023-03-09 16:14:21] [INFO ] After 5423ms SMT Verify possible using 10043 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 16:14:25] [INFO ] After 9077ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2795 ms.
[2023-03-09 16:14:28] [INFO ] After 17347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 4 out of 2854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2854/2854 places, 10250/10250 transitions.
Applied a total of 0 rules in 463 ms. Remains 2854 /2854 variables (removed 0) and now considering 10250/10250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 463 ms. Remains : 2854/2854 places, 10250/10250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2854/2854 places, 10250/10250 transitions.
Applied a total of 0 rules in 401 ms. Remains 2854 /2854 variables (removed 0) and now considering 10250/10250 (removed 0) transitions.
[2023-03-09 16:14:29] [INFO ] Invariant cache hit.
[2023-03-09 16:14:32] [INFO ] Implicit Places using invariants in 3201 ms returned []
Implicit Place search using SMT only with invariants took 3203 ms to find 0 implicit places.
[2023-03-09 16:14:32] [INFO ] Invariant cache hit.
[2023-03-09 16:14:37] [INFO ] Dead Transitions using invariants and state equation in 4965 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8572 ms. Remains : 2854/2854 places, 10250/10250 transitions.
Graph (trivial) has 9890 edges and 2854 vertex of which 2648 / 2854 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2646 places
Drop transitions removed 7493 transitions
Ensure Unique test removed 2541 transitions
Reduce isomorphic transitions removed 10034 transitions.
Graph (complete) has 517 edges and 208 vertex of which 59 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.1 ms
Discarding 149 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 59 transition count 67
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 58 transition count 66
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 152 place count 11 transition count 19
Iterating global reduction 2 with 47 rules applied. Total rules applied 199 place count 11 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 11 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 204 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 8 transition count 13
Applied a total of 206 rules in 19 ms. Remains 8 /2854 variables (removed 2846) and now considering 13/10250 (removed 10237) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 13 rows 8 cols
[2023-03-09 16:14:37] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-09 16:14:37] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 16:14:37] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 16:14:37] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 16:14:37] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 252 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 267 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 82 reset in 1206 ms.
Product exploration explored 100000 steps with 83 reset in 1127 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 219 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Performed 250 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 5603 transition count 15300
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 50 Pre rules applied. Total rules applied 250 place count 5603 transition count 15300
Deduced a syphon composed of 300 places in 4 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 300 place count 5603 transition count 15300
Discarding 100 places :
Symmetric choice reduction at 1 with 100 rule applications. Total rules 400 place count 5503 transition count 15200
Deduced a syphon composed of 200 places in 5 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 500 place count 5503 transition count 15200
Performed 2448 Post agglomeration using F-continuation condition.Transition count delta: -4696
Deduced a syphon composed of 2648 places in 7 ms
Iterating global reduction 1 with 2448 rules applied. Total rules applied 2948 place count 5503 transition count 19896
Discarding 200 places :
Symmetric choice reduction at 1 with 200 rule applications. Total rules 3148 place count 5303 transition count 19696
Deduced a syphon composed of 2448 places in 5 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 3348 place count 5303 transition count 19696
Deduced a syphon composed of 2448 places in 3 ms
Drop transitions removed 2301 transitions
Redundant transition composition rules discarded 2301 transitions
Iterating global reduction 1 with 2301 rules applied. Total rules applied 5649 place count 5303 transition count 17395
Deduced a syphon composed of 2448 places in 2 ms
Applied a total of 5649 rules in 3814 ms. Remains 5303 /5603 variables (removed 300) and now considering 17395/15300 (removed -2095) transitions.
// Phase 1: matrix 17395 rows 5303 cols
[2023-03-09 16:14:46] [INFO ] Computed 52 place invariants in 1273 ms
[2023-03-09 16:14:54] [INFO ] Dead Transitions using invariants and state equation in 9253 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5303/5603 places, 17395/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13070 ms. Remains : 5303/5603 places, 17395/15300 transitions.
Built C files in :
/tmp/ltsmin7273635216410388756
[2023-03-09 16:14:54] [INFO ] Built C files in 199ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7273635216410388756
Running compilation step : cd /tmp/ltsmin7273635216410388756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7273635216410388756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7273635216410388756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 441 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-09 16:14:58] [INFO ] Computed 52 place invariants in 1158 ms
[2023-03-09 16:15:00] [INFO ] Implicit Places using invariants in 2298 ms returned []
Implicit Place search using SMT only with invariants took 2299 ms to find 0 implicit places.
[2023-03-09 16:15:00] [INFO ] Invariant cache hit.
[2023-03-09 16:15:07] [INFO ] Dead Transitions using invariants and state equation in 7696 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10439 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Built C files in :
/tmp/ltsmin12597263205851837917
[2023-03-09 16:15:07] [INFO ] Built C files in 174ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12597263205851837917
Running compilation step : cd /tmp/ltsmin12597263205851837917;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12597263205851837917;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12597263205851837917;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 16:15:11] [INFO ] Flatten gal took : 584 ms
[2023-03-09 16:15:12] [INFO ] Flatten gal took : 341 ms
[2023-03-09 16:15:12] [INFO ] Time to serialize gal into /tmp/LTL17394229918051313665.gal : 57 ms
[2023-03-09 16:15:12] [INFO ] Time to serialize properties into /tmp/LTL6668926174681498772.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17394229918051313665.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16715774096494706642.hoa' '-atoms' '/tmp/LTL6668926174681498772.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL6668926174681498772.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16715774096494706642.hoa
Detected timeout of ITS tools.
[2023-03-09 16:15:27] [INFO ] Flatten gal took : 342 ms
[2023-03-09 16:15:28] [INFO ] Flatten gal took : 314 ms
[2023-03-09 16:15:28] [INFO ] Time to serialize gal into /tmp/LTL8738290696766373012.gal : 42 ms
[2023-03-09 16:15:28] [INFO ] Time to serialize properties into /tmp/LTL37997344280243152.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8738290696766373012.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL37997344280243152.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...273
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((Node23OKshare>Node40GiveAnswer19)||(Node4GiveAnswer17<2))")||(("(Node24GiveAnswer28<3)")&&(X(("(Node24GiveAnswer28<3)")U(...220
Formula 0 simplified : XXF(!"((Node23OKshare>Node40GiveAnswer19)||(Node4GiveAnswer17<2))" & (!"(Node24GiveAnswer28<3)" | X(!"(Node24GiveAnswer28<3)" M !"(N...178
Detected timeout of ITS tools.
[2023-03-09 16:15:43] [INFO ] Flatten gal took : 352 ms
[2023-03-09 16:15:43] [INFO ] Applying decomposition
[2023-03-09 16:15:43] [INFO ] Flatten gal took : 359 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5173392564620160836.txt' '-o' '/tmp/graph5173392564620160836.bin' '-w' '/tmp/graph5173392564620160836.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5173392564620160836.bin' '-l' '-1' '-v' '-w' '/tmp/graph5173392564620160836.weights' '-q' '0' '-e' '0.001'
[2023-03-09 16:15:44] [INFO ] Decomposing Gal with order
[2023-03-09 16:15:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 16:15:45] [INFO ] Removed a total of 7621 redundant transitions.
[2023-03-09 16:15:45] [INFO ] Flatten gal took : 787 ms
[2023-03-09 16:15:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 4850 labels/synchronizations in 420 ms.
[2023-03-09 16:15:46] [INFO ] Time to serialize gal into /tmp/LTL4597674453435071629.gal : 48 ms
[2023-03-09 16:15:46] [INFO ] Time to serialize properties into /tmp/LTL10035790306664650297.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4597674453435071629.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10035790306664650297.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((gu95.Node23OKshare>gu95.Node40GiveAnswer19)||(gi2.gu71.Node4GiveAnswer17<2))")||(("(gi2.gu116.Node24GiveAnswer28<3)")&&(X...278
Formula 0 simplified : XXF(!"((gu95.Node23OKshare>gu95.Node40GiveAnswer19)||(gi2.gu71.Node4GiveAnswer17<2))" & (!"(gi2.gu116.Node24GiveAnswer28<3)" | X(!"(...226
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11861242147817150511
[2023-03-09 16:16:02] [INFO ] Built C files in 156ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11861242147817150511
Running compilation step : cd /tmp/ltsmin11861242147817150511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11861242147817150511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11861242147817150511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-11 finished in 267756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 497 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
[2023-03-09 16:16:05] [INFO ] Invariant cache hit.
[2023-03-09 16:16:06] [INFO ] Implicit Places using invariants in 1016 ms returned []
Implicit Place search using SMT only with invariants took 1017 ms to find 0 implicit places.
[2023-03-09 16:16:06] [INFO ] Invariant cache hit.
[2023-03-09 16:16:14] [INFO ] Dead Transitions using invariants and state equation in 7405 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8922 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (GT s5108 s3069) (GT s3115 s186))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-12 finished in 9192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2449 Post agglomeration using F-continuation condition.Transition count delta: 2449
Deduced a syphon composed of 2449 places in 4 ms
Reduce places removed 2449 places and 0 transitions.
Iterating global reduction 2 with 4898 rules applied. Total rules applied 5598 place count 2804 transition count 12501
Drop transitions removed 2351 transitions
Redundant transition composition rules discarded 2351 transitions
Iterating global reduction 2 with 2351 rules applied. Total rules applied 7949 place count 2804 transition count 10150
Applied a total of 7949 rules in 1881 ms. Remains 2804 /5603 variables (removed 2799) and now considering 10150/15300 (removed 5150) transitions.
// Phase 1: matrix 10150 rows 2804 cols
[2023-03-09 16:16:16] [INFO ] Computed 52 place invariants in 427 ms
[2023-03-09 16:16:18] [INFO ] Implicit Places using invariants in 2117 ms returned []
Implicit Place search using SMT only with invariants took 2118 ms to find 0 implicit places.
[2023-03-09 16:16:18] [INFO ] Invariant cache hit.
[2023-03-09 16:16:22] [INFO ] Dead Transitions using invariants and state equation in 4568 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5603 places, 10150/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8571 ms. Remains : 2804/5603 places, 10150/15300 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-15 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:(LEQ 2 s768)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 254 steps with 0 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-15 finished in 8695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||F(p1))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-050-LTLCardinality-03
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2448 Post agglomeration using F-continuation condition.Transition count delta: 2448
Deduced a syphon composed of 2448 places in 5 ms
Reduce places removed 2448 places and 0 transitions.
Iterating global reduction 2 with 4896 rules applied. Total rules applied 5596 place count 2805 transition count 12502
Drop transitions removed 2350 transitions
Redundant transition composition rules discarded 2350 transitions
Iterating global reduction 2 with 2350 rules applied. Total rules applied 7946 place count 2805 transition count 10152
Applied a total of 7946 rules in 1946 ms. Remains 2805 /5603 variables (removed 2798) and now considering 10152/15300 (removed 5148) transitions.
// Phase 1: matrix 10152 rows 2805 cols
[2023-03-09 16:16:25] [INFO ] Computed 52 place invariants in 425 ms
[2023-03-09 16:16:28] [INFO ] Implicit Places using invariants in 2867 ms returned []
Implicit Place search using SMT only with invariants took 2869 ms to find 0 implicit places.
[2023-03-09 16:16:28] [INFO ] Invariant cache hit.
[2023-03-09 16:16:32] [INFO ] Dead Transitions using invariants and state equation in 4111 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2805/5603 places, 10152/15300 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8932 ms. Remains : 2805/5603 places, 10152/15300 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s487 s1729), p0:(LEQ 1 s2359)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 394 reset in 1195 ms.
Product exploration explored 100000 steps with 396 reset in 1694 ms.
Computed a total of 153 stabilizing places and 250 stable transitions
Computed a total of 153 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 3115 steps, including 12 resets, run visited all 2 properties in 92 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 260 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 2805 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2805/2805 places, 10152/10152 transitions.
Applied a total of 0 rules in 300 ms. Remains 2805 /2805 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2023-03-09 16:16:36] [INFO ] Invariant cache hit.
[2023-03-09 16:16:38] [INFO ] Implicit Places using invariants in 2212 ms returned []
Implicit Place search using SMT only with invariants took 2213 ms to find 0 implicit places.
[2023-03-09 16:16:38] [INFO ] Invariant cache hit.
[2023-03-09 16:16:43] [INFO ] Dead Transitions using invariants and state equation in 4704 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7219 ms. Remains : 2805/2805 places, 10152/10152 transitions.
Computed a total of 153 stabilizing places and 250 stable transitions
Computed a total of 153 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 87186 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87186 steps, saw 31693 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 16:16:47] [INFO ] Invariant cache hit.
[2023-03-09 16:16:47] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 16:16:47] [INFO ] [Nat]Absence check using 50 positive place invariants in 29 ms returned sat
[2023-03-09 16:16:47] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 40 ms returned sat
[2023-03-09 16:16:50] [INFO ] After 3025ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 16:16:50] [INFO ] State equation strengthened by 7446 read => feed constraints.
[2023-03-09 16:16:55] [INFO ] After 4240ms SMT Verify possible using 7446 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 16:16:56] [INFO ] After 5278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 701 ms.
[2023-03-09 16:16:56] [INFO ] After 9550ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 3 out of 2805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 10152/10152 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2805 transition count 10151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2804 transition count 10151
Partial Free-agglomeration rule applied 2550 times.
Drop transitions removed 2550 transitions
Iterating global reduction 1 with 2550 rules applied. Total rules applied 2552 place count 2804 transition count 10151
Applied a total of 2552 rules in 1275 ms. Remains 2804 /2805 variables (removed 1) and now considering 10151/10152 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1276 ms. Remains : 2804/2805 places, 10151/10152 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 83945 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83945 steps, saw 29036 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10151 rows 2804 cols
[2023-03-09 16:17:02] [INFO ] Computed 52 place invariants in 435 ms
[2023-03-09 16:17:02] [INFO ] After 438ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 16:17:02] [INFO ] [Nat]Absence check using 50 positive place invariants in 51 ms returned sat
[2023-03-09 16:17:03] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 55 ms returned sat
[2023-03-09 16:17:07] [INFO ] After 4172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 16:17:07] [INFO ] State equation strengthened by 9995 read => feed constraints.
[2023-03-09 16:17:10] [INFO ] After 2733ms SMT Verify possible using 9995 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 16:17:11] [INFO ] After 3997ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 789 ms.
[2023-03-09 16:17:12] [INFO ] After 9740ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 41 steps, including 1 resets, run visited all 2 properties in 4 ms. (steps per millisecond=10 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 225 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 397 reset in 1505 ms.
Product exploration explored 100000 steps with 395 reset in 1318 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 2805 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2805/2805 places, 10152/10152 transitions.
Applied a total of 0 rules in 439 ms. Remains 2805 /2805 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
// Phase 1: matrix 10152 rows 2805 cols
[2023-03-09 16:17:16] [INFO ] Computed 52 place invariants in 400 ms
[2023-03-09 16:17:21] [INFO ] Dead Transitions using invariants and state equation in 4919 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5360 ms. Remains : 2805/2805 places, 10152/10152 transitions.
Built C files in :
/tmp/ltsmin17781618023525253828
[2023-03-09 16:17:21] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17781618023525253828
Running compilation step : cd /tmp/ltsmin17781618023525253828;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17781618023525253828;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17781618023525253828;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 2805 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2805/2805 places, 10152/10152 transitions.
Applied a total of 0 rules in 194 ms. Remains 2805 /2805 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2023-03-09 16:17:24] [INFO ] Invariant cache hit.
[2023-03-09 16:17:26] [INFO ] Implicit Places using invariants in 2178 ms returned []
Implicit Place search using SMT only with invariants took 2179 ms to find 0 implicit places.
[2023-03-09 16:17:26] [INFO ] Invariant cache hit.
[2023-03-09 16:17:31] [INFO ] Dead Transitions using invariants and state equation in 4897 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7271 ms. Remains : 2805/2805 places, 10152/10152 transitions.
Built C files in :
/tmp/ltsmin8824395791535283636
[2023-03-09 16:17:31] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8824395791535283636
Running compilation step : cd /tmp/ltsmin8824395791535283636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8824395791535283636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8824395791535283636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 16:17:35] [INFO ] Flatten gal took : 256 ms
[2023-03-09 16:17:35] [INFO ] Flatten gal took : 278 ms
[2023-03-09 16:17:35] [INFO ] Time to serialize gal into /tmp/LTL17610655305744599101.gal : 66 ms
[2023-03-09 16:17:35] [INFO ] Time to serialize properties into /tmp/LTL1858175721912176321.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17610655305744599101.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16729413273220008423.hoa' '-atoms' '/tmp/LTL1858175721912176321.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1858175721912176321.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16729413273220008423.hoa
Detected timeout of ITS tools.
[2023-03-09 16:17:51] [INFO ] Flatten gal took : 258 ms
[2023-03-09 16:17:51] [INFO ] Flatten gal took : 181 ms
[2023-03-09 16:17:51] [INFO ] Time to serialize gal into /tmp/LTL7685487227747816347.gal : 33 ms
[2023-03-09 16:17:51] [INFO ] Time to serialize properties into /tmp/LTL6922373670525768175.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7685487227747816347.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6922373670525768175.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((X("(Node41requestsent4>=1)"))||(F("(Node3GiveAnswer34<=Node28GiveAnswer24)")))))
Formula 0 simplified : F(X!"(Node41requestsent4>=1)" & G!"(Node3GiveAnswer34<=Node28GiveAnswer24)")
Detected timeout of ITS tools.
[2023-03-09 16:18:06] [INFO ] Flatten gal took : 173 ms
[2023-03-09 16:18:06] [INFO ] Applying decomposition
[2023-03-09 16:18:06] [INFO ] Flatten gal took : 195 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6082293148589920277.txt' '-o' '/tmp/graph6082293148589920277.bin' '-w' '/tmp/graph6082293148589920277.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6082293148589920277.bin' '-l' '-1' '-v' '-w' '/tmp/graph6082293148589920277.weights' '-q' '0' '-e' '0.001'
[2023-03-09 16:18:07] [INFO ] Decomposing Gal with order
[2023-03-09 16:18:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 16:18:08] [INFO ] Removed a total of 7515 redundant transitions.
[2023-03-09 16:18:08] [INFO ] Flatten gal took : 698 ms
[2023-03-09 16:18:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 4902 labels/synchronizations in 399 ms.
[2023-03-09 16:18:09] [INFO ] Time to serialize gal into /tmp/LTL6681682225209445543.gal : 42 ms
[2023-03-09 16:18:09] [INFO ] Time to serialize properties into /tmp/LTL2731625361281657595.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6681682225209445543.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2731625361281657595.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((X("(gi0.gu42.Node41requestsent4>=1)"))||(F("(gu51.Node3GiveAnswer34<=gu51.Node28GiveAnswer24)")))))
Formula 0 simplified : F(X!"(gi0.gu42.Node41requestsent4>=1)" & G!"(gu51.Node3GiveAnswer34<=gu51.Node28GiveAnswer24)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12945698178505752918
[2023-03-09 16:18:24] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12945698178505752918
Running compilation step : cd /tmp/ltsmin12945698178505752918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12945698178505752918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12945698178505752918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-03 finished in 124450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p1&&X((p1 U (p2||G(p1)))))||p0)))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-050-LTLCardinality-11
Stuttering acceptance computed with spot in 227 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2398 Post agglomeration using F-continuation condition.Transition count delta: 2398
Deduced a syphon composed of 2398 places in 5 ms
Reduce places removed 2398 places and 0 transitions.
Iterating global reduction 2 with 4796 rules applied. Total rules applied 5496 place count 2855 transition count 12552
Drop transitions removed 2301 transitions
Redundant transition composition rules discarded 2301 transitions
Iterating global reduction 2 with 2301 rules applied. Total rules applied 7797 place count 2855 transition count 10251
Partial Post-agglomeration rule applied 98 times.
Drop transitions removed 98 transitions
Iterating global reduction 2 with 98 rules applied. Total rules applied 7895 place count 2855 transition count 10251
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 7943 place count 2807 transition count 10203
Iterating global reduction 2 with 48 rules applied. Total rules applied 7991 place count 2807 transition count 10203
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 2 with 48 rules applied. Total rules applied 8039 place count 2807 transition count 10155
Applied a total of 8039 rules in 2886 ms. Remains 2807 /5603 variables (removed 2796) and now considering 10155/15300 (removed 5145) transitions.
// Phase 1: matrix 10155 rows 2807 cols
[2023-03-09 16:18:31] [INFO ] Computed 52 place invariants in 378 ms
[2023-03-09 16:18:33] [INFO ] Implicit Places using invariants in 2534 ms returned []
Implicit Place search using SMT only with invariants took 2537 ms to find 0 implicit places.
[2023-03-09 16:18:33] [INFO ] Invariant cache hit.
[2023-03-09 16:18:37] [INFO ] Dead Transitions using invariants and state equation in 4675 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2807/5603 places, 10155/15300 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10099 ms. Remains : 2807/5603 places, 10155/15300 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(OR (GT s145 s2326) (GT 2 s521)), p1:(GT 3 s1533), p2:(GT 2 s521)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 394 reset in 1380 ms.
Product exploration explored 100000 steps with 394 reset in 1413 ms.
Computed a total of 153 stabilizing places and 250 stable transitions
Computed a total of 153 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 326 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 76549 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76549 steps, saw 30271 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-09 16:18:44] [INFO ] Invariant cache hit.
[2023-03-09 16:18:45] [INFO ] [Real]Absence check using 50 positive place invariants in 24 ms returned sat
[2023-03-09 16:18:45] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2023-03-09 16:18:48] [INFO ] After 3757ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 16:18:49] [INFO ] [Nat]Absence check using 50 positive place invariants in 29 ms returned sat
[2023-03-09 16:18:49] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 38 ms returned sat
[2023-03-09 16:18:54] [INFO ] After 4343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 16:18:54] [INFO ] State equation strengthened by 7445 read => feed constraints.
[2023-03-09 16:18:59] [INFO ] After 5307ms SMT Verify possible using 7445 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 16:19:02] [INFO ] After 8401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2133 ms.
[2023-03-09 16:19:04] [INFO ] After 15951ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 2807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2807/2807 places, 10155/10155 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2807 transition count 10154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2806 transition count 10154
Partial Free-agglomeration rule applied 2551 times.
Drop transitions removed 2551 transitions
Iterating global reduction 1 with 2551 rules applied. Total rules applied 2553 place count 2806 transition count 10154
Applied a total of 2553 rules in 1234 ms. Remains 2806 /2807 variables (removed 1) and now considering 10154/10155 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1236 ms. Remains : 2806/2807 places, 10154/10155 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 78856 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78856 steps, saw 28307 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10154 rows 2806 cols
[2023-03-09 16:19:09] [INFO ] Computed 52 place invariants in 453 ms
[2023-03-09 16:19:10] [INFO ] [Real]Absence check using 50 positive place invariants in 31 ms returned sat
[2023-03-09 16:19:10] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 39 ms returned sat
[2023-03-09 16:19:14] [INFO ] After 4539ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 16:19:14] [INFO ] [Nat]Absence check using 50 positive place invariants in 32 ms returned sat
[2023-03-09 16:19:14] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 39 ms returned sat
[2023-03-09 16:19:20] [INFO ] After 4805ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 16:19:20] [INFO ] State equation strengthened by 9995 read => feed constraints.
[2023-03-09 16:19:24] [INFO ] After 4449ms SMT Verify possible using 9995 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 16:19:28] [INFO ] After 8116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2625 ms.
[2023-03-09 16:19:30] [INFO ] After 16535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 27 ms.
Support contains 4 out of 2806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2806/2806 places, 10154/10154 transitions.
Applied a total of 0 rules in 486 ms. Remains 2806 /2806 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 486 ms. Remains : 2806/2806 places, 10154/10154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2806/2806 places, 10154/10154 transitions.
Applied a total of 0 rules in 407 ms. Remains 2806 /2806 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
[2023-03-09 16:19:31] [INFO ] Invariant cache hit.
[2023-03-09 16:19:35] [INFO ] Implicit Places using invariants in 3762 ms returned []
Implicit Place search using SMT only with invariants took 3763 ms to find 0 implicit places.
[2023-03-09 16:19:35] [INFO ] Invariant cache hit.
[2023-03-09 16:19:40] [INFO ] Dead Transitions using invariants and state equation in 4765 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8936 ms. Remains : 2806/2806 places, 10154/10154 transitions.
Graph (trivial) has 9842 edges and 2806 vertex of which 2599 / 2806 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2597 places
Drop transitions removed 7396 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9938 transitions.
Graph (complete) has 518 edges and 209 vertex of which 60 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.0 ms
Discarding 149 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 60 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 104 place count 59 transition count 67
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 151 place count 12 transition count 20
Iterating global reduction 2 with 47 rules applied. Total rules applied 198 place count 12 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 200 place count 12 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 201 place count 12 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 202 place count 11 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 205 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 207 place count 8 transition count 13
Applied a total of 207 rules in 19 ms. Remains 8 /2806 variables (removed 2798) and now considering 13/10154 (removed 10141) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 13 rows 8 cols
[2023-03-09 16:19:40] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 16:19:40] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 16:19:40] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 16:19:40] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 16:19:40] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 219 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2807 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2807/2807 places, 10155/10155 transitions.
Applied a total of 0 rules in 255 ms. Remains 2807 /2807 variables (removed 0) and now considering 10155/10155 (removed 0) transitions.
// Phase 1: matrix 10155 rows 2807 cols
[2023-03-09 16:19:41] [INFO ] Computed 52 place invariants in 381 ms
[2023-03-09 16:19:43] [INFO ] Implicit Places using invariants in 2562 ms returned []
Implicit Place search using SMT only with invariants took 2563 ms to find 0 implicit places.
[2023-03-09 16:19:43] [INFO ] Invariant cache hit.
[2023-03-09 16:19:49] [INFO ] Dead Transitions using invariants and state equation in 5110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7934 ms. Remains : 2807/2807 places, 10155/10155 transitions.
Computed a total of 153 stabilizing places and 250 stable transitions
Computed a total of 153 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 248 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) 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 6) 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 6) seen :0
Interrupted probabilistic random walk after 73857 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73857 steps, saw 29955 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-09 16:19:53] [INFO ] Invariant cache hit.
[2023-03-09 16:19:53] [INFO ] [Real]Absence check using 50 positive place invariants in 21 ms returned sat
[2023-03-09 16:19:53] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-09 16:19:56] [INFO ] After 3530ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 16:19:57] [INFO ] [Nat]Absence check using 50 positive place invariants in 49 ms returned sat
[2023-03-09 16:19:57] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 53 ms returned sat
[2023-03-09 16:20:01] [INFO ] After 4287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 16:20:02] [INFO ] State equation strengthened by 7445 read => feed constraints.
[2023-03-09 16:20:07] [INFO ] After 5166ms SMT Verify possible using 7445 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 16:20:10] [INFO ] After 8499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2176 ms.
[2023-03-09 16:20:12] [INFO ] After 15957ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 2807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2807/2807 places, 10155/10155 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2807 transition count 10154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2806 transition count 10154
Partial Free-agglomeration rule applied 2551 times.
Drop transitions removed 2551 transitions
Iterating global reduction 1 with 2551 rules applied. Total rules applied 2553 place count 2806 transition count 10154
Applied a total of 2553 rules in 1215 ms. Remains 2806 /2807 variables (removed 1) and now considering 10154/10155 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1215 ms. Remains : 2806/2807 places, 10154/10155 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 75920 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75920 steps, saw 27985 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10154 rows 2806 cols
[2023-03-09 16:20:17] [INFO ] Computed 52 place invariants in 417 ms
[2023-03-09 16:20:18] [INFO ] [Real]Absence check using 50 positive place invariants in 30 ms returned sat
[2023-03-09 16:20:18] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 39 ms returned sat
[2023-03-09 16:20:22] [INFO ] After 4309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 16:20:22] [INFO ] [Nat]Absence check using 50 positive place invariants in 29 ms returned sat
[2023-03-09 16:20:22] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 39 ms returned sat
[2023-03-09 16:20:27] [INFO ] After 4711ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 16:20:27] [INFO ] State equation strengthened by 9995 read => feed constraints.
[2023-03-09 16:20:32] [INFO ] After 4644ms SMT Verify possible using 9995 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 16:20:36] [INFO ] After 8248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2764 ms.
[2023-03-09 16:20:38] [INFO ] After 16790ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 2806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2806/2806 places, 10154/10154 transitions.
Applied a total of 0 rules in 499 ms. Remains 2806 /2806 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 500 ms. Remains : 2806/2806 places, 10154/10154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2806/2806 places, 10154/10154 transitions.
Applied a total of 0 rules in 471 ms. Remains 2806 /2806 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
[2023-03-09 16:20:39] [INFO ] Invariant cache hit.
[2023-03-09 16:20:43] [INFO ] Implicit Places using invariants in 3562 ms returned []
Implicit Place search using SMT only with invariants took 3563 ms to find 0 implicit places.
[2023-03-09 16:20:43] [INFO ] Invariant cache hit.
[2023-03-09 16:20:48] [INFO ] Dead Transitions using invariants and state equation in 4929 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8964 ms. Remains : 2806/2806 places, 10154/10154 transitions.
Graph (trivial) has 9842 edges and 2806 vertex of which 2599 / 2806 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2597 places
Drop transitions removed 7396 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9938 transitions.
Graph (complete) has 518 edges and 209 vertex of which 60 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.0 ms
Discarding 149 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 60 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 104 place count 59 transition count 67
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 151 place count 12 transition count 20
Iterating global reduction 2 with 47 rules applied. Total rules applied 198 place count 12 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 200 place count 12 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 201 place count 12 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 202 place count 11 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 205 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 207 place count 8 transition count 13
Applied a total of 207 rules in 42 ms. Remains 8 /2806 variables (removed 2798) and now considering 13/10154 (removed 10141) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 13 rows 8 cols
[2023-03-09 16:20:48] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 16:20:48] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 16:20:48] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 16:20:48] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-09 16:20:48] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 199 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 223 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 393 reset in 1607 ms.
Product exploration explored 100000 steps with 394 reset in 1463 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 245 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2807 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2807/2807 places, 10155/10155 transitions.
Applied a total of 0 rules in 466 ms. Remains 2807 /2807 variables (removed 0) and now considering 10155/10155 (removed 0) transitions.
// Phase 1: matrix 10155 rows 2807 cols
[2023-03-09 16:20:53] [INFO ] Computed 52 place invariants in 385 ms
[2023-03-09 16:20:58] [INFO ] Dead Transitions using invariants and state equation in 5628 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6106 ms. Remains : 2807/2807 places, 10155/10155 transitions.
Built C files in :
/tmp/ltsmin15366000698775884956
[2023-03-09 16:20:58] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15366000698775884956
Running compilation step : cd /tmp/ltsmin15366000698775884956;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin15366000698775884956;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin15366000698775884956;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2807 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2807/2807 places, 10155/10155 transitions.
Applied a total of 0 rules in 212 ms. Remains 2807 /2807 variables (removed 0) and now considering 10155/10155 (removed 0) transitions.
[2023-03-09 16:21:02] [INFO ] Invariant cache hit.
[2023-03-09 16:21:04] [INFO ] Implicit Places using invariants in 2206 ms returned []
Implicit Place search using SMT only with invariants took 2209 ms to find 0 implicit places.
[2023-03-09 16:21:04] [INFO ] Invariant cache hit.
[2023-03-09 16:21:09] [INFO ] Dead Transitions using invariants and state equation in 4766 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7189 ms. Remains : 2807/2807 places, 10155/10155 transitions.
Built C files in :
/tmp/ltsmin17457086453814361587
[2023-03-09 16:21:09] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17457086453814361587
Running compilation step : cd /tmp/ltsmin17457086453814361587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17457086453814361587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17457086453814361587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 16:21:12] [INFO ] Flatten gal took : 219 ms
[2023-03-09 16:21:12] [INFO ] Flatten gal took : 229 ms
[2023-03-09 16:21:13] [INFO ] Time to serialize gal into /tmp/LTL13404937697127746056.gal : 38 ms
[2023-03-09 16:21:13] [INFO ] Time to serialize properties into /tmp/LTL17144090820012931533.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13404937697127746056.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11490722637016097589.hoa' '-atoms' '/tmp/LTL17144090820012931533.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17144090820012931533.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11490722637016097589.hoa
Detected timeout of ITS tools.
[2023-03-09 16:21:28] [INFO ] Flatten gal took : 229 ms
[2023-03-09 16:21:28] [INFO ] Flatten gal took : 261 ms
[2023-03-09 16:21:28] [INFO ] Time to serialize gal into /tmp/LTL12557378858044744741.gal : 47 ms
[2023-03-09 16:21:28] [INFO ] Time to serialize properties into /tmp/LTL913309417136996285.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12557378858044744741.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL913309417136996285.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((Node23OKshare>Node40GiveAnswer19)||(Node4GiveAnswer17<2))")||(("(Node24GiveAnswer28<3)")&&(X(("(Node24GiveAnswer28<3)")U(...220
Formula 0 simplified : XXF(!"((Node23OKshare>Node40GiveAnswer19)||(Node4GiveAnswer17<2))" & (!"(Node24GiveAnswer28<3)" | X(!"(Node24GiveAnswer28<3)" M !"(N...178
Detected timeout of ITS tools.
[2023-03-09 16:21:44] [INFO ] Flatten gal took : 206 ms
[2023-03-09 16:21:44] [INFO ] Applying decomposition
[2023-03-09 16:21:44] [INFO ] Flatten gal took : 226 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph285667766596681027.txt' '-o' '/tmp/graph285667766596681027.bin' '-w' '/tmp/graph285667766596681027.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph285667766596681027.bin' '-l' '-1' '-v' '-w' '/tmp/graph285667766596681027.weights' '-q' '0' '-e' '0.001'
[2023-03-09 16:21:44] [INFO ] Decomposing Gal with order
[2023-03-09 16:21:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 16:21:45] [INFO ] Removed a total of 7518 redundant transitions.
[2023-03-09 16:21:45] [INFO ] Flatten gal took : 669 ms
[2023-03-09 16:21:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 4902 labels/synchronizations in 386 ms.
[2023-03-09 16:21:46] [INFO ] Time to serialize gal into /tmp/LTL13417227097625387861.gal : 50 ms
[2023-03-09 16:21:46] [INFO ] Time to serialize properties into /tmp/LTL4633698393576794471.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13417227097625387861.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4633698393576794471.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((gu51.Node23OKshare>gu51.Node40GiveAnswer19)||(gi0.gu18.Node4GiveAnswer17<2))")||(("(gi0.gu29.Node24GiveAnswer28<3)")&&(X(...275
Formula 0 simplified : XXF(!"((gu51.Node23OKshare>gu51.Node40GiveAnswer19)||(gi0.gu18.Node4GiveAnswer17<2))" & (!"(gi0.gu29.Node24GiveAnswer28<3)" | X(!"(g...224
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8297612979514511927
[2023-03-09 16:22:01] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8297612979514511927
Running compilation step : cd /tmp/ltsmin8297612979514511927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8297612979514511927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8297612979514511927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-11 finished in 217237 ms.
[2023-03-09 16:22:05] [INFO ] Flatten gal took : 425 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2824788699077204737
[2023-03-09 16:22:05] [INFO ] Too many transitions (15300) to apply POR reductions. Disabling POR matrices.
[2023-03-09 16:22:05] [INFO ] Built C files in 116ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2824788699077204737
Running compilation step : cd /tmp/ltsmin2824788699077204737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-09 16:22:05] [INFO ] Applying decomposition
[2023-03-09 16:22:05] [INFO ] Flatten gal took : 390 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12950520888128963233.txt' '-o' '/tmp/graph12950520888128963233.bin' '-w' '/tmp/graph12950520888128963233.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12950520888128963233.bin' '-l' '-1' '-v' '-w' '/tmp/graph12950520888128963233.weights' '-q' '0' '-e' '0.001'
[2023-03-09 16:22:06] [INFO ] Decomposing Gal with order
[2023-03-09 16:22:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 16:22:07] [INFO ] Removed a total of 7631 redundant transitions.
[2023-03-09 16:22:07] [INFO ] Flatten gal took : 758 ms
[2023-03-09 16:22:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 4906 labels/synchronizations in 438 ms.
[2023-03-09 16:22:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality17280885539078734564.gal : 52 ms
[2023-03-09 16:22:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality11328555375381700482.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17280885539078734564.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11328555375381700482.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 2 LTL properties
Checking formula 0 : !((G((X("(gi1.gi21.gu167.Node41requestsent4>=1)"))||(F("(gu200.Node3GiveAnswer34<=gu200.Node28GiveAnswer24)")))))
Formula 0 simplified : F(X!"(gi1.gi21.gu167.Node41requestsent4>=1)" & G!"(gu200.Node3GiveAnswer34<=gu200.Node28GiveAnswer24)")
Compilation finished in 126116 ms.
Running link step : cd /tmp/ltsmin2824788699077204737;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 174 ms.
Running LTSmin : cd /tmp/ltsmin2824788699077204737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp0==true))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-09 16:47:38] [INFO ] Flatten gal took : 408 ms
[2023-03-09 16:47:39] [INFO ] Time to serialize gal into /tmp/LTLCardinality9834683454103040858.gal : 63 ms
[2023-03-09 16:47:39] [INFO ] Time to serialize properties into /tmp/LTLCardinality11833439302360252389.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9834683454103040858.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11833439302360252389.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((G((X("(Node41requestsent4>=1)"))||(F("(Node3GiveAnswer34<=Node28GiveAnswer24)")))))
Formula 0 simplified : F(X!"(Node41requestsent4>=1)" & G!"(Node3GiveAnswer34<=Node28GiveAnswer24)")
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin2824788699077204737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp0==true))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2824788699077204737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((((LTLAPp3==true)&&X(((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true))))))||(LTLAPp2==true)))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 5879932 kB
After kill :
MemTotal: 16393340 kB
MemFree: 14540608 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-050"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-050, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-167813690800739"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-050.tgz
mv CANInsertWithFailure-PT-050 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;