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.r297-tall-167873950800684.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 ltsminxred
Input is PolyORBNT-COL-S10J30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950800684
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 8.9K Feb 26 00:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 00:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 00:29 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 3.8K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 01:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 01:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 01:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 93K 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-S10J30-LTLFireability-00
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-01
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-02
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-03
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-04
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-05
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-06
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-07
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-08
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-09
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-10
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-11
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-12
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-13
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-14
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679610466309

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J30
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 22:27:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 22:27:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 22:27:48] [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-23 22:27:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-23 22:27:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 631 ms
[2023-03-23 22:27:49] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-23 22:27:49] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2023-03-23 22:27:49] [INFO ] Skeletonized 16 HLPN properties in 10 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 570 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :14
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 38 rows 48 cols
[2023-03-23 22:27:49] [INFO ] Computed 13 place invariants in 10 ms
[2023-03-23 22:27:49] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-23 22:27:49] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 22:27:49] [INFO ] After 269ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-23 22:27:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 22:27:50] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 22:27:50] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-23 22:27:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:27:50] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-23 22:27:50] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 7 ms to minimize.
[2023-03-23 22:27:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-23 22:27:50] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-23 22:27:50] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 1 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 0 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 1 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 23 ms. Remains 34 /48 variables (removed 14) and now considering 28/38 (removed 10) transitions.
// Phase 1: matrix 28 rows 34 cols
[2023-03-23 22:27:50] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-23 22:27:50] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 34/48 places, 28/38 transitions.
Incomplete random walk after 10007 steps, including 741 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 293 resets, run finished after 24 ms. (steps per millisecond=416 ) 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 18 ms. (steps per millisecond=77 ) 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 5 ms. (steps per millisecond=278 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
[2023-03-23 22:27:50] [INFO ] Flatten gal took : 26 ms
[2023-03-23 22:27:50] [INFO ] Flatten gal took : 7 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-23 22:27:50] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 268 ms.
[2023-03-23 22:27:50] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
[2023-03-23 22:27:50] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-23 22:27:50] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-23 22:27:50] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-23 22:27:50] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-23 22:27:50] [INFO ] Reduced 780 identical enabling conditions.
Deduced a syphon composed of 30 places in 23 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 556 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Applied a total of 0 rules in 41 ms. Remains 664 /664 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
[2023-03-23 22:27:50] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2023-03-23 22:27:50] [INFO ] Computed 92 place invariants in 107 ms
[2023-03-23 22:27:52] [INFO ] Dead Transitions using invariants and state equation in 1356 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-23 22:27:52] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 664 cols
[2023-03-23 22:27:52] [INFO ] Computed 92 place invariants in 49 ms
[2023-03-23 22:27:52] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-23 22:27:52] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2023-03-23 22:27:52] [INFO ] Invariant cache hit.
[2023-03-23 22:27:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:27:53] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/664 places, 1325/1940 transitions.
Applied a total of 0 rules in 32 ms. Remains 664 /664 variables (removed 0) and now considering 1325/1325 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2544 ms. Remains : 664/664 places, 1325/1940 transitions.
Support contains 556 out of 664 places after structural reductions.
[2023-03-23 22:27:53] [INFO ] Flatten gal took : 185 ms
[2023-03-23 22:27:53] [INFO ] Flatten gal took : 144 ms
[2023-03-23 22:27:54] [INFO ] Input system was already deterministic with 1325 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 1017 ms. (steps per millisecond=9 ) properties (out of 21) seen :3
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :14
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-23 22:27:55] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2023-03-23 22:27:55] [INFO ] Invariant cache hit.
[2023-03-23 22:27:55] [INFO ] [Real]Absence check using 85 positive place invariants in 30 ms returned sat
[2023-03-23 22:27:55] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-23 22:27:56] [INFO ] After 858ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-23 22:27:56] [INFO ] [Nat]Absence check using 85 positive place invariants in 25 ms returned sat
[2023-03-23 22:27:56] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-23 22:27:57] [INFO ] After 596ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-23 22:27:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:27:57] [INFO ] After 156ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-23 22:27:57] [INFO ] Deduced a trap composed of 317 places in 401 ms of which 1 ms to minimize.
[2023-03-23 22:27:58] [INFO ] Deduced a trap composed of 313 places in 402 ms of which 2 ms to minimize.
[2023-03-23 22:27:58] [INFO ] Deduced a trap composed of 305 places in 388 ms of which 1 ms to minimize.
[2023-03-23 22:27:59] [INFO ] Deduced a trap composed of 313 places in 404 ms of which 1 ms to minimize.
[2023-03-23 22:27:59] [INFO ] Deduced a trap composed of 305 places in 383 ms of which 1 ms to minimize.
[2023-03-23 22:28:00] [INFO ] Deduced a trap composed of 299 places in 387 ms of which 1 ms to minimize.
[2023-03-23 22:28:00] [INFO ] Deduced a trap composed of 305 places in 380 ms of which 1 ms to minimize.
[2023-03-23 22:28:00] [INFO ] Deduced a trap composed of 305 places in 379 ms of which 0 ms to minimize.
[2023-03-23 22:28:01] [INFO ] Deduced a trap composed of 309 places in 357 ms of which 1 ms to minimize.
[2023-03-23 22:28:01] [INFO ] Deduced a trap composed of 311 places in 381 ms of which 0 ms to minimize.
[2023-03-23 22:28:02] [INFO ] Deduced a trap composed of 311 places in 393 ms of which 1 ms to minimize.
[2023-03-23 22:28:02] [INFO ] Deduced a trap composed of 313 places in 373 ms of which 1 ms to minimize.
[2023-03-23 22:28:03] [INFO ] Deduced a trap composed of 309 places in 353 ms of which 1 ms to minimize.
[2023-03-23 22:28:03] [INFO ] Deduced a trap composed of 311 places in 383 ms of which 1 ms to minimize.
[2023-03-23 22:28:04] [INFO ] Deduced a trap composed of 311 places in 370 ms of which 1 ms to minimize.
[2023-03-23 22:28:04] [INFO ] Deduced a trap composed of 301 places in 346 ms of which 1 ms to minimize.
[2023-03-23 22:28:04] [INFO ] Deduced a trap composed of 311 places in 350 ms of which 1 ms to minimize.
[2023-03-23 22:28:05] [INFO ] Deduced a trap composed of 309 places in 362 ms of which 1 ms to minimize.
[2023-03-23 22:28:05] [INFO ] Deduced a trap composed of 311 places in 387 ms of which 1 ms to minimize.
[2023-03-23 22:28:06] [INFO ] Deduced a trap composed of 313 places in 381 ms of which 1 ms to minimize.
[2023-03-23 22:28:06] [INFO ] Deduced a trap composed of 313 places in 374 ms of which 1 ms to minimize.
[2023-03-23 22:28:07] [INFO ] Deduced a trap composed of 309 places in 363 ms of which 0 ms to minimize.
[2023-03-23 22:28:07] [INFO ] Deduced a trap composed of 309 places in 376 ms of which 0 ms to minimize.
[2023-03-23 22:28:08] [INFO ] Deduced a trap composed of 299 places in 350 ms of which 1 ms to minimize.
[2023-03-23 22:28:10] [INFO ] Deduced a trap composed of 303 places in 391 ms of which 0 ms to minimize.
[2023-03-23 22:28:10] [INFO ] Deduced a trap composed of 303 places in 382 ms of which 0 ms to minimize.
[2023-03-23 22:28:11] [INFO ] Deduced a trap composed of 305 places in 383 ms of which 0 ms to minimize.
[2023-03-23 22:28:11] [INFO ] Deduced a trap composed of 305 places in 351 ms of which 1 ms to minimize.
[2023-03-23 22:28:12] [INFO ] Deduced a trap composed of 313 places in 351 ms of which 1 ms to minimize.
[2023-03-23 22:28:12] [INFO ] Deduced a trap composed of 311 places in 352 ms of which 0 ms to minimize.
[2023-03-23 22:28:13] [INFO ] Deduced a trap composed of 309 places in 388 ms of which 1 ms to minimize.
[2023-03-23 22:28:13] [INFO ] Deduced a trap composed of 317 places in 358 ms of which 0 ms to minimize.
[2023-03-23 22:28:14] [INFO ] Deduced a trap composed of 309 places in 450 ms of which 3 ms to minimize.
[2023-03-23 22:28:14] [INFO ] Deduced a trap composed of 309 places in 379 ms of which 0 ms to minimize.
[2023-03-23 22:28:15] [INFO ] Deduced a trap composed of 313 places in 370 ms of which 1 ms to minimize.
[2023-03-23 22:28:16] [INFO ] Deduced a trap composed of 315 places in 374 ms of which 1 ms to minimize.
[2023-03-23 22:28:16] [INFO ] Deduced a trap composed of 301 places in 365 ms of which 1 ms to minimize.
[2023-03-23 22:28:16] [INFO ] Deduced a trap composed of 309 places in 382 ms of which 0 ms to minimize.
[2023-03-23 22:28:17] [INFO ] Deduced a trap composed of 313 places in 383 ms of which 1 ms to minimize.
[2023-03-23 22:28:18] [INFO ] Deduced a trap composed of 305 places in 381 ms of which 1 ms to minimize.
[2023-03-23 22:28:18] [INFO ] Deduced a trap composed of 303 places in 381 ms of which 1 ms to minimize.
[2023-03-23 22:28:19] [INFO ] Deduced a trap composed of 307 places in 377 ms of which 0 ms to minimize.
[2023-03-23 22:28:19] [INFO ] Deduced a trap composed of 313 places in 371 ms of which 1 ms to minimize.
[2023-03-23 22:28:20] [INFO ] Deduced a trap composed of 311 places in 350 ms of which 0 ms to minimize.
[2023-03-23 22:28:20] [INFO ] Deduced a trap composed of 317 places in 381 ms of which 1 ms to minimize.
[2023-03-23 22:28:20] [INFO ] Deduced a trap composed of 307 places in 377 ms of which 1 ms to minimize.
[2023-03-23 22:28:21] [INFO ] Deduced a trap composed of 303 places in 389 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 22:28:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 22:28:21] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 80 place count 619 transition count 1290
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 80 place count 619 transition count 1255
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 150 place count 584 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 583 transition count 1254
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 583 transition count 1254
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 156 place count 581 transition count 1252
Applied a total of 156 rules in 203 ms. Remains 581 /664 variables (removed 83) and now considering 1252/1325 (removed 73) transitions.
[2023-03-23 22:28:21] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 22:28:21] [INFO ] Computed 82 place invariants in 21 ms
[2023-03-23 22:28:22] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 925 ms. Remains : 581/664 places, 1252/1325 transitions.
Incomplete random walk after 10000 steps, including 737 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 22:28:22] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 22:28:22] [INFO ] Invariant cache hit.
[2023-03-23 22:28:22] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-23 22:28:22] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-23 22:28:23] [INFO ] After 374ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 22:28:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:28:23] [INFO ] After 98ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 22:28:23] [INFO ] After 613ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 22:28:23] [INFO ] [Nat]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-23 22:28:23] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-23 22:28:23] [INFO ] After 353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 22:28:23] [INFO ] After 225ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 22:28:24] [INFO ] Deduced a trap composed of 229 places in 331 ms of which 0 ms to minimize.
[2023-03-23 22:28:24] [INFO ] Deduced a trap composed of 233 places in 347 ms of which 2 ms to minimize.
[2023-03-23 22:28:24] [INFO ] Deduced a trap composed of 231 places in 320 ms of which 0 ms to minimize.
[2023-03-23 22:28:25] [INFO ] Deduced a trap composed of 231 places in 315 ms of which 0 ms to minimize.
[2023-03-23 22:28:25] [INFO ] Deduced a trap composed of 223 places in 311 ms of which 1 ms to minimize.
[2023-03-23 22:28:26] [INFO ] Deduced a trap composed of 231 places in 319 ms of which 0 ms to minimize.
[2023-03-23 22:28:26] [INFO ] Deduced a trap composed of 241 places in 331 ms of which 4 ms to minimize.
[2023-03-23 22:28:26] [INFO ] Deduced a trap composed of 227 places in 329 ms of which 1 ms to minimize.
[2023-03-23 22:28:27] [INFO ] Deduced a trap composed of 237 places in 328 ms of which 1 ms to minimize.
[2023-03-23 22:28:27] [INFO ] Deduced a trap composed of 229 places in 337 ms of which 1 ms to minimize.
[2023-03-23 22:28:28] [INFO ] Deduced a trap composed of 229 places in 340 ms of which 1 ms to minimize.
[2023-03-23 22:28:28] [INFO ] Deduced a trap composed of 229 places in 313 ms of which 1 ms to minimize.
[2023-03-23 22:28:28] [INFO ] Deduced a trap composed of 231 places in 340 ms of which 1 ms to minimize.
[2023-03-23 22:28:29] [INFO ] Deduced a trap composed of 229 places in 347 ms of which 1 ms to minimize.
[2023-03-23 22:28:29] [INFO ] Deduced a trap composed of 229 places in 314 ms of which 1 ms to minimize.
[2023-03-23 22:28:30] [INFO ] Deduced a trap composed of 235 places in 327 ms of which 1 ms to minimize.
[2023-03-23 22:28:30] [INFO ] Deduced a trap composed of 231 places in 335 ms of which 3 ms to minimize.
[2023-03-23 22:28:30] [INFO ] Deduced a trap composed of 233 places in 326 ms of which 1 ms to minimize.
[2023-03-23 22:28:31] [INFO ] Deduced a trap composed of 241 places in 341 ms of which 1 ms to minimize.
[2023-03-23 22:28:31] [INFO ] Deduced a trap composed of 237 places in 338 ms of which 2 ms to minimize.
[2023-03-23 22:28:32] [INFO ] Deduced a trap composed of 239 places in 338 ms of which 0 ms to minimize.
[2023-03-23 22:28:32] [INFO ] Deduced a trap composed of 237 places in 342 ms of which 1 ms to minimize.
[2023-03-23 22:28:32] [INFO ] Deduced a trap composed of 227 places in 338 ms of which 0 ms to minimize.
[2023-03-23 22:28:33] [INFO ] Deduced a trap composed of 237 places in 332 ms of which 1 ms to minimize.
[2023-03-23 22:28:33] [INFO ] Deduced a trap composed of 229 places in 329 ms of which 1 ms to minimize.
[2023-03-23 22:28:34] [INFO ] Deduced a trap composed of 231 places in 322 ms of which 0 ms to minimize.
[2023-03-23 22:28:34] [INFO ] Deduced a trap composed of 235 places in 345 ms of which 1 ms to minimize.
[2023-03-23 22:28:35] [INFO ] Deduced a trap composed of 235 places in 360 ms of which 1 ms to minimize.
[2023-03-23 22:28:35] [INFO ] Deduced a trap composed of 231 places in 342 ms of which 1 ms to minimize.
[2023-03-23 22:28:35] [INFO ] Deduced a trap composed of 235 places in 316 ms of which 0 ms to minimize.
[2023-03-23 22:28:36] [INFO ] Deduced a trap composed of 237 places in 334 ms of which 1 ms to minimize.
[2023-03-23 22:28:36] [INFO ] Deduced a trap composed of 231 places in 308 ms of which 1 ms to minimize.
[2023-03-23 22:28:37] [INFO ] Deduced a trap composed of 233 places in 336 ms of which 1 ms to minimize.
[2023-03-23 22:28:37] [INFO ] Deduced a trap composed of 231 places in 321 ms of which 1 ms to minimize.
[2023-03-23 22:28:38] [INFO ] Deduced a trap composed of 233 places in 320 ms of which 1 ms to minimize.
[2023-03-23 22:28:38] [INFO ] Deduced a trap composed of 235 places in 331 ms of which 1 ms to minimize.
[2023-03-23 22:28:38] [INFO ] Deduced a trap composed of 233 places in 323 ms of which 0 ms to minimize.
[2023-03-23 22:28:39] [INFO ] Deduced a trap composed of 237 places in 331 ms of which 1 ms to minimize.
[2023-03-23 22:28:39] [INFO ] Deduced a trap composed of 231 places in 349 ms of which 0 ms to minimize.
[2023-03-23 22:28:40] [INFO ] Deduced a trap composed of 233 places in 321 ms of which 1 ms to minimize.
[2023-03-23 22:28:40] [INFO ] Deduced a trap composed of 231 places in 316 ms of which 0 ms to minimize.
[2023-03-23 22:28:40] [INFO ] Deduced a trap composed of 239 places in 316 ms of which 0 ms to minimize.
[2023-03-23 22:28:41] [INFO ] Deduced a trap composed of 233 places in 378 ms of which 1 ms to minimize.
[2023-03-23 22:28:41] [INFO ] Deduced a trap composed of 231 places in 330 ms of which 1 ms to minimize.
[2023-03-23 22:28:42] [INFO ] Deduced a trap composed of 233 places in 350 ms of which 0 ms to minimize.
[2023-03-23 22:28:42] [INFO ] Deduced a trap composed of 235 places in 360 ms of which 1 ms to minimize.
[2023-03-23 22:28:43] [INFO ] Deduced a trap composed of 227 places in 362 ms of which 0 ms to minimize.
[2023-03-23 22:28:43] [INFO ] Deduced a trap composed of 239 places in 337 ms of which 0 ms to minimize.
[2023-03-23 22:28:43] [INFO ] Deduced a trap composed of 239 places in 336 ms of which 0 ms to minimize.
[2023-03-23 22:28:44] [INFO ] Deduced a trap composed of 235 places in 342 ms of which 0 ms to minimize.
[2023-03-23 22:28:44] [INFO ] Deduced a trap composed of 235 places in 335 ms of which 0 ms to minimize.
[2023-03-23 22:28:48] [INFO ] Deduced a trap composed of 237 places in 325 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 22:28:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 22:28:48] [INFO ] After 25099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 581 transition count 1251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 580 transition count 1251
Applied a total of 2 rules in 59 ms. Remains 580 /581 variables (removed 1) and now considering 1251/1252 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 580/581 places, 1251/1252 transitions.
Incomplete random walk after 10000 steps, including 727 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 375056 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :{}
Probabilistic random walk after 375056 steps, saw 60389 distinct states, run finished after 3002 ms. (steps per millisecond=124 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 22:28:51] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2023-03-23 22:28:51] [INFO ] Computed 82 place invariants in 26 ms
[2023-03-23 22:28:51] [INFO ] [Real]Absence check using 75 positive place invariants in 19 ms returned sat
[2023-03-23 22:28:51] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-23 22:28:51] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 22:28:51] [INFO ] [Nat]Absence check using 75 positive place invariants in 18 ms returned sat
[2023-03-23 22:28:51] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-23 22:28:52] [INFO ] After 816ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 22:28:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:28:52] [INFO ] After 142ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 22:28:53] [INFO ] Deduced a trap composed of 244 places in 330 ms of which 0 ms to minimize.
[2023-03-23 22:28:53] [INFO ] Deduced a trap composed of 234 places in 330 ms of which 1 ms to minimize.
[2023-03-23 22:28:53] [INFO ] Deduced a trap composed of 234 places in 324 ms of which 0 ms to minimize.
[2023-03-23 22:28:54] [INFO ] Deduced a trap composed of 230 places in 330 ms of which 0 ms to minimize.
[2023-03-23 22:28:54] [INFO ] Deduced a trap composed of 234 places in 321 ms of which 0 ms to minimize.
[2023-03-23 22:28:55] [INFO ] Deduced a trap composed of 230 places in 332 ms of which 1 ms to minimize.
[2023-03-23 22:28:55] [INFO ] Deduced a trap composed of 232 places in 321 ms of which 1 ms to minimize.
[2023-03-23 22:28:55] [INFO ] Deduced a trap composed of 226 places in 329 ms of which 1 ms to minimize.
[2023-03-23 22:28:56] [INFO ] Deduced a trap composed of 232 places in 343 ms of which 0 ms to minimize.
[2023-03-23 22:28:56] [INFO ] Deduced a trap composed of 247 places in 348 ms of which 1 ms to minimize.
[2023-03-23 22:28:57] [INFO ] Deduced a trap composed of 234 places in 338 ms of which 1 ms to minimize.
[2023-03-23 22:28:57] [INFO ] Deduced a trap composed of 232 places in 294 ms of which 1 ms to minimize.
[2023-03-23 22:28:57] [INFO ] Deduced a trap composed of 234 places in 315 ms of which 1 ms to minimize.
[2023-03-23 22:28:58] [INFO ] Deduced a trap composed of 228 places in 330 ms of which 0 ms to minimize.
[2023-03-23 22:28:58] [INFO ] Deduced a trap composed of 226 places in 325 ms of which 1 ms to minimize.
[2023-03-23 22:28:59] [INFO ] Deduced a trap composed of 230 places in 334 ms of which 1 ms to minimize.
[2023-03-23 22:28:59] [INFO ] Deduced a trap composed of 230 places in 333 ms of which 1 ms to minimize.
[2023-03-23 22:28:59] [INFO ] Deduced a trap composed of 230 places in 329 ms of which 1 ms to minimize.
[2023-03-23 22:29:00] [INFO ] Deduced a trap composed of 224 places in 329 ms of which 0 ms to minimize.
[2023-03-23 22:29:00] [INFO ] Deduced a trap composed of 238 places in 342 ms of which 1 ms to minimize.
[2023-03-23 22:29:01] [INFO ] Deduced a trap composed of 226 places in 348 ms of which 1 ms to minimize.
[2023-03-23 22:29:01] [INFO ] Deduced a trap composed of 228 places in 342 ms of which 1 ms to minimize.
[2023-03-23 22:29:01] [INFO ] Deduced a trap composed of 228 places in 308 ms of which 1 ms to minimize.
[2023-03-23 22:29:02] [INFO ] Deduced a trap composed of 232 places in 327 ms of which 0 ms to minimize.
[2023-03-23 22:29:02] [INFO ] Deduced a trap composed of 230 places in 310 ms of which 1 ms to minimize.
[2023-03-23 22:29:03] [INFO ] Deduced a trap composed of 240 places in 335 ms of which 0 ms to minimize.
[2023-03-23 22:29:03] [INFO ] Deduced a trap composed of 232 places in 330 ms of which 1 ms to minimize.
[2023-03-23 22:29:03] [INFO ] Deduced a trap composed of 232 places in 337 ms of which 0 ms to minimize.
[2023-03-23 22:29:04] [INFO ] Deduced a trap composed of 224 places in 341 ms of which 1 ms to minimize.
[2023-03-23 22:29:04] [INFO ] Deduced a trap composed of 236 places in 345 ms of which 1 ms to minimize.
[2023-03-23 22:29:05] [INFO ] Deduced a trap composed of 230 places in 338 ms of which 1 ms to minimize.
[2023-03-23 22:29:05] [INFO ] Deduced a trap composed of 224 places in 341 ms of which 1 ms to minimize.
[2023-03-23 22:29:05] [INFO ] Deduced a trap composed of 234 places in 332 ms of which 1 ms to minimize.
[2023-03-23 22:29:06] [INFO ] Deduced a trap composed of 226 places in 332 ms of which 1 ms to minimize.
[2023-03-23 22:29:06] [INFO ] Deduced a trap composed of 240 places in 337 ms of which 0 ms to minimize.
[2023-03-23 22:29:07] [INFO ] Deduced a trap composed of 234 places in 337 ms of which 1 ms to minimize.
[2023-03-23 22:29:07] [INFO ] Deduced a trap composed of 236 places in 332 ms of which 1 ms to minimize.
[2023-03-23 22:29:08] [INFO ] Deduced a trap composed of 222 places in 307 ms of which 0 ms to minimize.
[2023-03-23 22:29:08] [INFO ] Deduced a trap composed of 242 places in 326 ms of which 1 ms to minimize.
[2023-03-23 22:29:08] [INFO ] Deduced a trap composed of 228 places in 320 ms of which 0 ms to minimize.
[2023-03-23 22:29:09] [INFO ] Deduced a trap composed of 230 places in 332 ms of which 1 ms to minimize.
[2023-03-23 22:29:09] [INFO ] Deduced a trap composed of 236 places in 330 ms of which 2 ms to minimize.
[2023-03-23 22:29:10] [INFO ] Deduced a trap composed of 230 places in 323 ms of which 0 ms to minimize.
[2023-03-23 22:29:10] [INFO ] Deduced a trap composed of 232 places in 330 ms of which 1 ms to minimize.
[2023-03-23 22:29:11] [INFO ] Deduced a trap composed of 240 places in 346 ms of which 1 ms to minimize.
[2023-03-23 22:29:12] [INFO ] Deduced a trap composed of 234 places in 333 ms of which 0 ms to minimize.
[2023-03-23 22:29:12] [INFO ] Deduced a trap composed of 232 places in 328 ms of which 0 ms to minimize.
[2023-03-23 22:29:13] [INFO ] Deduced a trap composed of 226 places in 334 ms of which 1 ms to minimize.
[2023-03-23 22:29:13] [INFO ] Deduced a trap composed of 228 places in 328 ms of which 1 ms to minimize.
[2023-03-23 22:29:13] [INFO ] Deduced a trap composed of 228 places in 324 ms of which 1 ms to minimize.
[2023-03-23 22:29:14] [INFO ] Deduced a trap composed of 234 places in 326 ms of which 1 ms to minimize.
[2023-03-23 22:29:14] [INFO ] Deduced a trap composed of 230 places in 326 ms of which 1 ms to minimize.
[2023-03-23 22:29:15] [INFO ] Deduced a trap composed of 234 places in 343 ms of which 1 ms to minimize.
[2023-03-23 22:29:15] [INFO ] Deduced a trap composed of 226 places in 322 ms of which 0 ms to minimize.
[2023-03-23 22:29:15] [INFO ] Deduced a trap composed of 226 places in 315 ms of which 1 ms to minimize.
[2023-03-23 22:29:16] [INFO ] Deduced a trap composed of 234 places in 308 ms of which 1 ms to minimize.
[2023-03-23 22:29:16] [INFO ] Deduced a trap composed of 234 places in 337 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 22:29:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 22:29:16] [INFO ] After 25213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 37 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 35 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2023-03-23 22:29:16] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-23 22:29:16] [INFO ] Invariant cache hit.
[2023-03-23 22:29:17] [INFO ] Implicit Places using invariants in 542 ms returned []
[2023-03-23 22:29:17] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-23 22:29:17] [INFO ] Invariant cache hit.
[2023-03-23 22:29:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:29:20] [INFO ] Implicit Places using invariants and state equation in 2871 ms returned []
Implicit Place search using SMT with State Equation took 3426 ms to find 0 implicit places.
[2023-03-23 22:29:20] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-23 22:29:20] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-23 22:29:20] [INFO ] Invariant cache hit.
[2023-03-23 22:29:21] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4236 ms. Remains : 580/580 places, 1251/1251 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 580 transition count 1242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 580 transition count 1241
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 579 transition count 1241
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 579 transition count 1240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 578 transition count 1240
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 578 transition count 1230
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 568 transition count 1230
Applied a total of 33 rules in 140 ms. Remains 568 /580 variables (removed 12) and now considering 1230/1251 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1230 rows 568 cols
[2023-03-23 22:29:21] [INFO ] Computed 82 place invariants in 22 ms
[2023-03-23 22:29:21] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2023-03-23 22:29:21] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-23 22:29:21] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 22:29:21] [INFO ] [Nat]Absence check using 75 positive place invariants in 19 ms returned sat
[2023-03-23 22:29:21] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-23 22:29:21] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 22:29:22] [INFO ] Deduced a trap composed of 234 places in 301 ms of which 1 ms to minimize.
[2023-03-23 22:29:22] [INFO ] Deduced a trap composed of 234 places in 294 ms of which 1 ms to minimize.
[2023-03-23 22:29:23] [INFO ] Deduced a trap composed of 230 places in 289 ms of which 0 ms to minimize.
[2023-03-23 22:29:23] [INFO ] Deduced a trap composed of 230 places in 299 ms of which 1 ms to minimize.
[2023-03-23 22:29:23] [INFO ] Deduced a trap composed of 230 places in 290 ms of which 1 ms to minimize.
[2023-03-23 22:29:24] [INFO ] Deduced a trap composed of 222 places in 291 ms of which 1 ms to minimize.
[2023-03-23 22:29:24] [INFO ] Deduced a trap composed of 228 places in 289 ms of which 0 ms to minimize.
[2023-03-23 22:29:24] [INFO ] Deduced a trap composed of 230 places in 306 ms of which 1 ms to minimize.
[2023-03-23 22:29:25] [INFO ] Deduced a trap composed of 236 places in 313 ms of which 0 ms to minimize.
[2023-03-23 22:29:25] [INFO ] Deduced a trap composed of 236 places in 281 ms of which 1 ms to minimize.
[2023-03-23 22:29:25] [INFO ] Deduced a trap composed of 224 places in 280 ms of which 1 ms to minimize.
[2023-03-23 22:29:26] [INFO ] Deduced a trap composed of 230 places in 305 ms of which 1 ms to minimize.
[2023-03-23 22:29:26] [INFO ] Deduced a trap composed of 232 places in 281 ms of which 1 ms to minimize.
[2023-03-23 22:29:26] [INFO ] Deduced a trap composed of 226 places in 279 ms of which 1 ms to minimize.
[2023-03-23 22:29:27] [INFO ] Deduced a trap composed of 234 places in 273 ms of which 1 ms to minimize.
[2023-03-23 22:29:27] [INFO ] Deduced a trap composed of 228 places in 273 ms of which 0 ms to minimize.
[2023-03-23 22:29:27] [INFO ] Deduced a trap composed of 234 places in 271 ms of which 1 ms to minimize.
[2023-03-23 22:29:28] [INFO ] Deduced a trap composed of 224 places in 309 ms of which 0 ms to minimize.
[2023-03-23 22:29:28] [INFO ] Deduced a trap composed of 228 places in 272 ms of which 0 ms to minimize.
[2023-03-23 22:29:28] [INFO ] Deduced a trap composed of 224 places in 272 ms of which 0 ms to minimize.
[2023-03-23 22:29:29] [INFO ] Deduced a trap composed of 226 places in 280 ms of which 0 ms to minimize.
[2023-03-23 22:29:29] [INFO ] Deduced a trap composed of 220 places in 282 ms of which 1 ms to minimize.
[2023-03-23 22:29:29] [INFO ] Deduced a trap composed of 232 places in 297 ms of which 0 ms to minimize.
[2023-03-23 22:29:30] [INFO ] Deduced a trap composed of 224 places in 309 ms of which 0 ms to minimize.
[2023-03-23 22:29:30] [INFO ] Deduced a trap composed of 228 places in 298 ms of which 0 ms to minimize.
[2023-03-23 22:29:30] [INFO ] Deduced a trap composed of 238 places in 317 ms of which 0 ms to minimize.
[2023-03-23 22:29:31] [INFO ] Deduced a trap composed of 234 places in 284 ms of which 1 ms to minimize.
[2023-03-23 22:29:31] [INFO ] Deduced a trap composed of 234 places in 296 ms of which 1 ms to minimize.
[2023-03-23 22:29:32] [INFO ] Deduced a trap composed of 232 places in 289 ms of which 0 ms to minimize.
[2023-03-23 22:29:32] [INFO ] Deduced a trap composed of 228 places in 296 ms of which 1 ms to minimize.
[2023-03-23 22:29:32] [INFO ] Deduced a trap composed of 234 places in 308 ms of which 0 ms to minimize.
[2023-03-23 22:29:33] [INFO ] Deduced a trap composed of 234 places in 305 ms of which 1 ms to minimize.
[2023-03-23 22:29:33] [INFO ] Deduced a trap composed of 236 places in 300 ms of which 1 ms to minimize.
[2023-03-23 22:29:34] [INFO ] Deduced a trap composed of 226 places in 303 ms of which 1 ms to minimize.
[2023-03-23 22:29:34] [INFO ] Deduced a trap composed of 232 places in 306 ms of which 1 ms to minimize.
[2023-03-23 22:29:34] [INFO ] Deduced a trap composed of 226 places in 301 ms of which 1 ms to minimize.
[2023-03-23 22:29:35] [INFO ] Deduced a trap composed of 238 places in 279 ms of which 0 ms to minimize.
[2023-03-23 22:29:35] [INFO ] Deduced a trap composed of 230 places in 309 ms of which 1 ms to minimize.
[2023-03-23 22:29:35] [INFO ] Deduced a trap composed of 232 places in 308 ms of which 1 ms to minimize.
[2023-03-23 22:29:36] [INFO ] Deduced a trap composed of 228 places in 276 ms of which 0 ms to minimize.
[2023-03-23 22:29:36] [INFO ] Deduced a trap composed of 230 places in 300 ms of which 1 ms to minimize.
[2023-03-23 22:29:36] [INFO ] Deduced a trap composed of 230 places in 300 ms of which 1 ms to minimize.
[2023-03-23 22:29:37] [INFO ] Deduced a trap composed of 228 places in 313 ms of which 0 ms to minimize.
[2023-03-23 22:29:37] [INFO ] Deduced a trap composed of 224 places in 310 ms of which 1 ms to minimize.
[2023-03-23 22:29:37] [INFO ] Deduced a trap composed of 230 places in 301 ms of which 1 ms to minimize.
[2023-03-23 22:29:38] [INFO ] Deduced a trap composed of 230 places in 297 ms of which 0 ms to minimize.
[2023-03-23 22:29:38] [INFO ] Deduced a trap composed of 232 places in 304 ms of which 1 ms to minimize.
[2023-03-23 22:29:38] [INFO ] Deduced a trap composed of 232 places in 302 ms of which 0 ms to minimize.
[2023-03-23 22:29:39] [INFO ] Deduced a trap composed of 230 places in 284 ms of which 0 ms to minimize.
[2023-03-23 22:29:39] [INFO ] Deduced a trap composed of 234 places in 285 ms of which 1 ms to minimize.
[2023-03-23 22:29:39] [INFO ] Deduced a trap composed of 230 places in 300 ms of which 1 ms to minimize.
[2023-03-23 22:29:40] [INFO ] Deduced a trap composed of 230 places in 300 ms of which 0 ms to minimize.
[2023-03-23 22:29:40] [INFO ] Deduced a trap composed of 228 places in 300 ms of which 1 ms to minimize.
[2023-03-23 22:29:40] [INFO ] Deduced a trap composed of 224 places in 300 ms of which 1 ms to minimize.
[2023-03-23 22:29:41] [INFO ] Deduced a trap composed of 226 places in 294 ms of which 1 ms to minimize.
[2023-03-23 22:29:41] [INFO ] Deduced a trap composed of 230 places in 288 ms of which 1 ms to minimize.
[2023-03-23 22:29:41] [INFO ] Deduced a trap composed of 230 places in 289 ms of which 1 ms to minimize.
[2023-03-23 22:29:42] [INFO ] Deduced a trap composed of 226 places in 309 ms of which 1 ms to minimize.
[2023-03-23 22:29:42] [INFO ] Deduced a trap composed of 230 places in 294 ms of which 1 ms to minimize.
[2023-03-23 22:29:42] [INFO ] Deduced a trap composed of 232 places in 298 ms of which 1 ms to minimize.
[2023-03-23 22:29:43] [INFO ] Deduced a trap composed of 236 places in 311 ms of which 0 ms to minimize.
[2023-03-23 22:29:43] [INFO ] Deduced a trap composed of 228 places in 288 ms of which 1 ms to minimize.
[2023-03-23 22:29:43] [INFO ] Deduced a trap composed of 230 places in 283 ms of which 1 ms to minimize.
[2023-03-23 22:29:44] [INFO ] Deduced a trap composed of 224 places in 287 ms of which 1 ms to minimize.
[2023-03-23 22:29:44] [INFO ] Deduced a trap composed of 226 places in 300 ms of which 0 ms to minimize.
[2023-03-23 22:29:44] [INFO ] Deduced a trap composed of 226 places in 288 ms of which 1 ms to minimize.
[2023-03-23 22:29:45] [INFO ] Deduced a trap composed of 234 places in 281 ms of which 1 ms to minimize.
[2023-03-23 22:29:45] [INFO ] Deduced a trap composed of 230 places in 308 ms of which 1 ms to minimize.
[2023-03-23 22:29:46] [INFO ] Deduced a trap composed of 228 places in 290 ms of which 0 ms to minimize.
[2023-03-23 22:29:46] [INFO ] Deduced a trap composed of 230 places in 288 ms of which 0 ms to minimize.
[2023-03-23 22:29:46] [INFO ] Deduced a trap composed of 230 places in 286 ms of which 1 ms to minimize.
[2023-03-23 22:29:47] [INFO ] Deduced a trap composed of 236 places in 308 ms of which 0 ms to minimize.
[2023-03-23 22:29:47] [INFO ] Deduced a trap composed of 234 places in 297 ms of which 1 ms to minimize.
[2023-03-23 22:29:47] [INFO ] Deduced a trap composed of 236 places in 306 ms of which 1 ms to minimize.
[2023-03-23 22:29:48] [INFO ] Deduced a trap composed of 230 places in 310 ms of which 1 ms to minimize.
[2023-03-23 22:29:48] [INFO ] Deduced a trap composed of 236 places in 304 ms of which 1 ms to minimize.
[2023-03-23 22:29:49] [INFO ] Deduced a trap composed of 230 places in 313 ms of which 0 ms to minimize.
[2023-03-23 22:29:49] [INFO ] Deduced a trap composed of 230 places in 310 ms of which 0 ms to minimize.
[2023-03-23 22:29:49] [INFO ] Deduced a trap composed of 224 places in 313 ms of which 0 ms to minimize.
[2023-03-23 22:29:50] [INFO ] Deduced a trap composed of 232 places in 314 ms of which 1 ms to minimize.
[2023-03-23 22:29:50] [INFO ] Deduced a trap composed of 226 places in 313 ms of which 1 ms to minimize.
[2023-03-23 22:29:50] [INFO ] Deduced a trap composed of 232 places in 323 ms of which 1 ms to minimize.
[2023-03-23 22:29:52] [INFO ] Deduced a trap composed of 232 places in 301 ms of which 1 ms to minimize.
[2023-03-23 22:29:52] [INFO ] Deduced a trap composed of 238 places in 302 ms of which 1 ms to minimize.
[2023-03-23 22:29:52] [INFO ] Deduced a trap composed of 232 places in 280 ms of which 1 ms to minimize.
[2023-03-23 22:29:53] [INFO ] Deduced a trap composed of 226 places in 276 ms of which 1 ms to minimize.
[2023-03-23 22:29:53] [INFO ] Deduced a trap composed of 232 places in 309 ms of which 1 ms to minimize.
[2023-03-23 22:29:53] [INFO ] Deduced a trap composed of 226 places in 276 ms of which 1 ms to minimize.
[2023-03-23 22:29:54] [INFO ] Deduced a trap composed of 228 places in 275 ms of which 1 ms to minimize.
[2023-03-23 22:29:54] [INFO ] Deduced a trap composed of 228 places in 281 ms of which 1 ms to minimize.
[2023-03-23 22:29:54] [INFO ] Deduced a trap composed of 230 places in 301 ms of which 1 ms to minimize.
[2023-03-23 22:29:55] [INFO ] Deduced a trap composed of 232 places in 302 ms of which 0 ms to minimize.
[2023-03-23 22:29:55] [INFO ] Deduced a trap composed of 230 places in 301 ms of which 1 ms to minimize.
[2023-03-23 22:29:55] [INFO ] Deduced a trap composed of 232 places in 299 ms of which 1 ms to minimize.
[2023-03-23 22:29:56] [INFO ] Deduced a trap composed of 234 places in 304 ms of which 1 ms to minimize.
[2023-03-23 22:29:56] [INFO ] Deduced a trap composed of 224 places in 298 ms of which 1 ms to minimize.
[2023-03-23 22:29:56] [INFO ] Deduced a trap composed of 234 places in 300 ms of which 1 ms to minimize.
[2023-03-23 22:29:57] [INFO ] Deduced a trap composed of 224 places in 305 ms of which 3 ms to minimize.
[2023-03-23 22:29:58] [INFO ] Deduced a trap composed of 230 places in 291 ms of which 1 ms to minimize.
[2023-03-23 22:29:58] [INFO ] Deduced a trap composed of 232 places in 290 ms of which 1 ms to minimize.
[2023-03-23 22:29:58] [INFO ] Deduced a trap composed of 230 places in 299 ms of which 0 ms to minimize.
[2023-03-23 22:29:59] [INFO ] Deduced a trap composed of 236 places in 298 ms of which 0 ms to minimize.
[2023-03-23 22:30:00] [INFO ] Deduced a trap composed of 238 places in 288 ms of which 1 ms to minimize.
[2023-03-23 22:30:01] [INFO ] Deduced a trap composed of 228 places in 314 ms of which 0 ms to minimize.
[2023-03-23 22:30:01] [INFO ] Deduced a trap composed of 230 places in 338 ms of which 0 ms to minimize.
[2023-03-23 22:30:01] [INFO ] Deduced a trap composed of 230 places in 290 ms of which 1 ms to minimize.
[2023-03-23 22:30:02] [INFO ] Deduced a trap composed of 230 places in 333 ms of which 1 ms to minimize.
[2023-03-23 22:30:02] [INFO ] Deduced a trap composed of 228 places in 279 ms of which 0 ms to minimize.
[2023-03-23 22:30:02] [INFO ] Deduced a trap composed of 228 places in 286 ms of which 0 ms to minimize.
[2023-03-23 22:30:03] [INFO ] Deduced a trap composed of 228 places in 286 ms of which 1 ms to minimize.
[2023-03-23 22:30:04] [INFO ] Deduced a trap composed of 232 places in 296 ms of which 0 ms to minimize.
[2023-03-23 22:30:04] [INFO ] Deduced a trap composed of 228 places in 286 ms of which 1 ms to minimize.
[2023-03-23 22:30:05] [INFO ] Deduced a trap composed of 226 places in 276 ms of which 1 ms to minimize.
[2023-03-23 22:30:05] [INFO ] Deduced a trap composed of 234 places in 290 ms of which 0 ms to minimize.
[2023-03-23 22:30:06] [INFO ] Deduced a trap composed of 228 places in 296 ms of which 1 ms to minimize.
[2023-03-23 22:30:07] [INFO ] Deduced a trap composed of 226 places in 315 ms of which 0 ms to minimize.
[2023-03-23 22:30:07] [INFO ] Deduced a trap composed of 232 places in 305 ms of which 1 ms to minimize.
[2023-03-23 22:30:08] [INFO ] Deduced a trap composed of 226 places in 289 ms of which 0 ms to minimize.
[2023-03-23 22:30:08] [INFO ] Deduced a trap composed of 228 places in 291 ms of which 1 ms to minimize.
[2023-03-23 22:30:09] [INFO ] Deduced a trap composed of 234 places in 305 ms of which 0 ms to minimize.
[2023-03-23 22:30:09] [INFO ] Deduced a trap composed of 224 places in 307 ms of which 1 ms to minimize.
[2023-03-23 22:30:09] [INFO ] Deduced a trap composed of 222 places in 306 ms of which 1 ms to minimize.
[2023-03-23 22:30:10] [INFO ] Deduced a trap composed of 232 places in 302 ms of which 1 ms to minimize.
[2023-03-23 22:30:10] [INFO ] Deduced a trap composed of 226 places in 302 ms of which 0 ms to minimize.
[2023-03-23 22:30:10] [INFO ] Deduced a trap composed of 234 places in 325 ms of which 1 ms to minimize.
[2023-03-23 22:30:11] [INFO ] Deduced a trap composed of 228 places in 295 ms of which 1 ms to minimize.
[2023-03-23 22:30:11] [INFO ] Deduced a trap composed of 232 places in 295 ms of which 1 ms to minimize.
[2023-03-23 22:30:13] [INFO ] Deduced a trap composed of 236 places in 332 ms of which 1 ms to minimize.
[2023-03-23 22:33:06] [INFO ] Trap strengthening (SAT) tested/added 128/128 trap constraints in 224431 ms
[2023-03-23 22:33:06] [INFO ] After 224877ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-23 22:33:06] [INFO ] After 225018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
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((F(p0)&&F((G(p1)||G(p2))))))'
Support contains 5 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 654 transition count 1291
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 70 place count 620 transition count 1289
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 72 place count 618 transition count 1257
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 136 place count 586 transition count 1257
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 585 transition count 1256
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 585 transition count 1256
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 3 with 4 rules applied. Total rules applied 142 place count 583 transition count 1254
Applied a total of 142 rules in 141 ms. Remains 583 /664 variables (removed 81) and now considering 1254/1325 (removed 71) transitions.
[2023-03-23 22:33:06] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2023-03-23 22:33:06] [INFO ] Computed 82 place invariants in 20 ms
[2023-03-23 22:33:07] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
[2023-03-23 22:33:07] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-23 22:33:07] [INFO ] Invariant cache hit.
[2023-03-23 22:33:08] [INFO ] Implicit Places using invariants in 513 ms returned []
[2023-03-23 22:33:08] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-23 22:33:08] [INFO ] Invariant cache hit.
[2023-03-23 22:33:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:33:11] [INFO ] Implicit Places using invariants and state equation in 3375 ms returned []
Implicit Place search using SMT with State Equation took 3892 ms to find 0 implicit places.
[2023-03-23 22:33:11] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-23 22:33:11] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-23 22:33:11] [INFO ] Invariant cache hit.
[2023-03-23 22:33:12] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 583/664 places, 1254/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5356 ms. Remains : 583/664 places, 1254/1325 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s164 1) (LT s532 1)), p1:(AND (GEQ s578 1) (GEQ s581 1)), p2:(LT s579 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6837 reset in 1316 ms.
Product exploration explored 100000 steps with 6863 reset in 1183 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 p0 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X p0), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 9 factoid took 529 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 685 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 111 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 103 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 22:33:15] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-23 22:33:15] [INFO ] Invariant cache hit.
[2023-03-23 22:33:16] [INFO ] [Real]Absence check using 75 positive place invariants in 20 ms returned sat
[2023-03-23 22:33:16] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-23 22:33:16] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-23 22:33:16] [INFO ] [Nat]Absence check using 75 positive place invariants in 20 ms returned sat
[2023-03-23 22:33:16] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-23 22:33:25] [INFO ] After 9483ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-23 22:33:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:33:25] [INFO ] After 87ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-23 22:33:26] [INFO ] Deduced a trap composed of 267 places in 364 ms of which 1 ms to minimize.
[2023-03-23 22:33:26] [INFO ] Deduced a trap composed of 267 places in 368 ms of which 1 ms to minimize.
[2023-03-23 22:33:27] [INFO ] Deduced a trap composed of 275 places in 368 ms of which 1 ms to minimize.
[2023-03-23 22:33:27] [INFO ] Deduced a trap composed of 275 places in 354 ms of which 1 ms to minimize.
[2023-03-23 22:33:27] [INFO ] Deduced a trap composed of 275 places in 351 ms of which 1 ms to minimize.
[2023-03-23 22:33:28] [INFO ] Deduced a trap composed of 254 places in 346 ms of which 1 ms to minimize.
[2023-03-23 22:33:28] [INFO ] Deduced a trap composed of 283 places in 351 ms of which 1 ms to minimize.
[2023-03-23 22:33:29] [INFO ] Deduced a trap composed of 255 places in 366 ms of which 1 ms to minimize.
[2023-03-23 22:33:29] [INFO ] Deduced a trap composed of 267 places in 364 ms of which 0 ms to minimize.
[2023-03-23 22:33:29] [INFO ] Deduced a trap composed of 274 places in 356 ms of which 0 ms to minimize.
[2023-03-23 22:33:30] [INFO ] Deduced a trap composed of 271 places in 359 ms of which 1 ms to minimize.
[2023-03-23 22:33:30] [INFO ] Deduced a trap composed of 266 places in 362 ms of which 1 ms to minimize.
[2023-03-23 22:33:31] [INFO ] Deduced a trap composed of 263 places in 363 ms of which 1 ms to minimize.
[2023-03-23 22:33:32] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 6475 ms
[2023-03-23 22:33:32] [INFO ] After 6651ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-23 22:33:32] [INFO ] After 16431ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 1254/1254 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 583 transition count 1252
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 581 transition count 1252
Applied a total of 4 rules in 36 ms. Remains 581 /583 variables (removed 2) and now considering 1252/1254 (removed 2) transitions.
[2023-03-23 22:33:32] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 22:33:32] [INFO ] Computed 82 place invariants in 21 ms
[2023-03-23 22:33:33] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 733 ms. Remains : 581/583 places, 1252/1254 transitions.
Finished random walk after 263 steps, including 19 resets, run visited all 1 properties in 5 ms. (steps per millisecond=52 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X p0), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (AND p1 p2)), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 10 factoid took 679 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 5 out of 583 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 583/583 places, 1254/1254 transitions.
Applied a total of 0 rules in 31 ms. Remains 583 /583 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
[2023-03-23 22:33:34] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2023-03-23 22:33:34] [INFO ] Computed 82 place invariants in 15 ms
[2023-03-23 22:33:34] [INFO ] Dead Transitions using invariants and state equation in 660 ms found 0 transitions.
[2023-03-23 22:33:34] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-23 22:33:34] [INFO ] Invariant cache hit.
[2023-03-23 22:33:35] [INFO ] Implicit Places using invariants in 489 ms returned []
[2023-03-23 22:33:35] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-23 22:33:35] [INFO ] Invariant cache hit.
[2023-03-23 22:33:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:33:38] [INFO ] Implicit Places using invariants and state equation in 2832 ms returned []
Implicit Place search using SMT with State Equation took 3340 ms to find 0 implicit places.
[2023-03-23 22:33:38] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-23 22:33:38] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-23 22:33:38] [INFO ] Invariant cache hit.
[2023-03-23 22:33:39] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4768 ms. Remains : 583/583 places, 1254/1254 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 p0 (NOT p1) p2), (X p2), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 4 factoid took 251 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Finished random walk after 9003 steps, including 615 resets, run visited all 3 properties in 205 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p0)), (F (NOT p2)), (F p1)]
Knowledge based reduction with 4 factoid took 304 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 6850 reset in 1120 ms.
Product exploration explored 100000 steps with 6847 reset in 1093 ms.
Support contains 5 out of 583 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 583/583 places, 1254/1254 transitions.
Applied a total of 0 rules in 35 ms. Remains 583 /583 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
[2023-03-23 22:33:42] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-23 22:33:42] [INFO ] Invariant cache hit.
[2023-03-23 22:33:43] [INFO ] Dead Transitions using invariants and state equation in 671 ms found 0 transitions.
[2023-03-23 22:33:43] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-23 22:33:43] [INFO ] Invariant cache hit.
[2023-03-23 22:33:43] [INFO ] Implicit Places using invariants in 500 ms returned []
[2023-03-23 22:33:43] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-23 22:33:43] [INFO ] Invariant cache hit.
[2023-03-23 22:33:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:33:45] [INFO ] Implicit Places using invariants and state equation in 2172 ms returned []
Implicit Place search using SMT with State Equation took 2676 ms to find 0 implicit places.
[2023-03-23 22:33:45] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-23 22:33:45] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-23 22:33:45] [INFO ] Invariant cache hit.
[2023-03-23 22:33:46] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4042 ms. Remains : 583/583 places, 1254/1254 transitions.
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-00 finished in 40012 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)||G(p1)))'
Support contains 363 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
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 4 rules applied. Total rules applied 4 place count 664 transition count 1321
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 660 transition count 1321
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 8 place count 660 transition count 1286
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 78 place count 625 transition count 1286
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 624 transition count 1285
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 624 transition count 1285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 623 transition count 1284
Applied a total of 82 rules in 63 ms. Remains 623 /664 variables (removed 41) and now considering 1284/1325 (removed 41) transitions.
[2023-03-23 22:33:46] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
// Phase 1: matrix 1275 rows 623 cols
[2023-03-23 22:33:46] [INFO ] Computed 92 place invariants in 27 ms
[2023-03-23 22:33:47] [INFO ] Dead Transitions using invariants and state equation in 1002 ms found 0 transitions.
[2023-03-23 22:33:47] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
[2023-03-23 22:33:47] [INFO ] Invariant cache hit.
[2023-03-23 22:33:48] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-23 22:33:48] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
[2023-03-23 22:33:48] [INFO ] Invariant cache hit.
[2023-03-23 22:33:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:33:50] [INFO ] Implicit Places using invariants and state equation in 2642 ms returned []
Implicit Place search using SMT with State Equation took 3010 ms to find 0 implicit places.
[2023-03-23 22:33:50] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-23 22:33:50] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
[2023-03-23 22:33:50] [INFO ] Invariant cache hit.
[2023-03-23 22:33:51] [INFO ] Dead Transitions using invariants and state equation in 1037 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 623/664 places, 1284/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5143 ms. Remains : 623/664 places, 1284/1325 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (AND (GEQ s496 1) (GEQ s617 1)) (AND (GEQ s284 1) (GEQ s596 1)) (AND (GEQ s225 1) (GEQ s590 1)) (AND (GEQ s343 1) (GEQ s602 1)) (AND (GEQ s319 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-01 finished in 5262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 12 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1290
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 619 transition count 1256
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 585 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 584 transition count 1255
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 584 transition count 1255
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 144 place count 582 transition count 1253
Applied a total of 144 rules in 68 ms. Remains 582 /664 variables (removed 82) and now considering 1253/1325 (removed 72) transitions.
[2023-03-23 22:33:52] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2023-03-23 22:33:52] [INFO ] Computed 82 place invariants in 23 ms
[2023-03-23 22:33:52] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
[2023-03-23 22:33:52] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-23 22:33:52] [INFO ] Invariant cache hit.
[2023-03-23 22:33:53] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-03-23 22:33:53] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-23 22:33:53] [INFO ] Invariant cache hit.
[2023-03-23 22:33:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:33:55] [INFO ] Implicit Places using invariants and state equation in 2631 ms returned []
Implicit Place search using SMT with State Equation took 3085 ms to find 0 implicit places.
[2023-03-23 22:33:55] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-23 22:33:55] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-23 22:33:55] [INFO ] Invariant cache hit.
[2023-03-23 22:33:56] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/664 places, 1253/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4545 ms. Remains : 582/664 places, 1253/1325 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s199 1) (GEQ s202 1) (GEQ s206 1) (GEQ s210 8)) (AND (GEQ s199 1) (GEQ s200 1) (GEQ s202 1) (GEQ s210 8)) (AND (GEQ s199 1) (GEQ s201 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-02 finished in 4612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 654 transition count 1292
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 621 transition count 1291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 620 transition count 1291
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 68 place count 620 transition count 1257
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 136 place count 586 transition count 1257
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 585 transition count 1256
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 585 transition count 1256
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 584 transition count 1255
Applied a total of 140 rules in 87 ms. Remains 584 /664 variables (removed 80) and now considering 1255/1325 (removed 70) transitions.
[2023-03-23 22:33:56] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
// Phase 1: matrix 1246 rows 584 cols
[2023-03-23 22:33:56] [INFO ] Computed 82 place invariants in 25 ms
[2023-03-23 22:33:57] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
[2023-03-23 22:33:57] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
[2023-03-23 22:33:57] [INFO ] Invariant cache hit.
[2023-03-23 22:33:57] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-23 22:33:57] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
[2023-03-23 22:33:57] [INFO ] Invariant cache hit.
[2023-03-23 22:33:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:34:01] [INFO ] Implicit Places using invariants and state equation in 3179 ms returned []
Implicit Place search using SMT with State Equation took 3696 ms to find 0 implicit places.
[2023-03-23 22:34:01] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-23 22:34:01] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
[2023-03-23 22:34:01] [INFO ] Invariant cache hit.
[2023-03-23 22:34:01] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 584/664 places, 1255/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5076 ms. Remains : 584/664 places, 1255/1325 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s581 1) (LT s580 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-03 finished in 5170 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&&G((p1 U !p2)))))'
Support contains 36 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 619 transition count 1289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 72 place count 618 transition count 1255
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 140 place count 584 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 583 transition count 1254
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 583 transition count 1254
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 3 with 4 rules applied. Total rules applied 146 place count 581 transition count 1252
Applied a total of 146 rules in 83 ms. Remains 581 /664 variables (removed 83) and now considering 1252/1325 (removed 73) transitions.
[2023-03-23 22:34:01] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 22:34:01] [INFO ] Computed 82 place invariants in 22 ms
[2023-03-23 22:34:02] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
[2023-03-23 22:34:02] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 22:34:02] [INFO ] Invariant cache hit.
[2023-03-23 22:34:03] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-23 22:34:03] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 22:34:03] [INFO ] Invariant cache hit.
[2023-03-23 22:34:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:34:06] [INFO ] Implicit Places using invariants and state equation in 3144 ms returned []
Implicit Place search using SMT with State Equation took 3631 ms to find 0 implicit places.
[2023-03-23 22:34:06] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-23 22:34:06] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 22:34:06] [INFO ] Invariant cache hit.
[2023-03-23 22:34:06] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/664 places, 1252/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5084 ms. Remains : 581/664 places, 1252/1325 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) p2), p2, p2]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p0 p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(OR (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s35 1) (GEQ s163 1)) (AND (GEQ s0 1) (GEQ s45 1) (GEQ s163 1)) (AND (GEQ s0 1) (GEQ s55 1) (GEQ s163 1)) (AND (GEQ s0 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-04 finished in 5240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||(F(p2)&&X(p1))))'
Support contains 54 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 23 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-23 22:34:07] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2023-03-23 22:34:07] [INFO ] Computed 82 place invariants in 32 ms
[2023-03-23 22:34:07] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
[2023-03-23 22:34:08] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:34:08] [INFO ] Invariant cache hit.
[2023-03-23 22:34:08] [INFO ] Implicit Places using invariants in 444 ms returned []
[2023-03-23 22:34:08] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:34:08] [INFO ] Invariant cache hit.
[2023-03-23 22:34:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:34:10] [INFO ] Implicit Places using invariants and state equation in 2287 ms returned []
Implicit Place search using SMT with State Equation took 2736 ms to find 0 implicit places.
[2023-03-23 22:34:10] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:34:10] [INFO ] Invariant cache hit.
[2023-03-23 22:34:11] [INFO ] Dead Transitions using invariants and state equation in 879 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4541 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p1), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (AND (GEQ s203 1) (GEQ s208 1) (GEQ s209 1) (GEQ s210 1) (GEQ s214 7)) (AND (GEQ s203 1) (GEQ s204 1) (GEQ s205 1) (GEQ s213 1) (GEQ s214 7)) (AND ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-07 finished in 4825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 654 transition count 1291
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 620 transition count 1291
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 68 place count 620 transition count 1255
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 140 place count 584 transition count 1255
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 144 place count 582 transition count 1253
Applied a total of 144 rules in 56 ms. Remains 582 /664 variables (removed 82) and now considering 1253/1325 (removed 72) transitions.
[2023-03-23 22:34:11] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2023-03-23 22:34:11] [INFO ] Computed 82 place invariants in 19 ms
[2023-03-23 22:34:12] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
[2023-03-23 22:34:12] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-23 22:34:12] [INFO ] Invariant cache hit.
[2023-03-23 22:34:13] [INFO ] Implicit Places using invariants in 508 ms returned []
[2023-03-23 22:34:13] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-23 22:34:13] [INFO ] Invariant cache hit.
[2023-03-23 22:34:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:34:16] [INFO ] Implicit Places using invariants and state equation in 3388 ms returned []
Implicit Place search using SMT with State Equation took 3898 ms to find 0 implicit places.
[2023-03-23 22:34:16] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-23 22:34:16] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-23 22:34:16] [INFO ] Invariant cache hit.
[2023-03-23 22:34:17] [INFO ] Dead Transitions using invariants and state equation in 663 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/664 places, 1253/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5334 ms. Remains : 582/664 places, 1253/1325 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s581 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7604 reset in 1087 ms.
Product exploration explored 100000 steps with 7583 reset in 1058 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 53 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 1253/1253 transitions.
Applied a total of 0 rules in 24 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2023-03-23 22:34:20] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-23 22:34:20] [INFO ] Invariant cache hit.
[2023-03-23 22:34:20] [INFO ] Dead Transitions using invariants and state equation in 694 ms found 0 transitions.
[2023-03-23 22:34:20] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-23 22:34:20] [INFO ] Invariant cache hit.
[2023-03-23 22:34:21] [INFO ] Implicit Places using invariants in 509 ms returned []
[2023-03-23 22:34:21] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-23 22:34:21] [INFO ] Invariant cache hit.
[2023-03-23 22:34:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:34:24] [INFO ] Implicit Places using invariants and state equation in 3381 ms returned []
Implicit Place search using SMT with State Equation took 3894 ms to find 0 implicit places.
[2023-03-23 22:34:24] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-23 22:34:24] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-23 22:34:24] [INFO ] Invariant cache hit.
[2023-03-23 22:34:25] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5290 ms. Remains : 582/582 places, 1253/1253 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 26 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7657 reset in 1044 ms.
Product exploration explored 100000 steps with 7541 reset in 1052 ms.
Support contains 1 out of 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 1253/1253 transitions.
Applied a total of 0 rules in 21 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2023-03-23 22:34:28] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-23 22:34:28] [INFO ] Invariant cache hit.
[2023-03-23 22:34:28] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
[2023-03-23 22:34:28] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-23 22:34:28] [INFO ] Invariant cache hit.
[2023-03-23 22:34:29] [INFO ] Implicit Places using invariants in 506 ms returned []
[2023-03-23 22:34:29] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-23 22:34:29] [INFO ] Invariant cache hit.
[2023-03-23 22:34:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:34:32] [INFO ] Implicit Places using invariants and state equation in 3248 ms returned []
Implicit Place search using SMT with State Equation took 3756 ms to find 0 implicit places.
[2023-03-23 22:34:32] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-23 22:34:32] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-23 22:34:32] [INFO ] Invariant cache hit.
[2023-03-23 22:34:33] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5159 ms. Remains : 582/582 places, 1253/1253 transitions.
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-08 finished in 21404 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)))'
Support contains 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 27 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-23 22:34:33] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2023-03-23 22:34:33] [INFO ] Computed 82 place invariants in 25 ms
[2023-03-23 22:34:34] [INFO ] Dead Transitions using invariants and state equation in 863 ms found 0 transitions.
[2023-03-23 22:34:34] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:34:34] [INFO ] Invariant cache hit.
[2023-03-23 22:34:34] [INFO ] Implicit Places using invariants in 561 ms returned []
[2023-03-23 22:34:34] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:34:34] [INFO ] Invariant cache hit.
[2023-03-23 22:34:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:34:38] [INFO ] Implicit Places using invariants and state equation in 3605 ms returned []
Implicit Place search using SMT with State Equation took 4168 ms to find 0 implicit places.
[2023-03-23 22:34:38] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:34:38] [INFO ] Invariant cache hit.
[2023-03-23 22:34:39] [INFO ] Dead Transitions using invariants and state equation in 834 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5892 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s198 4) (GEQ s197 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-09 finished in 6002 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(((!p0||X(F((!p0 U (p1||G(!p0)))))) U X(G(p2)))))'
Support contains 36 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 23 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-23 22:34:39] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:34:39] [INFO ] Invariant cache hit.
[2023-03-23 22:34:40] [INFO ] Dead Transitions using invariants and state equation in 835 ms found 0 transitions.
[2023-03-23 22:34:40] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:34:40] [INFO ] Invariant cache hit.
[2023-03-23 22:34:40] [INFO ] Implicit Places using invariants in 507 ms returned []
[2023-03-23 22:34:40] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:34:40] [INFO ] Invariant cache hit.
[2023-03-23 22:34:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:34:43] [INFO ] Implicit Places using invariants and state equation in 3013 ms returned []
Implicit Place search using SMT with State Equation took 3523 ms to find 0 implicit places.
[2023-03-23 22:34:43] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:34:43] [INFO ] Invariant cache hit.
[2023-03-23 22:34:44] [INFO ] Dead Transitions using invariants and state equation in 881 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5274 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s200 2), p0:(OR (AND (GEQ s32 1) (GEQ s98 1) (GEQ s130 1)) (AND (GEQ s32 1) (GEQ s98 1) (GEQ s131 1)) (AND (GEQ s32 1) (GEQ s98 1) (GEQ s132 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-10 finished in 5477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 33 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 654 transition count 1289
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 618 transition count 1254
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 142 place count 583 transition count 1254
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 582 transition count 1253
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 582 transition count 1253
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 148 place count 580 transition count 1251
Applied a total of 148 rules in 61 ms. Remains 580 /664 variables (removed 84) and now considering 1251/1325 (removed 74) transitions.
[2023-03-23 22:34:44] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2023-03-23 22:34:44] [INFO ] Computed 82 place invariants in 22 ms
[2023-03-23 22:34:45] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
[2023-03-23 22:34:45] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-23 22:34:45] [INFO ] Invariant cache hit.
[2023-03-23 22:34:46] [INFO ] Implicit Places using invariants in 476 ms returned []
[2023-03-23 22:34:46] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-23 22:34:46] [INFO ] Invariant cache hit.
[2023-03-23 22:34:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:34:48] [INFO ] Implicit Places using invariants and state equation in 2781 ms returned []
Implicit Place search using SMT with State Equation took 3259 ms to find 0 implicit places.
[2023-03-23 22:34:48] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-23 22:34:48] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-23 22:34:48] [INFO ] Invariant cache hit.
[2023-03-23 22:34:49] [INFO ] Dead Transitions using invariants and state equation in 648 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 580/664 places, 1251/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4687 ms. Remains : 580/664 places, 1251/1325 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s197 2) (AND (GEQ s191 1) (GEQ s579 1)) (AND (GEQ s186 1) (GEQ s579 1)) (AND (GEQ s167 1) (GEQ s579 1)) (AND (GEQ s172 1) (GEQ s579 1)) (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-12 finished in 4741 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&&F(p1)))))'
Support contains 43 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 23 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-23 22:34:49] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2023-03-23 22:34:49] [INFO ] Computed 82 place invariants in 21 ms
[2023-03-23 22:34:50] [INFO ] Dead Transitions using invariants and state equation in 878 ms found 0 transitions.
[2023-03-23 22:34:50] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:34:50] [INFO ] Invariant cache hit.
[2023-03-23 22:34:50] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-23 22:34:50] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:34:50] [INFO ] Invariant cache hit.
[2023-03-23 22:34:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:34:55] [INFO ] Implicit Places using invariants and state equation in 4133 ms returned []
Implicit Place search using SMT with State Equation took 4622 ms to find 0 implicit places.
[2023-03-23 22:34:55] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:34:55] [INFO ] Invariant cache hit.
[2023-03-23 22:34:55] [INFO ] Dead Transitions using invariants and state equation in 889 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6418 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-14 finished in 6579 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(G(p0)))'
Support contains 1 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1290
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 619 transition count 1255
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 584 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 583 transition count 1254
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 583 transition count 1254
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 146 place count 581 transition count 1252
Applied a total of 146 rules in 67 ms. Remains 581 /664 variables (removed 83) and now considering 1252/1325 (removed 73) transitions.
[2023-03-23 22:34:56] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 22:34:56] [INFO ] Computed 82 place invariants in 26 ms
[2023-03-23 22:34:56] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
[2023-03-23 22:34:56] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 22:34:56] [INFO ] Invariant cache hit.
[2023-03-23 22:34:57] [INFO ] Implicit Places using invariants in 520 ms returned []
[2023-03-23 22:34:57] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 22:34:57] [INFO ] Invariant cache hit.
[2023-03-23 22:34:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:35:00] [INFO ] Implicit Places using invariants and state equation in 3211 ms returned []
Implicit Place search using SMT with State Equation took 3734 ms to find 0 implicit places.
[2023-03-23 22:35:00] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-23 22:35:00] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 22:35:00] [INFO ] Invariant cache hit.
[2023-03-23 22:35:01] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/664 places, 1252/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5153 ms. Remains : 581/664 places, 1252/1325 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s198 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-15 finished in 5204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-23 22:35:01] [INFO ] Flatten gal took : 101 ms
[2023-03-23 22:35:01] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-23 22:35:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 664 places, 1325 transitions and 8384 arcs took 9 ms.
Total runtime 433342 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2205/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2205/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PolyORBNT-COL-S10J30-LTLFireability-00
Could not compute solution for formula : PolyORBNT-COL-S10J30-LTLFireability-08

BK_STOP 1679610903490

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name PolyORBNT-COL-S10J30-LTLFireability-00
ltl formula formula --ltl=/tmp/2205/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 1325 transitions and 8384 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.060 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2205/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2205/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2205/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2205/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55d958dee3f4]
1: pnml2lts-mc(+0xa2496) [0x55d958dee496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f8e258ee140]
3: pnml2lts-mc(+0x405be5) [0x55d959151be5]
4: pnml2lts-mc(+0x16b3f9) [0x55d958eb73f9]
5: pnml2lts-mc(+0x164ac4) [0x55d958eb0ac4]
6: pnml2lts-mc(+0x272e0a) [0x55d958fbee0a]
7: pnml2lts-mc(+0xb61f0) [0x55d958e021f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f8e257414d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f8e2574167a]
10: pnml2lts-mc(+0xa1581) [0x55d958ded581]
11: pnml2lts-mc(+0xa1910) [0x55d958ded910]
12: pnml2lts-mc(+0xa32a2) [0x55d958def2a2]
13: pnml2lts-mc(+0xa50f4) [0x55d958df10f4]
14: pnml2lts-mc(+0xa516b) [0x55d958df116b]
15: pnml2lts-mc(+0x3f34b3) [0x55d95913f4b3]
16: pnml2lts-mc(+0x7c63d) [0x55d958dc863d]
17: pnml2lts-mc(+0x67d86) [0x55d958db3d86]
18: pnml2lts-mc(+0x60a8a) [0x55d958daca8a]
19: pnml2lts-mc(+0x5eb15) [0x55d958daab15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f8e25729d0a]
21: pnml2lts-mc(+0x6075e) [0x55d958dac75e]
ltl formula name PolyORBNT-COL-S10J30-LTLFireability-08
ltl formula formula --ltl=/tmp/2205/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 1325 transitions and 8384 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.060 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2205/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2205/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2205/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2205/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is PolyORBNT-COL-S10J30, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873950800684"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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