About the Execution of ITS-Tools for PolyORBNT-COL-S10J60
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16217.915 | 3600000.00 | 3532152.00 | 580319.20 | FTFFFFFTFF?FFTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r293-tall-167873945800699.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PolyORBNT-COL-S10J60, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945800699
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 00:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 00:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 01:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 01:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 00:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 94K Mar 5 18:23 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 PolyORBNT-COL-S10J60-LTLCardinality-00
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-01
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-02
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-03
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-04
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-05
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-06
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-07
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-08
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-09
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678943271019
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J60
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-16 05:07:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 05:07:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 05:07:52] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-16 05:07:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 05:07:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 718 ms
[2023-03-16 05:07:53] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 05:07:53] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-16 05:07:53] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10007 steps, including 574 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 31) seen :8
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :9
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 38 rows 48 cols
[2023-03-16 05:07:53] [INFO ] Computed 13 place invariants in 8 ms
[2023-03-16 05:07:54] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-16 05:07:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-16 05:07:54] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:1
[2023-03-16 05:07:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-16 05:07:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 05:07:54] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :1
[2023-03-16 05:07:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:07:54] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :7 sat :1
[2023-03-16 05:07:54] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-16 05:07:54] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :1
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 43 transition count 31
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 40 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 38 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 38 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 38 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 37 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 35 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 34 transition count 28
Applied a total of 27 rules in 18 ms. Remains 34 /48 variables (removed 14) and now considering 28/38 (removed 10) transitions.
// Phase 1: matrix 28 rows 34 cols
[2023-03-16 05:07:54] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-16 05:07:54] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 34/48 places, 28/38 transitions.
Incomplete random walk after 10006 steps, including 738 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10009 steps, including 296 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Probably explored full state space saw : 521 states, properties seen :0
Probabilistic random walk after 1393 steps, saw 521 distinct states, run finished after 16 ms. (steps per millisecond=87 ) properties seen :0
Explored full state space saw : 521 states, properties seen :0
Exhaustive walk after 1393 steps, saw 521 distinct states, run finished after 3 ms. (steps per millisecond=464 ) properties seen :0
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 05:07:54] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2023-03-16 05:07:54] [INFO ] Flatten gal took : 24 ms
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 05:07:54] [INFO ] Flatten gal took : 6 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-16 05:07:54] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 12980 transitions 116999 arcs in 171 ms.
[2023-03-16 05:07:54] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Deduced a syphon composed of 60 places in 24 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 328 out of 1234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1224 transition count 2810
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 1223 transition count 2809
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1223 transition count 2809
Applied a total of 12 rules in 203 ms. Remains 1223 /1234 variables (removed 11) and now considering 2809/2810 (removed 1) transitions.
[2023-03-16 05:07:54] [INFO ] Flow matrix only has 2800 transitions (discarded 9 similar events)
// Phase 1: matrix 2800 rows 1223 cols
[2023-03-16 05:07:55] [INFO ] Computed 142 place invariants in 218 ms
[2023-03-16 05:07:57] [INFO ] Dead Transitions using invariants and state equation in 2249 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2023-03-16 05:07:57] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2023-03-16 05:07:57] [INFO ] Computed 142 place invariants in 90 ms
[2023-03-16 05:07:58] [INFO ] Implicit Places using invariants in 893 ms returned []
[2023-03-16 05:07:58] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:07:58] [INFO ] Invariant cache hit.
[2023-03-16 05:07:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:08:06] [INFO ] Implicit Places using invariants and state equation in 8712 ms returned []
Implicit Place search using SMT with State Equation took 9609 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1223/1234 places, 2194/2810 transitions.
Applied a total of 0 rules in 29 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12106 ms. Remains : 1223/1234 places, 2194/2810 transitions.
Support contains 328 out of 1223 places after structural reductions.
[2023-03-16 05:08:07] [INFO ] Flatten gal took : 228 ms
[2023-03-16 05:08:07] [INFO ] Flatten gal took : 177 ms
[2023-03-16 05:08:07] [INFO ] Input system was already deterministic with 2194 transitions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 14) seen :5
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-16 05:08:08] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:08:08] [INFO ] Invariant cache hit.
[2023-03-16 05:08:08] [INFO ] After 327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-16 05:08:09] [INFO ] [Nat]Absence check using 136 positive place invariants in 41 ms returned sat
[2023-03-16 05:08:09] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 40 ms returned sat
[2023-03-16 05:08:11] [INFO ] After 2389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-16 05:08:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:08:14] [INFO ] After 2308ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-16 05:08:16] [INFO ] Deduced a trap composed of 19 places in 632 ms of which 2 ms to minimize.
[2023-03-16 05:08:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 799 ms
[2023-03-16 05:08:17] [INFO ] After 5113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1770 ms.
[2023-03-16 05:08:18] [INFO ] After 9966ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 28 ms.
Support contains 130 out of 1223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 1223 transition count 2132
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 125 place count 1161 transition count 2131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 126 place count 1160 transition count 2131
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 126 place count 1160 transition count 2067
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 254 place count 1096 transition count 2067
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 258 place count 1094 transition count 2065
Applied a total of 258 rules in 237 ms. Remains 1094 /1223 variables (removed 129) and now considering 2065/2194 (removed 129) transitions.
[2023-03-16 05:08:19] [INFO ] Flow matrix only has 2056 transitions (discarded 9 similar events)
// Phase 1: matrix 2056 rows 1094 cols
[2023-03-16 05:08:19] [INFO ] Computed 142 place invariants in 45 ms
[2023-03-16 05:08:20] [INFO ] Dead Transitions using invariants and state equation in 1222 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1463 ms. Remains : 1094/1223 places, 2065/2194 transitions.
Finished random walk after 7448 steps, including 553 resets, run visited all 9 properties in 129 ms. (steps per millisecond=57 )
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((G(p1) U (p0&&G(p1)))))))'
Support contains 134 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 28 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-16 05:08:20] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2023-03-16 05:08:20] [INFO ] Computed 142 place invariants in 68 ms
[2023-03-16 05:08:22] [INFO ] Dead Transitions using invariants and state equation in 1731 ms found 0 transitions.
[2023-03-16 05:08:22] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:08:22] [INFO ] Invariant cache hit.
[2023-03-16 05:08:23] [INFO ] Implicit Places using invariants in 935 ms returned []
[2023-03-16 05:08:23] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:08:23] [INFO ] Invariant cache hit.
[2023-03-16 05:08:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:08:32] [INFO ] Implicit Places using invariants and state equation in 8579 ms returned []
Implicit Place search using SMT with State Equation took 9516 ms to find 0 implicit places.
[2023-03-16 05:08:32] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:08:32] [INFO ] Invariant cache hit.
[2023-03-16 05:08:33] [INFO ] Dead Transitions using invariants and state equation in 1687 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12975 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT (ADD s384 s385 s386 s387 s388 s389 s390 s391 s392 s393) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLCardinality-00 finished in 13345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p1&&G(F(p2)))))))'
Support contains 65 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 31 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-16 05:08:34] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:08:34] [INFO ] Invariant cache hit.
[2023-03-16 05:08:35] [INFO ] Dead Transitions using invariants and state equation in 1675 ms found 0 transitions.
[2023-03-16 05:08:35] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:08:35] [INFO ] Invariant cache hit.
[2023-03-16 05:08:36] [INFO ] Implicit Places using invariants in 1067 ms returned []
[2023-03-16 05:08:36] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:08:36] [INFO ] Invariant cache hit.
[2023-03-16 05:08:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:08:45] [INFO ] Implicit Places using invariants and state equation in 8753 ms returned []
Implicit Place search using SMT with State Equation took 9823 ms to find 0 implicit places.
[2023-03-16 05:08:45] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:08:45] [INFO ] Invariant cache hit.
[2023-03-16 05:08:47] [INFO ] Dead Transitions using invariants and state equation in 1573 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13116 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(LEQ s378 s1092), p2:(LEQ 2 s380), p1:(LEQ s1090 (ADD s315 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 s327 s328 s329 s330 s331 s332 s333 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17338 steps with 970 reset in 225 ms.
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLCardinality-02 finished in 13591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 61 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 30 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-16 05:08:47] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:08:47] [INFO ] Invariant cache hit.
[2023-03-16 05:08:49] [INFO ] Dead Transitions using invariants and state equation in 1631 ms found 0 transitions.
[2023-03-16 05:08:49] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:08:49] [INFO ] Invariant cache hit.
[2023-03-16 05:08:50] [INFO ] Implicit Places using invariants in 1010 ms returned []
[2023-03-16 05:08:50] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:08:50] [INFO ] Invariant cache hit.
[2023-03-16 05:08:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:08:57] [INFO ] Implicit Places using invariants and state equation in 7226 ms returned []
Implicit Place search using SMT with State Equation took 8239 ms to find 0 implicit places.
[2023-03-16 05:08:57] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:08:57] [INFO ] Invariant cache hit.
[2023-03-16 05:08:59] [INFO ] Dead Transitions using invariants and state equation in 1621 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11531 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLCardinality-08 finished in 11648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F((G(F(p1))||(F(p1)&&X(p2))))))))'
Support contains 65 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 30 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-16 05:08:59] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:08:59] [INFO ] Invariant cache hit.
[2023-03-16 05:09:00] [INFO ] Dead Transitions using invariants and state equation in 1565 ms found 0 transitions.
[2023-03-16 05:09:00] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:09:00] [INFO ] Invariant cache hit.
[2023-03-16 05:09:01] [INFO ] Implicit Places using invariants in 890 ms returned []
[2023-03-16 05:09:01] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:09:01] [INFO ] Invariant cache hit.
[2023-03-16 05:09:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:09:07] [INFO ] Implicit Places using invariants and state equation in 5699 ms returned []
Implicit Place search using SMT with State Equation took 6594 ms to find 0 implicit places.
[2023-03-16 05:09:07] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:09:07] [INFO ] Invariant cache hit.
[2023-03-16 05:09:09] [INFO ] Dead Transitions using invariants and state equation in 1594 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9793 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s313 (ADD s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25069 reset in 1198 ms.
Product exploration explored 100000 steps with 25028 reset in 1136 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 p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 394 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 557 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 05:09:12] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:09:12] [INFO ] Invariant cache hit.
[2023-03-16 05:09:12] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 05:09:12] [INFO ] [Nat]Absence check using 136 positive place invariants in 37 ms returned sat
[2023-03-16 05:09:12] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 33 ms returned sat
[2023-03-16 05:09:14] [INFO ] After 1176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 05:09:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:09:15] [INFO ] After 991ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 05:09:15] [INFO ] Deduced a trap composed of 327 places in 566 ms of which 3 ms to minimize.
[2023-03-16 05:09:16] [INFO ] Deduced a trap composed of 337 places in 532 ms of which 2 ms to minimize.
[2023-03-16 05:09:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1330 ms
[2023-03-16 05:09:17] [INFO ] After 2853ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 704 ms.
[2023-03-16 05:09:17] [INFO ] After 5012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 65 out of 1223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 1223 transition count 2131
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 1160 transition count 2131
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 126 place count 1160 transition count 2066
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 256 place count 1095 transition count 2066
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 260 place count 1093 transition count 2064
Applied a total of 260 rules in 119 ms. Remains 1093 /1223 variables (removed 130) and now considering 2064/2194 (removed 130) transitions.
[2023-03-16 05:09:17] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2023-03-16 05:09:17] [INFO ] Computed 142 place invariants in 58 ms
[2023-03-16 05:09:19] [INFO ] Dead Transitions using invariants and state equation in 1132 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1253 ms. Remains : 1093/1223 places, 2064/2194 transitions.
Incomplete random walk after 10000 steps, including 734 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 273645 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 273645 steps, saw 45141 distinct states, run finished after 3002 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 05:09:22] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:09:22] [INFO ] Invariant cache hit.
[2023-03-16 05:09:22] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 05:09:22] [INFO ] [Nat]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-16 05:09:22] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-16 05:09:23] [INFO ] After 1166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 05:09:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:09:24] [INFO ] After 708ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 05:09:25] [INFO ] Deduced a trap composed of 192 places in 388 ms of which 1 ms to minimize.
[2023-03-16 05:09:25] [INFO ] Deduced a trap composed of 201 places in 382 ms of which 2 ms to minimize.
[2023-03-16 05:09:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 980 ms
[2023-03-16 05:09:26] [INFO ] After 2363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 465 ms.
[2023-03-16 05:09:26] [INFO ] After 4223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 65 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 44 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 43 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-16 05:09:26] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:09:26] [INFO ] Invariant cache hit.
[2023-03-16 05:09:27] [INFO ] Implicit Places using invariants in 777 ms returned []
[2023-03-16 05:09:27] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:09:27] [INFO ] Invariant cache hit.
[2023-03-16 05:09:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:09:32] [INFO ] Implicit Places using invariants and state equation in 5226 ms returned []
Implicit Place search using SMT with State Equation took 6009 ms to find 0 implicit places.
[2023-03-16 05:09:32] [INFO ] Redundant transitions in 101 ms returned []
[2023-03-16 05:09:32] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:09:32] [INFO ] Invariant cache hit.
[2023-03-16 05:09:33] [INFO ] Dead Transitions using invariants and state equation in 1041 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7205 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1093 transition count 2055
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 1093 transition count 2054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 1092 transition count 2054
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 21 place count 1092 transition count 2044
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 31 place count 1082 transition count 2044
Applied a total of 31 rules in 163 ms. Remains 1082 /1093 variables (removed 11) and now considering 2044/2064 (removed 20) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2044 rows 1082 cols
[2023-03-16 05:09:34] [INFO ] Computed 142 place invariants in 35 ms
[2023-03-16 05:09:34] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 05:09:34] [INFO ] [Nat]Absence check using 135 positive place invariants in 30 ms returned sat
[2023-03-16 05:09:34] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-16 05:09:35] [INFO ] After 1001ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 05:09:36] [INFO ] Deduced a trap composed of 218 places in 352 ms of which 1 ms to minimize.
[2023-03-16 05:09:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 520 ms
[2023-03-16 05:09:37] [INFO ] After 2435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 454 ms.
[2023-03-16 05:09:37] [INFO ] After 3127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (NOT p1)), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 428 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Support contains 65 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 28 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-16 05:09:38] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2023-03-16 05:09:38] [INFO ] Computed 142 place invariants in 41 ms
[2023-03-16 05:09:39] [INFO ] Dead Transitions using invariants and state equation in 1589 ms found 0 transitions.
[2023-03-16 05:09:39] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:09:39] [INFO ] Invariant cache hit.
[2023-03-16 05:09:40] [INFO ] Implicit Places using invariants in 854 ms returned []
[2023-03-16 05:09:40] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:09:40] [INFO ] Invariant cache hit.
[2023-03-16 05:09:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:09:48] [INFO ] Implicit Places using invariants and state equation in 7295 ms returned []
Implicit Place search using SMT with State Equation took 8157 ms to find 0 implicit places.
[2023-03-16 05:09:48] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:09:48] [INFO ] Invariant cache hit.
[2023-03-16 05:09:49] [INFO ] Dead Transitions using invariants and state equation in 1528 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11306 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 542 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 560 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 172088 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{1=1}
Probabilistic random walk after 172088 steps, saw 51801 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :1
Running SMT prover for 4 properties.
[2023-03-16 05:09:53] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:09:53] [INFO ] Invariant cache hit.
[2023-03-16 05:09:54] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 05:09:54] [INFO ] [Nat]Absence check using 136 positive place invariants in 39 ms returned sat
[2023-03-16 05:09:54] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 24 ms returned sat
[2023-03-16 05:09:56] [INFO ] After 1833ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 05:09:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:09:59] [INFO ] After 3087ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-16 05:10:00] [INFO ] Deduced a trap composed of 319 places in 567 ms of which 1 ms to minimize.
[2023-03-16 05:10:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 748 ms
[2023-03-16 05:10:06] [INFO ] After 9769ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3722 ms.
[2023-03-16 05:10:09] [INFO ] After 15699ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 65 out of 1223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 1223 transition count 2131
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 1160 transition count 2131
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 126 place count 1160 transition count 2066
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 256 place count 1095 transition count 2066
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 260 place count 1093 transition count 2064
Applied a total of 260 rules in 96 ms. Remains 1093 /1223 variables (removed 130) and now considering 2064/2194 (removed 130) transitions.
[2023-03-16 05:10:09] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2023-03-16 05:10:09] [INFO ] Computed 142 place invariants in 41 ms
[2023-03-16 05:10:11] [INFO ] Dead Transitions using invariants and state equation in 1079 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1176 ms. Remains : 1093/1223 places, 2064/2194 transitions.
Incomplete random walk after 10000 steps, including 735 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 05:10:11] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:10:11] [INFO ] Invariant cache hit.
[2023-03-16 05:10:11] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 05:10:11] [INFO ] [Nat]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-16 05:10:11] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-16 05:10:12] [INFO ] After 1142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 05:10:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:10:13] [INFO ] After 711ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 05:10:14] [INFO ] Deduced a trap composed of 192 places in 425 ms of which 1 ms to minimize.
[2023-03-16 05:10:14] [INFO ] Deduced a trap composed of 201 places in 372 ms of which 1 ms to minimize.
[2023-03-16 05:10:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1013 ms
[2023-03-16 05:10:15] [INFO ] After 2380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 472 ms.
[2023-03-16 05:10:15] [INFO ] After 4241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 65 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 56 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Incomplete random walk after 10000 steps, including 729 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 286335 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 286335 steps, saw 47081 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 05:10:19] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:10:19] [INFO ] Invariant cache hit.
[2023-03-16 05:10:19] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 05:10:19] [INFO ] [Nat]Absence check using 135 positive place invariants in 28 ms returned sat
[2023-03-16 05:10:19] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-16 05:10:20] [INFO ] After 1167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 05:10:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:10:21] [INFO ] After 714ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 05:10:21] [INFO ] Deduced a trap composed of 192 places in 382 ms of which 1 ms to minimize.
[2023-03-16 05:10:22] [INFO ] Deduced a trap composed of 201 places in 386 ms of which 0 ms to minimize.
[2023-03-16 05:10:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 974 ms
[2023-03-16 05:10:23] [INFO ] After 2350ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 472 ms.
[2023-03-16 05:10:23] [INFO ] After 4223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 65 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 38 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 41 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-16 05:10:23] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:10:23] [INFO ] Invariant cache hit.
[2023-03-16 05:10:24] [INFO ] Implicit Places using invariants in 778 ms returned []
[2023-03-16 05:10:24] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:10:24] [INFO ] Invariant cache hit.
[2023-03-16 05:10:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:10:31] [INFO ] Implicit Places using invariants and state equation in 7367 ms returned []
Implicit Place search using SMT with State Equation took 8150 ms to find 0 implicit places.
[2023-03-16 05:10:31] [INFO ] Redundant transitions in 97 ms returned []
[2023-03-16 05:10:31] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:10:31] [INFO ] Invariant cache hit.
[2023-03-16 05:10:32] [INFO ] Dead Transitions using invariants and state equation in 999 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9300 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1093 transition count 2055
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 1093 transition count 2054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 1092 transition count 2054
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 21 place count 1092 transition count 2044
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 31 place count 1082 transition count 2044
Applied a total of 31 rules in 152 ms. Remains 1082 /1093 variables (removed 11) and now considering 2044/2064 (removed 20) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2044 rows 1082 cols
[2023-03-16 05:10:33] [INFO ] Computed 142 place invariants in 42 ms
[2023-03-16 05:10:33] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 05:10:33] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-16 05:10:33] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-16 05:10:34] [INFO ] After 1004ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 05:10:35] [INFO ] Deduced a trap composed of 218 places in 319 ms of which 1 ms to minimize.
[2023-03-16 05:10:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 481 ms
[2023-03-16 05:10:35] [INFO ] After 2388ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 442 ms.
[2023-03-16 05:10:36] [INFO ] After 3059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (NOT p1)), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 515 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Product exploration explored 100000 steps with 33346 reset in 1111 ms.
Product exploration explored 100000 steps with 33352 reset in 1144 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Support contains 65 out of 1223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 1223 transition count 2194
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 63 place count 1223 transition count 2195
Deduced a syphon composed of 65 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 1223 transition count 2195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1222 transition count 2194
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1222 transition count 2194
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 129 places in 1 ms
Iterating global reduction 1 with 65 rules applied. Total rules applied 132 place count 1222 transition count 2194
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 193 place count 1161 transition count 2133
Deduced a syphon composed of 68 places in 1 ms
Iterating global reduction 1 with 61 rules applied. Total rules applied 254 place count 1161 transition count 2133
Deduced a syphon composed of 68 places in 1 ms
Applied a total of 254 rules in 359 ms. Remains 1161 /1223 variables (removed 62) and now considering 2133/2194 (removed 61) transitions.
[2023-03-16 05:10:40] [INFO ] Flow matrix only has 2124 transitions (discarded 9 similar events)
// Phase 1: matrix 2124 rows 1161 cols
[2023-03-16 05:10:40] [INFO ] Computed 142 place invariants in 32 ms
[2023-03-16 05:10:42] [INFO ] Dead Transitions using invariants and state equation in 2323 ms found 0 transitions.
[2023-03-16 05:10:42] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-16 05:10:42] [INFO ] Flow matrix only has 2124 transitions (discarded 9 similar events)
[2023-03-16 05:10:42] [INFO ] Invariant cache hit.
[2023-03-16 05:10:44] [INFO ] Dead Transitions using invariants and state equation in 2284 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1161/1223 places, 2133/2194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5017 ms. Remains : 1161/1223 places, 2133/2194 transitions.
Built C files in :
/tmp/ltsmin2039451371762387393
[2023-03-16 05:10:44] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2039451371762387393
Running compilation step : cd /tmp/ltsmin2039451371762387393;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2039451371762387393;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2039451371762387393;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 65 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 31 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-16 05:10:47] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2023-03-16 05:10:48] [INFO ] Computed 142 place invariants in 38 ms
[2023-03-16 05:10:49] [INFO ] Dead Transitions using invariants and state equation in 1591 ms found 0 transitions.
[2023-03-16 05:10:49] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:10:49] [INFO ] Invariant cache hit.
[2023-03-16 05:10:50] [INFO ] Implicit Places using invariants in 877 ms returned []
[2023-03-16 05:10:50] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:10:50] [INFO ] Invariant cache hit.
[2023-03-16 05:10:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:10:57] [INFO ] Implicit Places using invariants and state equation in 6747 ms returned []
Implicit Place search using SMT with State Equation took 7626 ms to find 0 implicit places.
[2023-03-16 05:10:57] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:10:57] [INFO ] Invariant cache hit.
[2023-03-16 05:10:58] [INFO ] Dead Transitions using invariants and state equation in 1519 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10772 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Built C files in :
/tmp/ltsmin3932325017017512097
[2023-03-16 05:10:58] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3932325017017512097
Running compilation step : cd /tmp/ltsmin3932325017017512097;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3932325017017512097;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3932325017017512097;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 05:11:02] [INFO ] Flatten gal took : 122 ms
[2023-03-16 05:11:02] [INFO ] Flatten gal took : 117 ms
[2023-03-16 05:11:02] [INFO ] Time to serialize gal into /tmp/LTL3256609183820573207.gal : 21 ms
[2023-03-16 05:11:02] [INFO ] Time to serialize properties into /tmp/LTL757547914485267339.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3256609183820573207.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8487736239693700168.hoa' '-atoms' '/tmp/LTL757547914485267339.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL757547914485267339.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8487736239693700168.hoa
Detected timeout of ITS tools.
[2023-03-16 05:11:17] [INFO ] Flatten gal took : 139 ms
[2023-03-16 05:11:17] [INFO ] Flatten gal took : 124 ms
[2023-03-16 05:11:17] [INFO ] Time to serialize gal into /tmp/LTL12282814503550921758.gal : 31 ms
[2023-03-16 05:11:17] [INFO ] Time to serialize properties into /tmp/LTL12914945044233874334.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12282814503550921758.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12914945044233874334.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("(mi1_0<=((((((f2_0+f2_1)+(f2_2+f2_3))+((f2_4+f2_5)+(f2_6+f2_7)))+(((f2_8+f2_9)+(f2_10+f2_11))+((f2_12+f2_13)+(f2_14+f2_15))))...653
Formula 0 simplified : XF(!"(mi1_0<=((((((f2_0+f2_1)+(f2_2+f2_3))+((f2_4+f2_5)+(f2_6+f2_7)))+(((f2_8+f2_9)+(f2_10+f2_11))+((f2_12+f2_13)+(f2_14+f2_15))))+(...637
Detected timeout of ITS tools.
[2023-03-16 05:11:32] [INFO ] Flatten gal took : 90 ms
[2023-03-16 05:11:32] [INFO ] Applying decomposition
[2023-03-16 05:11:32] [INFO ] Flatten gal took : 91 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17137440093514856647.txt' '-o' '/tmp/graph17137440093514856647.bin' '-w' '/tmp/graph17137440093514856647.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17137440093514856647.bin' '-l' '-1' '-v' '-w' '/tmp/graph17137440093514856647.weights' '-q' '0' '-e' '0.001'
[2023-03-16 05:11:33] [INFO ] Decomposing Gal with order
[2023-03-16 05:11:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 05:11:33] [INFO ] Removed a total of 2283 redundant transitions.
[2023-03-16 05:11:33] [INFO ] Flatten gal took : 429 ms
[2023-03-16 05:11:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 508 labels/synchronizations in 70 ms.
[2023-03-16 05:11:34] [INFO ] Time to serialize gal into /tmp/LTL15036169771331999072.gal : 26 ms
[2023-03-16 05:11:34] [INFO ] Time to serialize properties into /tmp/LTL15645132538171969671.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15036169771331999072.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15645132538171969671.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("(gu34.mi1_0<=((((((gu34.f2_0+gu34.f2_1)+(gu34.f2_2+gu34.f2_3))+((gu34.f2_4+gu34.f2_5)+(gu34.f2_6+gu34.f2_7)))+(((gu34.f2_8+gu...1035
Formula 0 simplified : XF(!"(gu34.mi1_0<=((((((gu34.f2_0+gu34.f2_1)+(gu34.f2_2+gu34.f2_3))+((gu34.f2_4+gu34.f2_5)+(gu34.f2_6+gu34.f2_7)))+(((gu34.f2_8+gu34...1019
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10287472819288066162
[2023-03-16 05:11:49] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10287472819288066162
Running compilation step : cd /tmp/ltsmin10287472819288066162;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10287472819288066162;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10287472819288066162;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property PolyORBNT-COL-S10J60-LTLCardinality-10 finished in 173209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1))))'
Support contains 3 out of 1223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 1223 transition count 2131
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 127 place count 1160 transition count 2130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 1159 transition count 2130
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 128 place count 1159 transition count 2066
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 256 place count 1095 transition count 2066
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 260 place count 1093 transition count 2064
Applied a total of 260 rules in 108 ms. Remains 1093 /1223 variables (removed 130) and now considering 2064/2194 (removed 130) transitions.
[2023-03-16 05:11:52] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2023-03-16 05:11:52] [INFO ] Computed 142 place invariants in 33 ms
[2023-03-16 05:11:53] [INFO ] Dead Transitions using invariants and state equation in 1237 ms found 0 transitions.
[2023-03-16 05:11:53] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:11:53] [INFO ] Invariant cache hit.
[2023-03-16 05:11:54] [INFO ] Implicit Places using invariants in 815 ms returned []
[2023-03-16 05:11:54] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:11:54] [INFO ] Invariant cache hit.
[2023-03-16 05:11:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:11:59] [INFO ] Implicit Places using invariants and state equation in 5021 ms returned []
Implicit Place search using SMT with State Equation took 5839 ms to find 0 implicit places.
[2023-03-16 05:11:59] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-16 05:11:59] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:11:59] [INFO ] Invariant cache hit.
[2023-03-16 05:12:00] [INFO ] Dead Transitions using invariants and state equation in 1047 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1093/1223 places, 2064/2194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8277 ms. Remains : 1093/1223 places, 2064/2194 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ 1 s314), p0:(LEQ s313 s376)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLCardinality-14 finished in 8353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)||p0))))'
Support contains 3 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 30 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-16 05:12:00] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2023-03-16 05:12:00] [INFO ] Computed 142 place invariants in 39 ms
[2023-03-16 05:12:02] [INFO ] Dead Transitions using invariants and state equation in 1609 ms found 0 transitions.
[2023-03-16 05:12:02] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:12:02] [INFO ] Invariant cache hit.
[2023-03-16 05:12:03] [INFO ] Implicit Places using invariants in 956 ms returned []
[2023-03-16 05:12:03] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:12:03] [INFO ] Invariant cache hit.
[2023-03-16 05:12:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:12:10] [INFO ] Implicit Places using invariants and state equation in 7121 ms returned []
Implicit Place search using SMT with State Equation took 8078 ms to find 0 implicit places.
[2023-03-16 05:12:10] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-16 05:12:10] [INFO ] Invariant cache hit.
[2023-03-16 05:12:12] [INFO ] Dead Transitions using invariants and state equation in 1518 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11236 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GT 1 s394) (LEQ 2 s383)), p1:(GT 2 s379)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1042 ms.
Product exploration explored 100000 steps with 33333 reset in 1066 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 p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J60-LTLCardinality-15 finished in 13558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F((G(F(p1))||(F(p1)&&X(p2))))))))'
Found a Lengthening insensitive property : PolyORBNT-COL-S10J60-LTLCardinality-10
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Support contains 65 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 1223 transition count 2131
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 1160 transition count 2131
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 126 place count 1160 transition count 2066
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 256 place count 1095 transition count 2066
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 260 place count 1093 transition count 2064
Applied a total of 260 rules in 96 ms. Remains 1093 /1223 variables (removed 130) and now considering 2064/2194 (removed 130) transitions.
[2023-03-16 05:12:14] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2023-03-16 05:12:14] [INFO ] Computed 142 place invariants in 32 ms
[2023-03-16 05:12:15] [INFO ] Dead Transitions using invariants and state equation in 1205 ms found 0 transitions.
[2023-03-16 05:12:15] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:12:15] [INFO ] Invariant cache hit.
[2023-03-16 05:12:16] [INFO ] Implicit Places using invariants in 774 ms returned []
[2023-03-16 05:12:16] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:12:16] [INFO ] Invariant cache hit.
[2023-03-16 05:12:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:12:23] [INFO ] Implicit Places using invariants and state equation in 7000 ms returned []
Implicit Place search using SMT with State Equation took 7776 ms to find 0 implicit places.
[2023-03-16 05:12:23] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:12:23] [INFO ] Invariant cache hit.
[2023-03-16 05:12:24] [INFO ] Dead Transitions using invariants and state equation in 1039 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1093/1223 places, 2064/2194 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10118 ms. Remains : 1093/1223 places, 2064/2194 transitions.
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s313 (ADD s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1120 ms.
Product exploration explored 100000 steps with 25000 reset in 1137 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 p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 387 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 725 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 05:12:27] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:12:27] [INFO ] Invariant cache hit.
[2023-03-16 05:12:28] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 05:12:28] [INFO ] [Nat]Absence check using 135 positive place invariants in 29 ms returned sat
[2023-03-16 05:12:28] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 35 ms returned sat
[2023-03-16 05:12:29] [INFO ] After 1168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 05:12:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:12:30] [INFO ] After 712ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 05:12:30] [INFO ] Deduced a trap composed of 192 places in 394 ms of which 1 ms to minimize.
[2023-03-16 05:12:31] [INFO ] Deduced a trap composed of 201 places in 385 ms of which 1 ms to minimize.
[2023-03-16 05:12:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 993 ms
[2023-03-16 05:12:31] [INFO ] After 2368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 477 ms.
[2023-03-16 05:12:32] [INFO ] After 4259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 65 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 39 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-16 05:12:32] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:12:32] [INFO ] Invariant cache hit.
[2023-03-16 05:12:33] [INFO ] Dead Transitions using invariants and state equation in 1055 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1095 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Incomplete random walk after 10000 steps, including 741 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 276684 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 276684 steps, saw 45655 distinct states, run finished after 3002 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 05:12:36] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:12:36] [INFO ] Invariant cache hit.
[2023-03-16 05:12:36] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 05:12:37] [INFO ] [Nat]Absence check using 135 positive place invariants in 30 ms returned sat
[2023-03-16 05:12:37] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 40 ms returned sat
[2023-03-16 05:12:38] [INFO ] After 1167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 05:12:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:12:38] [INFO ] After 710ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 05:12:39] [INFO ] Deduced a trap composed of 192 places in 385 ms of which 1 ms to minimize.
[2023-03-16 05:12:39] [INFO ] Deduced a trap composed of 201 places in 386 ms of which 0 ms to minimize.
[2023-03-16 05:12:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 990 ms
[2023-03-16 05:12:40] [INFO ] After 2365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 478 ms.
[2023-03-16 05:12:41] [INFO ] After 4257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 65 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 40 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 41 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-16 05:12:41] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:12:41] [INFO ] Invariant cache hit.
[2023-03-16 05:12:41] [INFO ] Implicit Places using invariants in 772 ms returned []
[2023-03-16 05:12:41] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:12:41] [INFO ] Invariant cache hit.
[2023-03-16 05:12:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:12:48] [INFO ] Implicit Places using invariants and state equation in 6422 ms returned []
Implicit Place search using SMT with State Equation took 7197 ms to find 0 implicit places.
[2023-03-16 05:12:48] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-16 05:12:48] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:12:48] [INFO ] Invariant cache hit.
[2023-03-16 05:12:49] [INFO ] Dead Transitions using invariants and state equation in 1043 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8326 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1093 transition count 2055
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 1093 transition count 2054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 1092 transition count 2054
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 21 place count 1092 transition count 2044
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 31 place count 1082 transition count 2044
Applied a total of 31 rules in 139 ms. Remains 1082 /1093 variables (removed 11) and now considering 2044/2064 (removed 20) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2044 rows 1082 cols
[2023-03-16 05:12:49] [INFO ] Computed 142 place invariants in 39 ms
[2023-03-16 05:12:49] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 05:12:49] [INFO ] [Nat]Absence check using 135 positive place invariants in 30 ms returned sat
[2023-03-16 05:12:49] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-16 05:12:51] [INFO ] After 1007ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 05:12:51] [INFO ] Deduced a trap composed of 218 places in 324 ms of which 1 ms to minimize.
[2023-03-16 05:12:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 494 ms
[2023-03-16 05:12:52] [INFO ] After 2396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 443 ms.
[2023-03-16 05:12:52] [INFO ] After 3064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (NOT p1)), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 443 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Support contains 65 out of 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 22 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-16 05:12:53] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2023-03-16 05:12:53] [INFO ] Computed 142 place invariants in 40 ms
[2023-03-16 05:12:54] [INFO ] Dead Transitions using invariants and state equation in 1078 ms found 0 transitions.
[2023-03-16 05:12:54] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:12:54] [INFO ] Invariant cache hit.
[2023-03-16 05:12:55] [INFO ] Implicit Places using invariants in 771 ms returned []
[2023-03-16 05:12:55] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:12:55] [INFO ] Invariant cache hit.
[2023-03-16 05:12:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:13:01] [INFO ] Implicit Places using invariants and state equation in 6375 ms returned []
Implicit Place search using SMT with State Equation took 7148 ms to find 0 implicit places.
[2023-03-16 05:13:01] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:13:01] [INFO ] Invariant cache hit.
[2023-03-16 05:13:02] [INFO ] Dead Transitions using invariants and state equation in 1022 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9272 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 469 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 733 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 05:13:03] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:13:03] [INFO ] Invariant cache hit.
[2023-03-16 05:13:04] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 05:13:04] [INFO ] [Nat]Absence check using 135 positive place invariants in 29 ms returned sat
[2023-03-16 05:13:04] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-16 05:13:05] [INFO ] After 1152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 05:13:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:13:06] [INFO ] After 702ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 05:13:06] [INFO ] Deduced a trap composed of 192 places in 387 ms of which 1 ms to minimize.
[2023-03-16 05:13:07] [INFO ] Deduced a trap composed of 201 places in 377 ms of which 1 ms to minimize.
[2023-03-16 05:13:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 971 ms
[2023-03-16 05:13:07] [INFO ] After 2323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 474 ms.
[2023-03-16 05:13:08] [INFO ] After 4175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 65 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 37 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-16 05:13:08] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:13:08] [INFO ] Invariant cache hit.
[2023-03-16 05:13:09] [INFO ] Dead Transitions using invariants and state equation in 1017 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1056 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Incomplete random walk after 10000 steps, including 747 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 290726 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 290726 steps, saw 47780 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 05:13:12] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:13:12] [INFO ] Invariant cache hit.
[2023-03-16 05:13:12] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 05:13:12] [INFO ] [Nat]Absence check using 135 positive place invariants in 28 ms returned sat
[2023-03-16 05:13:12] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-16 05:13:14] [INFO ] After 1137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 05:13:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:13:14] [INFO ] After 711ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 05:13:15] [INFO ] Deduced a trap composed of 192 places in 394 ms of which 1 ms to minimize.
[2023-03-16 05:13:15] [INFO ] Deduced a trap composed of 201 places in 393 ms of which 5 ms to minimize.
[2023-03-16 05:13:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 993 ms
[2023-03-16 05:13:16] [INFO ] After 2365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 475 ms.
[2023-03-16 05:13:16] [INFO ] After 4202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 65 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 38 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 40 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-16 05:13:16] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:13:16] [INFO ] Invariant cache hit.
[2023-03-16 05:13:17] [INFO ] Implicit Places using invariants in 775 ms returned []
[2023-03-16 05:13:17] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:13:17] [INFO ] Invariant cache hit.
[2023-03-16 05:13:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:13:22] [INFO ] Implicit Places using invariants and state equation in 5245 ms returned []
Implicit Place search using SMT with State Equation took 6022 ms to find 0 implicit places.
[2023-03-16 05:13:23] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-16 05:13:23] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:13:23] [INFO ] Invariant cache hit.
[2023-03-16 05:13:24] [INFO ] Dead Transitions using invariants and state equation in 1035 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7154 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1093 transition count 2055
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 1093 transition count 2054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 1092 transition count 2054
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 21 place count 1092 transition count 2044
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 31 place count 1082 transition count 2044
Applied a total of 31 rules in 126 ms. Remains 1082 /1093 variables (removed 11) and now considering 2044/2064 (removed 20) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2044 rows 1082 cols
[2023-03-16 05:13:24] [INFO ] Computed 142 place invariants in 38 ms
[2023-03-16 05:13:24] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 05:13:24] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-16 05:13:24] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-16 05:13:25] [INFO ] After 994ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 05:13:26] [INFO ] Deduced a trap composed of 218 places in 321 ms of which 1 ms to minimize.
[2023-03-16 05:13:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 481 ms
[2023-03-16 05:13:26] [INFO ] After 2362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 442 ms.
[2023-03-16 05:13:27] [INFO ] After 3023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (NOT p1)), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 530 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 533 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Product exploration explored 100000 steps with 33315 reset in 1085 ms.
Product exploration explored 100000 steps with 33386 reset in 1131 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Support contains 65 out of 1093 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 40 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-16 05:13:31] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2023-03-16 05:13:31] [INFO ] Computed 142 place invariants in 42 ms
[2023-03-16 05:13:32] [INFO ] Dead Transitions using invariants and state equation in 1091 ms found 0 transitions.
[2023-03-16 05:13:32] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-16 05:13:32] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:13:32] [INFO ] Invariant cache hit.
[2023-03-16 05:13:33] [INFO ] Dead Transitions using invariants and state equation in 1030 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2198 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Built C files in :
/tmp/ltsmin15519524792165731627
[2023-03-16 05:13:33] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15519524792165731627
Running compilation step : cd /tmp/ltsmin15519524792165731627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15519524792165731627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15519524792165731627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 65 out of 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 25 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-16 05:13:36] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:13:36] [INFO ] Invariant cache hit.
[2023-03-16 05:13:37] [INFO ] Dead Transitions using invariants and state equation in 1031 ms found 0 transitions.
[2023-03-16 05:13:37] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:13:37] [INFO ] Invariant cache hit.
[2023-03-16 05:13:38] [INFO ] Implicit Places using invariants in 753 ms returned []
[2023-03-16 05:13:38] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:13:38] [INFO ] Invariant cache hit.
[2023-03-16 05:13:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:13:45] [INFO ] Implicit Places using invariants and state equation in 6956 ms returned []
Implicit Place search using SMT with State Equation took 7711 ms to find 0 implicit places.
[2023-03-16 05:13:45] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-16 05:13:45] [INFO ] Invariant cache hit.
[2023-03-16 05:13:46] [INFO ] Dead Transitions using invariants and state equation in 1027 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9796 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Built C files in :
/tmp/ltsmin6408386456341531682
[2023-03-16 05:13:46] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6408386456341531682
Running compilation step : cd /tmp/ltsmin6408386456341531682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6408386456341531682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6408386456341531682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 05:13:49] [INFO ] Flatten gal took : 134 ms
[2023-03-16 05:13:49] [INFO ] Flatten gal took : 119 ms
[2023-03-16 05:13:49] [INFO ] Time to serialize gal into /tmp/LTL13526579039159835633.gal : 13 ms
[2023-03-16 05:13:49] [INFO ] Time to serialize properties into /tmp/LTL12673004556182424517.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13526579039159835633.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1815238953634225706.hoa' '-atoms' '/tmp/LTL12673004556182424517.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12673004556182424517.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1815238953634225706.hoa
Detected timeout of ITS tools.
[2023-03-16 05:14:04] [INFO ] Flatten gal took : 84 ms
[2023-03-16 05:14:04] [INFO ] Flatten gal took : 85 ms
[2023-03-16 05:14:04] [INFO ] Time to serialize gal into /tmp/LTL280440915750855561.gal : 13 ms
[2023-03-16 05:14:04] [INFO ] Time to serialize properties into /tmp/LTL15812708297576871690.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL280440915750855561.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15812708297576871690.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("(mi1_0<=((((((f2_0+f2_1)+(f2_2+f2_3))+((f2_4+f2_5)+(f2_6+f2_7)))+(((f2_8+f2_9)+(f2_10+f2_11))+((f2_12+f2_13)+(f2_14+f2_15))))...653
Formula 0 simplified : XF(!"(mi1_0<=((((((f2_0+f2_1)+(f2_2+f2_3))+((f2_4+f2_5)+(f2_6+f2_7)))+(((f2_8+f2_9)+(f2_10+f2_11))+((f2_12+f2_13)+(f2_14+f2_15))))+(...637
Detected timeout of ITS tools.
[2023-03-16 05:14:20] [INFO ] Flatten gal took : 88 ms
[2023-03-16 05:14:20] [INFO ] Applying decomposition
[2023-03-16 05:14:20] [INFO ] Flatten gal took : 78 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18147469767675742487.txt' '-o' '/tmp/graph18147469767675742487.bin' '-w' '/tmp/graph18147469767675742487.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18147469767675742487.bin' '-l' '-1' '-v' '-w' '/tmp/graph18147469767675742487.weights' '-q' '0' '-e' '0.001'
[2023-03-16 05:14:20] [INFO ] Decomposing Gal with order
[2023-03-16 05:14:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 05:14:20] [INFO ] Removed a total of 3035 redundant transitions.
[2023-03-16 05:14:20] [INFO ] Flatten gal took : 396 ms
[2023-03-16 05:14:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 512 labels/synchronizations in 61 ms.
[2023-03-16 05:14:21] [INFO ] Time to serialize gal into /tmp/LTL5362222963909262813.gal : 12 ms
[2023-03-16 05:14:21] [INFO ] Time to serialize properties into /tmp/LTL3121633272772208007.ltl : 130 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5362222963909262813.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3121633272772208007.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("(gu2.mi1_0<=((((((gu2.f2_0+gu2.f2_1)+(gu2.f2_2+gu2.f2_3))+((gu2.f2_4+gu2.f2_5)+(gu2.f2_6+gu2.f2_7)))+(((gu2.f2_8+gu2.f2_9)+(g...935
Formula 0 simplified : XF(!"(gu2.mi1_0<=((((((gu2.f2_0+gu2.f2_1)+(gu2.f2_2+gu2.f2_3))+((gu2.f2_4+gu2.f2_5)+(gu2.f2_6+gu2.f2_7)))+(((gu2.f2_8+gu2.f2_9)+(gu2...919
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14470915223147920318
[2023-03-16 05:14:36] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14470915223147920318
Running compilation step : cd /tmp/ltsmin14470915223147920318;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14470915223147920318;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14470915223147920318;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property PolyORBNT-COL-S10J60-LTLCardinality-10 finished in 144835 ms.
[2023-03-16 05:14:39] [INFO ] Flatten gal took : 80 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10300594367272567119
[2023-03-16 05:14:39] [INFO ] Too many transitions (2194) to apply POR reductions. Disabling POR matrices.
[2023-03-16 05:14:39] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10300594367272567119
Running compilation step : cd /tmp/ltsmin10300594367272567119;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-16 05:14:39] [INFO ] Applying decomposition
[2023-03-16 05:14:39] [INFO ] Flatten gal took : 82 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1905192619111795068.txt' '-o' '/tmp/graph1905192619111795068.bin' '-w' '/tmp/graph1905192619111795068.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1905192619111795068.bin' '-l' '-1' '-v' '-w' '/tmp/graph1905192619111795068.weights' '-q' '0' '-e' '0.001'
[2023-03-16 05:14:39] [INFO ] Decomposing Gal with order
[2023-03-16 05:14:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 05:14:39] [INFO ] Removed a total of 2304 redundant transitions.
[2023-03-16 05:14:39] [INFO ] Flatten gal took : 204 ms
[2023-03-16 05:14:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 508 labels/synchronizations in 36 ms.
[2023-03-16 05:14:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality1714322046562607705.gal : 17 ms
[2023-03-16 05:14:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality12254953902251707483.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1714322046562607705.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12254953902251707483.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X(G(("(gu27.mi1_0<=((((((gu27.f2_0+gu27.f2_1)+(gu27.f2_2+gu27.f2_3))+((gu27.f2_4+gu27.f2_5)+(gu27.f2_6+gu27.f2_7)))+(((gu27.f2_8+gu...1033
Formula 0 simplified : XF(!"(gu27.mi1_0<=((((((gu27.f2_0+gu27.f2_1)+(gu27.f2_2+gu27.f2_3))+((gu27.f2_4+gu27.f2_5)+(gu27.f2_6+gu27.f2_7)))+(((gu27.f2_8+gu27...1017
Compilation finished in 4866 ms.
Running link step : cd /tmp/ltsmin10300594367272567119;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin10300594367272567119;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||<>(([](<>((LTLAPp1==true)))||(<>((LTLAPp1==true))&&X((LTLAPp2==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.022: LTL layer: formula: X([](((LTLAPp0==true)||<>(([](<>((LTLAPp1==true)))||(<>((LTLAPp1==true))&&X((LTLAPp2==true))))))))
pins2lts-mc-linux64( 2/ 8), 0.022: "X([](((LTLAPp0==true)||<>(([](<>((LTLAPp1==true)))||(<>((LTLAPp1==true))&&X((LTLAPp2==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.023: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.062: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.657: DFS-FIFO for weak LTL, using special progress label 2198
pins2lts-mc-linux64( 0/ 8), 0.657: There are 2199 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.657: State length is 1224, there are 2201 groups
pins2lts-mc-linux64( 0/ 8), 0.657: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.657: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.657: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.657: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.850: ~1 levels ~960 states ~7480 transitions
pins2lts-mc-linux64( 5/ 8), 0.999: ~1 levels ~1920 states ~14504 transitions
pins2lts-mc-linux64( 7/ 8), 1.263: ~1 levels ~3840 states ~24736 transitions
pins2lts-mc-linux64( 5/ 8), 1.706: ~1 levels ~7680 states ~41832 transitions
pins2lts-mc-linux64( 4/ 8), 2.768: ~1 levels ~15360 states ~113232 transitions
pins2lts-mc-linux64( 4/ 8), 5.617: ~1 levels ~30720 states ~351488 transitions
pins2lts-mc-linux64( 4/ 8), 14.282: ~1 levels ~61440 states ~1987920 transitions
pins2lts-mc-linux64( 4/ 8), 31.524: ~1 levels ~122880 states ~5454672 transitions
pins2lts-mc-linux64( 4/ 8), 44.791: ~1 levels ~245760 states ~6325984 transitions
pins2lts-mc-linux64( 4/ 8), 69.413: ~1 levels ~491520 states ~7281920 transitions
pins2lts-mc-linux64( 4/ 8), 119.237: ~1 levels ~983040 states ~9219960 transitions
pins2lts-mc-linux64( 4/ 8), 235.093: ~1 levels ~1966080 states ~13052624 transitions
pins2lts-mc-linux64( 6/ 8), 264.970: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 272.010:
pins2lts-mc-linux64( 0/ 8), 272.010: mean standard work distribution: 70.5% (states) 27.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 272.010:
pins2lts-mc-linux64( 0/ 8), 272.010: Explored 792216 states 49772359 transitions, fanout: 62.827
pins2lts-mc-linux64( 0/ 8), 272.010: Total exploration time 271.320 sec (264.320 sec minimum, 265.735 sec on average)
pins2lts-mc-linux64( 0/ 8), 272.010: States per second: 2920, Transitions per second: 183445
pins2lts-mc-linux64( 0/ 8), 272.010:
pins2lts-mc-linux64( 0/ 8), 272.010: Progress states detected: 20271734
pins2lts-mc-linux64( 0/ 8), 272.010: Redundant explorations: -96.0920
pins2lts-mc-linux64( 0/ 8), 272.010:
pins2lts-mc-linux64( 0/ 8), 272.010: Queue width: 8B, total height: 24298248, memory: 185.38MB
pins2lts-mc-linux64( 0/ 8), 272.010: Tree memory: 410.7MB, 21.2 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 272.010: Tree fill ratio (roots/leafs): 15.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 272.010: Stored 2340 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 272.010: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 272.010: Est. total memory use: 596.0MB (~1209.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10300594367272567119;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||<>(([](<>((LTLAPp1==true)))||(<>((LTLAPp1==true))&&X((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10300594367272567119;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||<>(([](<>((LTLAPp1==true)))||(<>((LTLAPp1==true))&&X((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-16 05:36:57] [INFO ] Applying decomposition
[2023-03-16 05:36:57] [INFO ] Flatten gal took : 175 ms
[2023-03-16 05:36:57] [INFO ] Decomposing Gal with order
[2023-03-16 05:36:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 05:36:58] [INFO ] Removed a total of 9596 redundant transitions.
[2023-03-16 05:36:58] [INFO ] Flatten gal took : 395 ms
[2023-03-16 05:36:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 30 ms.
[2023-03-16 05:36:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality17341476173327033378.gal : 41 ms
[2023-03-16 05:36:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality313157198848891410.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17341476173327033378.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality313157198848891410.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((X(G(("(gmi1.mi1_0<=((((((gJobs0.f2_0+gJobs1.f2_1)+(gJobs2.f2_2+gJobs3.f2_3))+((gJobs4.f2_4+gJobs5.f2_5)+(gJobs6.f2_6+gJobs7.f2_7)))...1220
Formula 0 simplified : XF(!"(gmi1.mi1_0<=((((((gJobs0.f2_0+gJobs1.f2_1)+(gJobs2.f2_2+gJobs3.f2_3))+((gJobs4.f2_4+gJobs5.f2_5)+(gJobs6.f2_6+gJobs7.f2_7)))+(...1204
Detected timeout of ITS tools.
[2023-03-16 05:59:29] [INFO ] Flatten gal took : 193 ms
[2023-03-16 05:59:46] [INFO ] Input system was already deterministic with 2194 transitions.
[2023-03-16 05:59:46] [INFO ] Transformed 1223 places.
[2023-03-16 05:59:46] [INFO ] Transformed 2194 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-16 06:00:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality11195000031119944912.gal : 47 ms
[2023-03-16 06:00:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality12390936589854796762.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11195000031119944912.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12390936589854796762.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(("(mi1_0<=((((((f2_0+f2_1)+(f2_2+f2_3))+((f2_4+f2_5)+(f2_6+f2_7)))+(((f2_8+f2_9)+(f2_10+f2_11))+((f2_12+f2_13)+(f2_14+f2_15))))...653
Formula 0 simplified : XF(!"(mi1_0<=((((((f2_0+f2_1)+(f2_2+f2_3))+((f2_4+f2_5)+(f2_6+f2_7)))+(((f2_8+f2_9)+(f2_10+f2_11))+((f2_12+f2_13)+(f2_14+f2_15))))+(...637
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 3264592 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15521736 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J60"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S10J60, 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 r293-tall-167873945800699"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J60.tgz
mv PolyORBNT-COL-S10J60 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 '
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 ;