MCC'2024- Execution of r524-tall-171679080300427

About the Execution of LTSMin+red for SafeBus-PT-10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
4284.300	1142463.00	3437728.00	1166.50	FFFTFFTFFFFFFFTF	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 21K Apr 12 15:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 12 15:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 145K Apr 12 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 605K Apr 12 15:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.4K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 79K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 245K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Apr 12 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 218K Apr 12 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 989K Apr 12 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.1K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717226902144

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:28:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:28:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:28:23] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-06-01 07:28:23] [INFO ] Transformed 316 places.
[2024-06-01 07:28:23] [INFO ] Transformed 1631 transitions.
[2024-06-01 07:28:23] [INFO ] Found NUPN structural information;
[2024-06-01 07:28:23] [INFO ] Parsed PT model containing 316 places and 1631 transitions and 11384 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 10 places and 0 transitions.
FORMULA SafeBus-PT-10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 121 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 43 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-06-01 07:28:23] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-06-01 07:28:23] [INFO ] Computed 45 invariants in 45 ms
[2024-06-01 07:28:25] [INFO ] Implicit Places using invariants in 1207 ms returned [266, 267, 269, 270, 271, 272, 273, 274, 275]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 1239 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 297/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 28 ms. Remains 297 /297 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1327 ms. Remains : 297/306 places, 1631/1631 transitions.
Support contains 121 out of 297 places after structural reductions.
[2024-06-01 07:28:25] [INFO ] Flatten gal took : 175 ms
[2024-06-01 07:28:25] [INFO ] Flatten gal took : 107 ms
[2024-06-01 07:28:25] [INFO ] Input system was already deterministic with 1631 transitions.
RANDOM walk for 966 steps (0 resets) in 229 ms. (4 steps per ms) remains 0/12 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 110 out of 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 226 ms. Remains 297 /297 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-06-01 07:28:26] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 297 cols
[2024-06-01 07:28:26] [INFO ] Computed 36 invariants in 17 ms
[2024-06-01 07:28:27] [INFO ] Implicit Places using invariants in 992 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 996 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 128 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1356 ms. Remains : 296/297 places, 1631/1631 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 932 ms.
Product exploration explored 100000 steps with 0 reset in 885 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 75 steps (0 resets) in 11 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2024-06-01 07:28:29] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-06-01 07:28:30] [INFO ] Computed 35 invariants in 10 ms
[2024-06-01 07:28:32] [INFO ] [Real]Absence check using 14 positive place invariants in 31 ms returned sat
[2024-06-01 07:28:32] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 130 ms returned sat
[2024-06-01 07:28:34] [INFO ] [Real]Absence check using state equation in 1061 ms returned sat
[2024-06-01 07:28:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:28:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2024-06-01 07:28:37] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 76 ms returned sat
[2024-06-01 07:28:38] [INFO ] [Nat]Absence check using state equation in 1447 ms returned sat
[2024-06-01 07:28:38] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:28:38] [INFO ] [Nat]Added 111 Read/Feed constraints in 112 ms returned sat
[2024-06-01 07:28:38] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 119 ms.
[2024-06-01 07:28:39] [INFO ] Added : 2 causal constraints over 2 iterations in 333 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 110 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1631/1631 transitions.
Applied a total of 0 rules in 114 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-06-01 07:28:39] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-06-01 07:28:39] [INFO ] Invariant cache hit.
[2024-06-01 07:28:40] [INFO ] Implicit Places using invariants in 960 ms returned []
[2024-06-01 07:28:40] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-06-01 07:28:40] [INFO ] Invariant cache hit.
[2024-06-01 07:28:40] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:28:42] [INFO ] Implicit Places using invariants and state equation in 2064 ms returned []
Implicit Place search using SMT with State Equation took 3033 ms to find 0 implicit places.
[2024-06-01 07:28:42] [INFO ] Redundant transitions in 103 ms returned []
Running 1621 sub problems to find dead transitions.
[2024-06-01 07:28:42] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-06-01 07:28:42] [INFO ] Invariant cache hit.
[2024-06-01 07:28:42] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 47 places in 238 ms of which 22 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 49 places in 259 ms of which 12 ms to minimize.
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 21 places in 259 ms of which 3 ms to minimize.
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 3 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 69 places in 220 ms of which 6 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 1 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 76 places in 220 ms of which 2 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 1 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 1 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 56 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 2 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 2 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 2 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 2 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 2 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 2 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 2 ms to minimize.
(s167 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0timeout
)
(s168 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 351 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30042 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1621/1621 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-06-01 07:29:31] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:29:31] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 2 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 2 ms to minimize.
[2024-06-01 07:29:42] [INFO ] Deduced a trap composed of 68 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:29:44] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:29:45] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:29:45] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:29:46] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 359 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30039 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1621 constraints, Known Traps: 28/28 constraints]
After SMT, in 64681ms problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 64725ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 296/296 places, 1531/1631 transitions.
Applied a total of 0 rules in 101 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:29:47] [INFO ] Redundant transitions in 30 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 68131 ms. Remains : 296/296 places, 1531/1631 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 79 steps (0 resets) in 7 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-06-01 07:29:47] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-06-01 07:29:47] [INFO ] Computed 35 invariants in 12 ms
[2024-06-01 07:29:50] [INFO ] [Real]Absence check using 14 positive place invariants in 67 ms returned sat
[2024-06-01 07:29:50] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 168 ms returned sat
[2024-06-01 07:29:52] [INFO ] [Real]Absence check using state equation in 1319 ms returned sat
[2024-06-01 07:29:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:29:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-06-01 07:29:55] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 47 ms returned sat
[2024-06-01 07:29:57] [INFO ] [Nat]Absence check using state equation in 2463 ms returned sat
[2024-06-01 07:29:57] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:29:58] [INFO ] [Nat]Added 111 Read/Feed constraints in 1292 ms returned sat
[2024-06-01 07:29:58] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 63 ms.
[2024-06-01 07:29:58] [INFO ] Added : 0 causal constraints over 0 iterations in 125 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 687 ms.
Product exploration explored 100000 steps with 0 reset in 714 ms.
Support contains 110 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 88 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:30:00] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:30:00] [INFO ] Invariant cache hit.
[2024-06-01 07:30:01] [INFO ] Implicit Places using invariants in 1024 ms returned []
[2024-06-01 07:30:01] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:30:01] [INFO ] Invariant cache hit.
[2024-06-01 07:30:01] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:30:03] [INFO ] Implicit Places using invariants and state equation in 2005 ms returned []
Implicit Place search using SMT with State Equation took 3034 ms to find 0 implicit places.
[2024-06-01 07:30:03] [INFO ] Redundant transitions in 19 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 07:30:03] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:30:03] [INFO ] Invariant cache hit.
[2024-06-01 07:30:03] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:30:16] [INFO ] Deduced a trap composed of 40 places in 196 ms of which 2 ms to minimize.
[2024-06-01 07:30:16] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 2 ms to minimize.
[2024-06-01 07:30:16] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 2 ms to minimize.
[2024-06-01 07:30:16] [INFO ] Deduced a trap composed of 74 places in 193 ms of which 1 ms to minimize.
[2024-06-01 07:30:16] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 35 places in 203 ms of which 2 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 5 ms to minimize.
[2024-06-01 07:30:26] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 2 ms to minimize.
[2024-06-01 07:30:26] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 2 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 57 places in 186 ms of which 1 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 2 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 1 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 2 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 1 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 2 ms to minimize.
[2024-06-01 07:30:31] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 2 ms to minimize.
[2024-06-01 07:30:31] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 2 ms to minimize.
[2024-06-01 07:30:31] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 2 ms to minimize.
[2024-06-01 07:30:31] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:30:32] [INFO ] Deduced a trap composed of 57 places in 145 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 351 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30029 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:31:06] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 2 ms to minimize.
[2024-06-01 07:31:06] [INFO ] Deduced a trap composed of 39 places in 201 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 353 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30024 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 22/22 constraints]
After SMT, in 63375ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63390ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66540 ms. Remains : 296/296 places, 1531/1531 transitions.
Treatment of property SafeBus-PT-10-LTLCardinality-00 finished in 160880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 30 ms. Remains 297 /297 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-06-01 07:31:07] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 297 cols
[2024-06-01 07:31:07] [INFO ] Computed 36 invariants in 6 ms
[2024-06-01 07:31:08] [INFO ] Implicit Places using invariants in 923 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 927 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 8 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 966 ms. Remains : 296/297 places, 1631/1631 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SafeBus-PT-10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLCardinality-02 finished in 1099 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 11 out of 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 104 ms. Remains 297 /297 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-06-01 07:31:08] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-06-01 07:31:08] [INFO ] Invariant cache hit.
[2024-06-01 07:31:09] [INFO ] Implicit Places using invariants in 854 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 858 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 100 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1062 ms. Remains : 296/297 places, 1631/1631 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-03
Product exploration explored 100000 steps with 5989 reset in 402 ms.
Product exploration explored 100000 steps with 6472 reset in 344 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 56 steps (0 resets) in 5 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-06-01 07:31:10] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-06-01 07:31:10] [INFO ] Computed 35 invariants in 4 ms
[2024-06-01 07:31:11] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-06-01 07:31:11] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 86 ms returned sat
[2024-06-01 07:31:12] [INFO ] [Real]Absence check using state equation in 1336 ms returned sat
[2024-06-01 07:31:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:31:13] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-06-01 07:31:13] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 201 ms returned sat
[2024-06-01 07:31:13] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2024-06-01 07:31:13] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:31:13] [INFO ] [Nat]Added 111 Read/Feed constraints in 85 ms returned sat
[2024-06-01 07:31:13] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 70 ms.
[2024-06-01 07:31:13] [INFO ] Added : 1 causal constraints over 1 iterations in 163 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1631/1631 transitions.
Applied a total of 0 rules in 96 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-06-01 07:31:14] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-06-01 07:31:14] [INFO ] Invariant cache hit.
[2024-06-01 07:31:14] [INFO ] Implicit Places using invariants in 815 ms returned []
[2024-06-01 07:31:14] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-06-01 07:31:14] [INFO ] Invariant cache hit.
[2024-06-01 07:31:15] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:31:16] [INFO ] Implicit Places using invariants and state equation in 2069 ms returned []
Implicit Place search using SMT with State Equation took 2891 ms to find 0 implicit places.
[2024-06-01 07:31:16] [INFO ] Redundant transitions in 21 ms returned []
Running 1621 sub problems to find dead transitions.
[2024-06-01 07:31:16] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-06-01 07:31:16] [INFO ] Invariant cache hit.
[2024-06-01 07:31:16] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-06-01 07:31:31] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 2 ms to minimize.
[2024-06-01 07:31:33] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 2 ms to minimize.
[2024-06-01 07:31:40] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 2 ms to minimize.
[2024-06-01 07:31:41] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 2 ms to minimize.
[2024-06-01 07:31:41] [INFO ] Deduced a trap composed of 69 places in 227 ms of which 1 ms to minimize.
[2024-06-01 07:31:41] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 2 ms to minimize.
[2024-06-01 07:31:41] [INFO ] Deduced a trap composed of 38 places in 234 ms of which 11 ms to minimize.
[2024-06-01 07:31:42] [INFO ] Deduced a trap composed of 76 places in 226 ms of which 2 ms to minimize.
[2024-06-01 07:31:43] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 1 ms to minimize.
[2024-06-01 07:31:43] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:31:43] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 1 ms to minimize.
[2024-06-01 07:31:43] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 1 ms to minimize.
[2024-06-01 07:31:43] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:31:44] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 2 ms to minimize.
[2024-06-01 07:31:44] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 1 ms to minimize.
[2024-06-01 07:31:47] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 2 ms to minimize.
[2024-06-01 07:31:47] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 2 ms to minimize.
[2024-06-01 07:31:47] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 2 ms to minimize.
[2024-06-01 07:31:48] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 2 ms to minimize.
[2024-06-01 07:31:48] [INFO ] Deduced a trap composed of 57 places in 151 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 351 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30033 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1621/1621 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-06-01 07:32:05] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 2 ms to minimize.
[2024-06-01 07:32:05] [INFO ] Deduced a trap composed of 35 places in 207 ms of which 2 ms to minimize.
[2024-06-01 07:32:08] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 2 ms to minimize.
[2024-06-01 07:32:16] [INFO ] Deduced a trap composed of 68 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:32:18] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:32:19] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 1 ms to minimize.
[2024-06-01 07:32:20] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:32:20] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 359 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30031 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1621 constraints, Known Traps: 28/28 constraints]
After SMT, in 64484ms problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 64499ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 296/296 places, 1531/1631 transitions.
Applied a total of 0 rules in 109 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:32:21] [INFO ] Redundant transitions in 19 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 67657 ms. Remains : 296/296 places, 1531/1631 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 58 steps (0 resets) in 5 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-06-01 07:32:22] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-06-01 07:32:22] [INFO ] Computed 35 invariants in 6 ms
[2024-06-01 07:32:22] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2024-06-01 07:32:22] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 305 ms returned sat
[2024-06-01 07:32:24] [INFO ] [Real]Absence check using state equation in 1201 ms returned sat
[2024-06-01 07:32:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:32:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-06-01 07:32:24] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 140 ms returned sat
[2024-06-01 07:32:25] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2024-06-01 07:32:25] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:32:25] [INFO ] [Nat]Added 111 Read/Feed constraints in 97 ms returned sat
[2024-06-01 07:32:25] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 49 ms.
[2024-06-01 07:32:25] [INFO ] Added : 1 causal constraints over 1 iterations in 146 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1253 reset in 435 ms.
Product exploration explored 100000 steps with 6462 reset in 335 ms.
Support contains 11 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 81 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:32:26] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:32:26] [INFO ] Invariant cache hit.
[2024-06-01 07:32:27] [INFO ] Implicit Places using invariants in 959 ms returned []
[2024-06-01 07:32:27] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:32:27] [INFO ] Invariant cache hit.
[2024-06-01 07:32:27] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:32:29] [INFO ] Implicit Places using invariants and state equation in 2305 ms returned []
Implicit Place search using SMT with State Equation took 3267 ms to find 0 implicit places.
[2024-06-01 07:32:29] [INFO ] Redundant transitions in 22 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 07:32:29] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:32:29] [INFO ] Invariant cache hit.
[2024-06-01 07:32:29] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:32:42] [INFO ] Deduced a trap composed of 40 places in 199 ms of which 2 ms to minimize.
[2024-06-01 07:32:42] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 2 ms to minimize.
[2024-06-01 07:32:42] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 1 ms to minimize.
[2024-06-01 07:32:42] [INFO ] Deduced a trap composed of 74 places in 213 ms of which 1 ms to minimize.
[2024-06-01 07:32:42] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:32:52] [INFO ] Deduced a trap composed of 35 places in 224 ms of which 2 ms to minimize.
[2024-06-01 07:32:52] [INFO ] Deduced a trap composed of 33 places in 207 ms of which 2 ms to minimize.
[2024-06-01 07:32:52] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 2 ms to minimize.
[2024-06-01 07:32:52] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 2 ms to minimize.
[2024-06-01 07:32:53] [INFO ] Deduced a trap composed of 57 places in 208 ms of which 1 ms to minimize.
[2024-06-01 07:32:54] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:32:54] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 2 ms to minimize.
[2024-06-01 07:32:54] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 2 ms to minimize.
[2024-06-01 07:32:54] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 1 ms to minimize.
[2024-06-01 07:32:54] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 2 ms to minimize.
[2024-06-01 07:32:57] [INFO ] Deduced a trap composed of 38 places in 198 ms of which 1 ms to minimize.
[2024-06-01 07:32:57] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 2 ms to minimize.
[2024-06-01 07:32:58] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 2 ms to minimize.
[2024-06-01 07:32:58] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:32:58] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 351 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30031 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:33:33] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 2 ms to minimize.
[2024-06-01 07:33:33] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 2 ms to minimize.
SMT process timed out in 63811ms, After SMT, problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63825ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67204 ms. Remains : 296/296 places, 1531/1531 transitions.
Treatment of property SafeBus-PT-10-LTLCardinality-03 finished in 145473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 10 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 6 ms. Remains 297 /297 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-06-01 07:33:33] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 297 cols
[2024-06-01 07:33:33] [INFO ] Computed 36 invariants in 4 ms
[2024-06-01 07:33:34] [INFO ] Implicit Places using invariants in 956 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 959 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 9 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 984 ms. Remains : 296/297 places, 1631/1631 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SafeBus-PT-10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLCardinality-04 finished in 1090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 1631/1631 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 297 transition count 1622
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 288 transition count 1622
Applied a total of 18 rules in 111 ms. Remains 288 /297 variables (removed 9) and now considering 1622/1631 (removed 9) transitions.
[2024-06-01 07:33:34] [INFO ] Flow matrix only has 633 transitions (discarded 989 similar events)
// Phase 1: matrix 633 rows 288 cols
[2024-06-01 07:33:34] [INFO ] Computed 36 invariants in 10 ms
[2024-06-01 07:33:35] [INFO ] Implicit Places using invariants in 1080 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1087 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 287/297 places, 1622/1631 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 287 transition count 1621
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 286 transition count 1621
Applied a total of 2 rules in 127 ms. Remains 286 /287 variables (removed 1) and now considering 1621/1622 (removed 1) transitions.
[2024-06-01 07:33:36] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-06-01 07:33:36] [INFO ] Computed 35 invariants in 9 ms
[2024-06-01 07:33:37] [INFO ] Implicit Places using invariants in 915 ms returned []
[2024-06-01 07:33:37] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2024-06-01 07:33:37] [INFO ] Invariant cache hit.
[2024-06-01 07:33:37] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:33:39] [INFO ] Implicit Places using invariants and state equation in 2498 ms returned []
Implicit Place search using SMT with State Equation took 3416 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 286/297 places, 1621/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4744 ms. Remains : 286/297 places, 1621/1631 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 499 ms.
Stack based approach found an accepted trace after 617 steps with 0 reset with depth 618 and stack size 618 in 4 ms.
FORMULA SafeBus-PT-10-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-10-LTLCardinality-07 finished in 5303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0)&&G(!p1))))'
Support contains 4 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 6 ms. Remains 297 /297 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-06-01 07:33:40] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 297 cols
[2024-06-01 07:33:40] [INFO ] Computed 36 invariants in 6 ms
[2024-06-01 07:33:40] [INFO ] Implicit Places using invariants in 846 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 856 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 6 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 868 ms. Remains : 296/297 places, 1631/1631 transitions.
Stuttering acceptance computed with spot in 110 ms :[p1, (OR p1 p0), true, (OR p0 p1)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 1 ms.
FORMULA SafeBus-PT-10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLCardinality-11 finished in 1002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 2 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 7 ms. Remains 297 /297 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-06-01 07:33:41] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-06-01 07:33:41] [INFO ] Invariant cache hit.
[2024-06-01 07:33:42] [INFO ] Implicit Places using invariants in 930 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 932 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 7 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 947 ms. Remains : 296/297 places, 1631/1631 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-12
Product exploration explored 100000 steps with 522 reset in 458 ms.
Stack based approach found an accepted trace after 398 steps with 1 reset with depth 289 and stack size 289 in 3 ms.
FORMULA SafeBus-PT-10-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-10-LTLCardinality-12 finished in 1684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 2 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 7 ms. Remains 297 /297 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-06-01 07:33:42] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-06-01 07:33:42] [INFO ] Invariant cache hit.
[2024-06-01 07:33:43] [INFO ] Implicit Places using invariants in 1002 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1006 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 6 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1021 ms. Remains : 296/297 places, 1631/1631 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SafeBus-PT-10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLCardinality-13 finished in 1216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 6 ms. Remains 297 /297 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-06-01 07:33:43] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-06-01 07:33:43] [INFO ] Invariant cache hit.
[2024-06-01 07:33:45] [INFO ] Implicit Places using invariants in 1039 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1042 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 9 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1058 ms. Remains : 296/297 places, 1631/1631 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Product exploration explored 100000 steps with 50000 reset in 250 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-10-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-10-LTLCardinality-14 finished in 1697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (G(F(p1))||(!p1&&X(p1)))))'
Support contains 3 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 12 ms. Remains 297 /297 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-06-01 07:33:45] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-06-01 07:33:45] [INFO ] Invariant cache hit.
[2024-06-01 07:33:46] [INFO ] Implicit Places using invariants in 956 ms returned []
[2024-06-01 07:33:46] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-06-01 07:33:46] [INFO ] Invariant cache hit.
[2024-06-01 07:33:46] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:33:49] [INFO ] Implicit Places using invariants and state equation in 2408 ms returned []
Implicit Place search using SMT with State Equation took 3366 ms to find 0 implicit places.
Running 1621 sub problems to find dead transitions.
[2024-06-01 07:33:49] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-06-01 07:33:49] [INFO ] Invariant cache hit.
[2024-06-01 07:33:49] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 14/311 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 22/333 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-06-01 07:34:02] [INFO ] Deduced a trap composed of 47 places in 210 ms of which 2 ms to minimize.
[2024-06-01 07:34:02] [INFO ] Deduced a trap composed of 45 places in 203 ms of which 1 ms to minimize.
[2024-06-01 07:34:03] [INFO ] Deduced a trap composed of 43 places in 208 ms of which 2 ms to minimize.
[2024-06-01 07:34:11] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 2 ms to minimize.
[2024-06-01 07:34:12] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 6 ms to minimize.
[2024-06-01 07:34:12] [INFO ] Deduced a trap composed of 31 places in 231 ms of which 2 ms to minimize.
[2024-06-01 07:34:12] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 2 ms to minimize.
[2024-06-01 07:34:12] [INFO ] Deduced a trap composed of 54 places in 233 ms of which 2 ms to minimize.
[2024-06-01 07:34:13] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 3 ms to minimize.
[2024-06-01 07:34:13] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 2 ms to minimize.
[2024-06-01 07:34:13] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 2 ms to minimize.
[2024-06-01 07:34:13] [INFO ] Deduced a trap composed of 39 places in 230 ms of which 3 ms to minimize.
[2024-06-01 07:34:14] [INFO ] Deduced a trap composed of 41 places in 205 ms of which 2 ms to minimize.
[2024-06-01 07:34:15] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 2 ms to minimize.
[2024-06-01 07:34:15] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 1 ms to minimize.
[2024-06-01 07:34:15] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 2 ms to minimize.
[2024-06-01 07:34:18] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:34:18] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 2 ms to minimize.
[2024-06-01 07:34:18] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 1 ms to minimize.
[2024-06-01 07:34:19] [INFO ] Deduced a trap composed of 36 places in 226 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/353 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 297/939 variables, and 353 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30037 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/297 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1621/1621 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 14/311 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 22/333 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/353 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-06-01 07:34:25] [INFO ] Deduced a trap composed of 78 places in 225 ms of which 2 ms to minimize.
[2024-06-01 07:34:25] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 1 ms to minimize.
[2024-06-01 07:34:34] [INFO ] Deduced a trap composed of 57 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:34:34] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:34:34] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:34:35] [INFO ] Deduced a trap composed of 53 places in 191 ms of which 2 ms to minimize.
[2024-06-01 07:34:35] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:34:37] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 2 ms to minimize.
[2024-06-01 07:34:37] [INFO ] Deduced a trap composed of 61 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:34:37] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 2 ms to minimize.
[2024-06-01 07:34:38] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 2 ms to minimize.
[2024-06-01 07:34:38] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 1 ms to minimize.
[2024-06-01 07:34:38] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 2 ms to minimize.
[2024-06-01 07:34:38] [INFO ] Deduced a trap composed of 49 places in 209 ms of which 2 ms to minimize.
[2024-06-01 07:34:41] [INFO ] Deduced a trap composed of 46 places in 209 ms of which 1 ms to minimize.
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 2 ms to minimize.
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 2 ms to minimize.
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 2 ms to minimize.
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 20/373 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/939 variables, and 373 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30030 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/297 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1621 constraints, Known Traps: 40/40 constraints]
After SMT, in 64088ms problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 64104ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in LTL mode, iteration 1 : 297/297 places, 1531/1631 transitions.
Applied a total of 0 rules in 5 ms. Remains 297 /297 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67494 ms. Remains : 297/297 places, 1531/1631 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-15
Product exploration explored 100000 steps with 2620 reset in 418 ms.
Product exploration explored 100000 steps with 2627 reset in 431 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 168 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), false]
RANDOM walk for 201 steps (0 resets) in 9 ms. (20 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 276 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 240 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), false]
[2024-06-01 07:34:55] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 297 cols
[2024-06-01 07:34:55] [INFO ] Computed 36 invariants in 6 ms
[2024-06-01 07:34:56] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-06-01 07:34:58] [INFO ] [Real]Absence check using 14 positive and 22 generalized place invariants in 2190 ms returned sat
[2024-06-01 07:35:00] [INFO ] [Real]Absence check using state equation in 2035 ms returned sat
[2024-06-01 07:35:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:35:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-06-01 07:35:01] [INFO ] [Nat]Absence check using 14 positive and 22 generalized place invariants in 223 ms returned sat
[2024-06-01 07:35:01] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2024-06-01 07:35:01] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:35:01] [INFO ] [Nat]Added 111 Read/Feed constraints in 78 ms returned sat
[2024-06-01 07:35:01] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:35:01] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 3 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:35:04] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:35:04] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:35:04] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:35:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 18 trap constraints in 3891 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 9 factoid took 324 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-10-LTLCardinality-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-10-LTLCardinality-15 finished in 80177 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-01 07:35:06] [INFO ] Flatten gal took : 75 ms
[2024-06-01 07:35:06] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 07:35:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 297 places, 1631 transitions and 10934 arcs took 16 ms.
Total runtime 402961 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA SafeBus-PT-10-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717228044607

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name SafeBus-PT-10-LTLCardinality-00
ltl formula formula --ltl=/tmp/1566/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 297 places, 1631 transitions and 10934 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.060 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1566/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1566/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1566/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1566/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 298 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 298, there are 1637 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2393 levels ~10000 states ~33356 transitions
pnml2lts-mc( 3/ 4): ~4687 levels ~20000 states ~69932 transitions
pnml2lts-mc( 3/ 4): ~9008 levels ~40000 states ~140768 transitions
pnml2lts-mc( 3/ 4): ~17783 levels ~80000 states ~292764 transitions
pnml2lts-mc( 3/ 4): ~34804 levels ~160000 states ~608084 transitions
pnml2lts-mc( 3/ 4): ~68273 levels ~320000 states ~1264772 transitions
pnml2lts-mc( 3/ 4): ~133333 levels ~640000 states ~2615856 transitions
pnml2lts-mc( 3/ 4): ~260872 levels ~1280000 states ~5405532 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~257589!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1281464
pnml2lts-mc( 0/ 4): unique transitions count: 5839577
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 2014944
pnml2lts-mc( 0/ 4): - claim success count: 1281486
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1071949
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1281488 states 5839671 transitions, fanout: 4.557
pnml2lts-mc( 0/ 4): Total exploration time 28.260 sec (28.260 sec minimum, 28.260 sec on average)
pnml2lts-mc( 0/ 4): States per second: 45346, Transitions per second: 206641
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 67.6MB, 22.2 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 9.0%/67.0%
pnml2lts-mc( 0/ 4): Stored 1661 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 67.6MB (~256.0MB paged-in)
ltl formula name SafeBus-PT-10-LTLCardinality-03
ltl formula formula --ltl=/tmp/1566/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 297 places, 1631 transitions and 10934 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.060 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1566/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1566/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1566/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1566/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 299 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 298, there are 1634 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~27 levels ~10000 states ~12408 transitions
pnml2lts-mc( 2/ 4): ~26 levels ~20000 states ~25796 transitions
pnml2lts-mc( 3/ 4): ~27 levels ~40000 states ~53576 transitions
pnml2lts-mc( 3/ 4): ~27 levels ~80000 states ~112052 transitions
pnml2lts-mc( 1/ 4): ~27 levels ~160000 states ~224684 transitions
pnml2lts-mc( 0/ 4): ~27 levels ~320000 states ~466652 transitions
pnml2lts-mc( 0/ 4): ~27 levels ~640000 states ~948292 transitions
pnml2lts-mc( 0/ 4): ~27 levels ~1280000 states ~1936796 transitions
pnml2lts-mc( 0/ 4): ~27 levels ~2560000 states ~3950896 transitions
pnml2lts-mc( 0/ 4): ~27 levels ~5120000 states ~8124584 transitions
pnml2lts-mc( 0/ 4): ~27 levels ~10240000 states ~16491420 transitions
pnml2lts-mc( 0/ 4): ~27 levels ~20480000 states ~33987280 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33554123
pnml2lts-mc( 0/ 4): unique states count: 33554174
pnml2lts-mc( 0/ 4): unique transitions count: 57677558
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 24123172
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33554189
pnml2lts-mc( 0/ 4): - cum. max stack depth: 108
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33554189 states 57677689 transitions, fanout: 1.719
pnml2lts-mc( 0/ 4): Total exploration time 708.520 sec (708.500 sec minimum, 708.508 sec on average)
pnml2lts-mc( 0/ 4): States per second: 47358, Transitions per second: 81406
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 296.8MB, 9.3 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/63.0%
pnml2lts-mc( 0/ 4): Stored 1661 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 296.8MB (~256.0MB paged-in)

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="SafeBus-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is SafeBus-PT-10, 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 r524-tall-171679080300427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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