About the Execution of LTSMin+red for PolyORBNT-COL-S05J80
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 875.348 | 453577.00 | 494662.00 | 1607.30 | FFF??FFFFF?FFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950800668.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-S05J80, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950800668
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 23:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 23:45 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.6K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 16K Feb 26 00:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 00:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:58 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 94K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-00
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-01
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-02
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-03
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-04
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-05
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-06
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-07
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-08
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-09
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-10
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-11
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-12
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-13
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-14
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679604780200
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-S05J80
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 20:53:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 20:53:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 20:53:02] [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 20:53:02] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-23 20:53:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 631 ms
[2023-03-23 20:53:02] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1269 PT places and 2592.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-03-23 20:53:03] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 13 ms.
[2023-03-23 20:53:03] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 7 formulas.
FORMULA PolyORBNT-COL-S05J80-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 6 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 800 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 10000 steps, including 149 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10000 steps, including 250 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 38 rows 48 cols
[2023-03-23 20:53:03] [INFO ] Computed 13 place invariants in 14 ms
[2023-03-23 20:53:03] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-23 20:53:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-23 20:53:03] [INFO ] After 60ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 20:53:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:53:03] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-23 20:53:03] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 5 ms to minimize.
[2023-03-23 20:53:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-23 20:53:03] [INFO ] After 61ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 20:53:03] [INFO ] After 364ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 20:53:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:53:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 20:53:03] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 20:53:03] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 20:53:03] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2023-03-23 20:53:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-23 20:53:03] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-23 20:53:03] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 43 transition count 31
Deduced a syphon composed of 3 places in 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 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 39 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 39 transition count 30
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 23 place count 36 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 25 place count 35 transition count 27
Applied a total of 25 rules in 21 ms. Remains 35 /48 variables (removed 13) and now considering 27/38 (removed 11) transitions.
// Phase 1: matrix 27 rows 35 cols
[2023-03-23 20:53:04] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-23 20:53:04] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 35/48 places, 27/38 transitions.
Incomplete random walk after 10000 steps, including 1177 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 336 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Probably explored full state space saw : 361 states, properties seen :0
Probabilistic random walk after 961 steps, saw 361 distinct states, run finished after 25 ms. (steps per millisecond=38 ) properties seen :0
Explored full state space saw : 361 states, properties seen :0
Exhaustive walk after 961 steps, saw 361 distinct states, run finished after 4 ms. (steps per millisecond=240 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
[2023-03-23 20:53:04] [INFO ] Flatten gal took : 23 ms
[2023-03-23 20:53:04] [INFO ] Flatten gal took : 8 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 20:53:04] [INFO ] Unfolded HLPN to a Petri net with 1269 places and 2430 transitions 14624 arcs in 51 ms.
[2023-03-23 20:53:04] [INFO ] Unfolded 9 HLPN properties in 1 ms.
[2023-03-23 20:53:04] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-23 20:53:04] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-23 20:53:04] [INFO ] Reduced 10 identical enabling conditions.
[2023-03-23 20:53:04] [INFO ] Reduced 555 identical enabling conditions.
Deduced a syphon composed of 80 places in 13 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 602 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1188 transition count 1694
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1188 transition count 1694
Applied a total of 2 rules in 103 ms. Remains 1188 /1189 variables (removed 1) and now considering 1694/1695 (removed 1) transitions.
[2023-03-23 20:53:04] [INFO ] Flow matrix only has 1690 transitions (discarded 4 similar events)
// Phase 1: matrix 1690 rows 1188 cols
[2023-03-23 20:53:04] [INFO ] Computed 182 place invariants in 154 ms
[2023-03-23 20:53:06] [INFO ] Dead Transitions using invariants and state equation in 1937 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2023-03-23 20:53:06] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1188 cols
[2023-03-23 20:53:06] [INFO ] Computed 182 place invariants in 87 ms
[2023-03-23 20:53:07] [INFO ] Implicit Places using invariants in 1050 ms returned []
[2023-03-23 20:53:07] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:53:07] [INFO ] Invariant cache hit.
[2023-03-23 20:53:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:53:15] [INFO ] Implicit Places using invariants and state equation in 8299 ms returned []
Implicit Place search using SMT with State Equation took 9362 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1188/1189 places, 1599/1695 transitions.
Applied a total of 0 rules in 30 ms. Remains 1188 /1188 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11448 ms. Remains : 1188/1189 places, 1599/1695 transitions.
Support contains 602 out of 1188 places after structural reductions.
[2023-03-23 20:53:16] [INFO ] Flatten gal took : 180 ms
[2023-03-23 20:53:16] [INFO ] Flatten gal took : 170 ms
[2023-03-23 20:53:16] [INFO ] Input system was already deterministic with 1599 transitions.
Incomplete random walk after 10000 steps, including 670 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 19) seen :16
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-23 20:53:17] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:53:17] [INFO ] Invariant cache hit.
[2023-03-23 20:53:17] [INFO ] [Real]Absence check using 175 positive place invariants in 56 ms returned sat
[2023-03-23 20:53:17] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 37 ms returned sat
[2023-03-23 20:53:17] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 20:53:17] [INFO ] [Nat]Absence check using 175 positive place invariants in 54 ms returned sat
[2023-03-23 20:53:17] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 34 ms returned sat
[2023-03-23 20:53:18] [INFO ] After 864ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 20:53:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:53:18] [INFO ] After 266ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 20:53:19] [INFO ] Deduced a trap composed of 486 places in 503 ms of which 2 ms to minimize.
[2023-03-23 20:53:20] [INFO ] Deduced a trap composed of 501 places in 529 ms of which 3 ms to minimize.
[2023-03-23 20:53:21] [INFO ] Deduced a trap composed of 501 places in 539 ms of which 1 ms to minimize.
[2023-03-23 20:53:21] [INFO ] Deduced a trap composed of 492 places in 546 ms of which 2 ms to minimize.
[2023-03-23 20:53:22] [INFO ] Deduced a trap composed of 498 places in 544 ms of which 2 ms to minimize.
[2023-03-23 20:53:23] [INFO ] Deduced a trap composed of 495 places in 530 ms of which 1 ms to minimize.
[2023-03-23 20:53:24] [INFO ] Deduced a trap composed of 489 places in 553 ms of which 1 ms to minimize.
[2023-03-23 20:53:24] [INFO ] Deduced a trap composed of 492 places in 521 ms of which 1 ms to minimize.
[2023-03-23 20:53:25] [INFO ] Deduced a trap composed of 471 places in 512 ms of which 2 ms to minimize.
[2023-03-23 20:53:25] [INFO ] Deduced a trap composed of 495 places in 510 ms of which 1 ms to minimize.
[2023-03-23 20:53:26] [INFO ] Deduced a trap composed of 471 places in 535 ms of which 1 ms to minimize.
[2023-03-23 20:53:27] [INFO ] Deduced a trap composed of 489 places in 536 ms of which 1 ms to minimize.
[2023-03-23 20:53:28] [INFO ] Deduced a trap composed of 492 places in 569 ms of which 1 ms to minimize.
[2023-03-23 20:53:29] [INFO ] Deduced a trap composed of 498 places in 518 ms of which 1 ms to minimize.
[2023-03-23 20:53:30] [INFO ] Deduced a trap composed of 486 places in 548 ms of which 1 ms to minimize.
[2023-03-23 20:53:31] [INFO ] Deduced a trap composed of 513 places in 544 ms of which 1 ms to minimize.
[2023-03-23 20:53:31] [INFO ] Deduced a trap composed of 477 places in 539 ms of which 4 ms to minimize.
[2023-03-23 20:53:32] [INFO ] Deduced a trap composed of 504 places in 548 ms of which 1 ms to minimize.
[2023-03-23 20:53:33] [INFO ] Deduced a trap composed of 501 places in 539 ms of which 2 ms to minimize.
[2023-03-23 20:53:33] [INFO ] Deduced a trap composed of 498 places in 538 ms of which 1 ms to minimize.
[2023-03-23 20:53:34] [INFO ] Deduced a trap composed of 483 places in 495 ms of which 2 ms to minimize.
[2023-03-23 20:53:34] [INFO ] Deduced a trap composed of 492 places in 537 ms of which 1 ms to minimize.
[2023-03-23 20:53:37] [INFO ] Deduced a trap composed of 522 places in 545 ms of which 2 ms to minimize.
[2023-03-23 20:53:37] [INFO ] Deduced a trap composed of 492 places in 512 ms of which 1 ms to minimize.
[2023-03-23 20:53:38] [INFO ] Deduced a trap composed of 495 places in 562 ms of which 1 ms to minimize.
[2023-03-23 20:53:38] [INFO ] Deduced a trap composed of 492 places in 519 ms of which 1 ms to minimize.
[2023-03-23 20:53:39] [INFO ] Deduced a trap composed of 504 places in 489 ms of which 1 ms to minimize.
[2023-03-23 20:53:40] [INFO ] Deduced a trap composed of 492 places in 522 ms of which 2 ms to minimize.
[2023-03-23 20:53:40] [INFO ] Deduced a trap composed of 489 places in 512 ms of which 1 ms to minimize.
[2023-03-23 20:53:41] [INFO ] Deduced a trap composed of 486 places in 543 ms of which 2 ms to minimize.
[2023-03-23 20:53:42] [INFO ] Deduced a trap composed of 489 places in 531 ms of which 2 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 20:53:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 20:53:42] [INFO ] After 25339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 5 ms.
Support contains 82 out of 1188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 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 9 rules applied. Total rules applied 9 place count 1183 transition count 1595
Reduce places removed 4 places and 0 transitions.
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Iterating post reduction 1 with 85 rules applied. Total rules applied 94 place count 1179 transition count 1514
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 2 with 81 rules applied. Total rules applied 175 place count 1098 transition count 1514
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 175 place count 1098 transition count 1510
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 183 place count 1094 transition count 1510
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 189 place count 1091 transition count 1507
Applied a total of 189 rules in 229 ms. Remains 1091 /1188 variables (removed 97) and now considering 1507/1599 (removed 92) transitions.
[2023-03-23 20:53:43] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
// Phase 1: matrix 1503 rows 1091 cols
[2023-03-23 20:53:43] [INFO ] Computed 177 place invariants in 38 ms
[2023-03-23 20:53:44] [INFO ] Dead Transitions using invariants and state equation in 1583 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1814 ms. Remains : 1091/1188 places, 1507/1599 transitions.
Incomplete random walk after 10000 steps, including 502 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 223456 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 223456 steps, saw 65889 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 20:53:47] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
[2023-03-23 20:53:47] [INFO ] Invariant cache hit.
[2023-03-23 20:53:48] [INFO ] [Real]Absence check using 171 positive place invariants in 48 ms returned sat
[2023-03-23 20:53:48] [INFO ] [Real]Absence check using 171 positive and 6 generalized place invariants in 23 ms returned sat
[2023-03-23 20:53:48] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 20:53:48] [INFO ] [Nat]Absence check using 171 positive place invariants in 46 ms returned sat
[2023-03-23 20:53:48] [INFO ] [Nat]Absence check using 171 positive and 6 generalized place invariants in 24 ms returned sat
[2023-03-23 20:53:49] [INFO ] After 881ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 20:53:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:53:50] [INFO ] After 1255ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 20:53:51] [INFO ] Deduced a trap composed of 384 places in 482 ms of which 3 ms to minimize.
[2023-03-23 20:53:52] [INFO ] Deduced a trap composed of 393 places in 427 ms of which 1 ms to minimize.
[2023-03-23 20:53:52] [INFO ] Deduced a trap composed of 381 places in 455 ms of which 1 ms to minimize.
[2023-03-23 20:53:53] [INFO ] Deduced a trap composed of 402 places in 439 ms of which 1 ms to minimize.
[2023-03-23 20:53:54] [INFO ] Deduced a trap composed of 378 places in 453 ms of which 1 ms to minimize.
[2023-03-23 20:53:54] [INFO ] Deduced a trap composed of 402 places in 441 ms of which 2 ms to minimize.
[2023-03-23 20:53:55] [INFO ] Deduced a trap composed of 378 places in 448 ms of which 1 ms to minimize.
[2023-03-23 20:53:55] [INFO ] Deduced a trap composed of 396 places in 445 ms of which 1 ms to minimize.
[2023-03-23 20:53:56] [INFO ] Deduced a trap composed of 384 places in 451 ms of which 1 ms to minimize.
[2023-03-23 20:53:57] [INFO ] Deduced a trap composed of 381 places in 380 ms of which 1 ms to minimize.
[2023-03-23 20:53:57] [INFO ] Deduced a trap composed of 384 places in 464 ms of which 1 ms to minimize.
[2023-03-23 20:53:58] [INFO ] Deduced a trap composed of 372 places in 466 ms of which 1 ms to minimize.
[2023-03-23 20:53:58] [INFO ] Deduced a trap composed of 396 places in 489 ms of which 1 ms to minimize.
[2023-03-23 20:53:59] [INFO ] Deduced a trap composed of 375 places in 453 ms of which 1 ms to minimize.
[2023-03-23 20:54:00] [INFO ] Deduced a trap composed of 378 places in 487 ms of which 1 ms to minimize.
[2023-03-23 20:54:00] [INFO ] Deduced a trap composed of 384 places in 472 ms of which 1 ms to minimize.
[2023-03-23 20:54:01] [INFO ] Deduced a trap composed of 387 places in 493 ms of which 2 ms to minimize.
[2023-03-23 20:54:02] [INFO ] Deduced a trap composed of 402 places in 472 ms of which 1 ms to minimize.
[2023-03-23 20:54:02] [INFO ] Deduced a trap composed of 399 places in 488 ms of which 1 ms to minimize.
[2023-03-23 20:54:03] [INFO ] Deduced a trap composed of 396 places in 460 ms of which 1 ms to minimize.
[2023-03-23 20:54:06] [INFO ] Deduced a trap composed of 363 places in 447 ms of which 1 ms to minimize.
[2023-03-23 20:54:13] [INFO ] Trap strengthening (SAT) tested/added 21/21 trap constraints in 21877 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
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 20:54:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 20:54:13] [INFO ] After 25015ms 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 82 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 1507/1507 transitions.
Applied a total of 0 rules in 69 ms. Remains 1091 /1091 variables (removed 0) and now considering 1507/1507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1091/1091 places, 1507/1507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 1507/1507 transitions.
Applied a total of 0 rules in 56 ms. Remains 1091 /1091 variables (removed 0) and now considering 1507/1507 (removed 0) transitions.
[2023-03-23 20:54:13] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
[2023-03-23 20:54:13] [INFO ] Invariant cache hit.
[2023-03-23 20:54:14] [INFO ] Implicit Places using invariants in 1547 ms returned []
[2023-03-23 20:54:14] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
[2023-03-23 20:54:14] [INFO ] Invariant cache hit.
[2023-03-23 20:54:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:54:27] [INFO ] Implicit Places using invariants and state equation in 12345 ms returned []
Implicit Place search using SMT with State Equation took 13911 ms to find 0 implicit places.
[2023-03-23 20:54:27] [INFO ] Redundant transitions in 94 ms returned []
[2023-03-23 20:54:27] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
[2023-03-23 20:54:27] [INFO ] Invariant cache hit.
[2023-03-23 20:54:28] [INFO ] Dead Transitions using invariants and state equation in 1468 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15541 ms. Remains : 1091/1091 places, 1507/1507 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1091 transition count 1503
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 1091 transition count 1502
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 1090 transition count 1502
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1090 transition count 1501
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 1089 transition count 1501
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 1089 transition count 1496
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 1084 transition count 1496
Applied a total of 18 rules in 185 ms. Remains 1084 /1091 variables (removed 7) and now considering 1496/1507 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1496 rows 1084 cols
[2023-03-23 20:54:29] [INFO ] Computed 177 place invariants in 29 ms
[2023-03-23 20:54:29] [INFO ] [Real]Absence check using 171 positive place invariants in 43 ms returned sat
[2023-03-23 20:54:29] [INFO ] [Real]Absence check using 171 positive and 6 generalized place invariants in 22 ms returned sat
[2023-03-23 20:54:29] [INFO ] After 352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 20:54:29] [INFO ] [Nat]Absence check using 171 positive place invariants in 45 ms returned sat
[2023-03-23 20:54:29] [INFO ] [Nat]Absence check using 171 positive and 6 generalized place invariants in 22 ms returned sat
[2023-03-23 20:54:36] [INFO ] After 6935ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 20:54:37] [INFO ] Deduced a trap composed of 385 places in 495 ms of which 1 ms to minimize.
[2023-03-23 20:54:37] [INFO ] Deduced a trap composed of 385 places in 486 ms of which 11 ms to minimize.
[2023-03-23 20:54:38] [INFO ] Deduced a trap composed of 400 places in 504 ms of which 1 ms to minimize.
[2023-03-23 20:54:39] [INFO ] Deduced a trap composed of 376 places in 509 ms of which 1 ms to minimize.
[2023-03-23 20:54:39] [INFO ] Deduced a trap composed of 397 places in 509 ms of which 1 ms to minimize.
[2023-03-23 20:54:41] [INFO ] Deduced a trap composed of 385 places in 484 ms of which 1 ms to minimize.
[2023-03-23 20:54:50] [INFO ] Trap strengthening (SAT) tested/added 6/6 trap constraints in 13844 ms
[2023-03-23 20:54:50] [INFO ] After 20932ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-23 20:54:50] [INFO ] After 21164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
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' '!(X(F((((!p1||X(p1)) U p2)||p0))))'
Support contains 82 out of 1188 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1183 transition count 1599
Applied a total of 5 rules in 25 ms. Remains 1183 /1188 variables (removed 5) and now considering 1599/1599 (removed 0) transitions.
[2023-03-23 20:54:50] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2023-03-23 20:54:50] [INFO ] Computed 177 place invariants in 35 ms
[2023-03-23 20:54:52] [INFO ] Dead Transitions using invariants and state equation in 1889 ms found 0 transitions.
[2023-03-23 20:54:52] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:54:52] [INFO ] Invariant cache hit.
[2023-03-23 20:54:54] [INFO ] Implicit Places using invariants in 1763 ms returned []
[2023-03-23 20:54:54] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:54:54] [INFO ] Invariant cache hit.
[2023-03-23 20:54:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:55:06] [INFO ] Implicit Places using invariants and state equation in 11665 ms returned []
Implicit Place search using SMT with State Equation took 13432 ms to find 0 implicit places.
[2023-03-23 20:55:06] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:55:06] [INFO ] Invariant cache hit.
[2023-03-23 20:55:07] [INFO ] Dead Transitions using invariants and state equation in 1636 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1188 places, 1599/1599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17004 ms. Remains : 1183/1188 places, 1599/1599 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s1 1) (GEQ s64 1) (GEQ s3 1) (GEQ s66 1) (GEQ s5 1) (GEQ s68 1) (GEQ s7 1) (GEQ s70 1) (GEQ s9 1) (GEQ s72 1) (GEQ s11 1) (GEQ s74 1) (GEQ s13...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-COL-S05J80-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-01 finished in 17300 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 8 out of 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1183 transition count 1515
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 168 place count 1099 transition count 1515
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 83 Pre rules applied. Total rules applied 168 place count 1099 transition count 1432
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 334 place count 1016 transition count 1432
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 338 place count 1014 transition count 1430
Applied a total of 338 rules in 122 ms. Remains 1014 /1188 variables (removed 174) and now considering 1430/1599 (removed 169) transitions.
[2023-03-23 20:55:08] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1014 cols
[2023-03-23 20:55:08] [INFO ] Computed 177 place invariants in 29 ms
[2023-03-23 20:55:09] [INFO ] Dead Transitions using invariants and state equation in 1476 ms found 0 transitions.
[2023-03-23 20:55:09] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 20:55:09] [INFO ] Invariant cache hit.
[2023-03-23 20:55:11] [INFO ] Implicit Places using invariants in 1369 ms returned []
[2023-03-23 20:55:11] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 20:55:11] [INFO ] Invariant cache hit.
[2023-03-23 20:55:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:55:19] [INFO ] Implicit Places using invariants and state equation in 7881 ms returned []
Implicit Place search using SMT with State Equation took 9254 ms to find 0 implicit places.
[2023-03-23 20:55:19] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-23 20:55:19] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 20:55:19] [INFO ] Invariant cache hit.
[2023-03-23 20:55:20] [INFO ] Dead Transitions using invariants and state equation in 1626 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1014/1188 places, 1430/1599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12555 ms. Remains : 1014/1188 places, 1430/1599 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s1011 1) (OR (LT s499 1) (LT s502 1) (LT s505 9)) (OR (LT s499 1) (LT s503 1) (LT s505 9)) (OR (LT s499 1) (LT s504 1) (LT s505 9)) (OR (LT s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5529 reset in 733 ms.
Product exploration explored 100000 steps with 5618 reset in 671 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2023-03-23 20:55:22] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 20:55:22] [INFO ] Invariant cache hit.
[2023-03-23 20:55:23] [INFO ] [Real]Absence check using 170 positive place invariants in 153 ms returned sat
[2023-03-23 20:55:24] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 62 ms returned sat
[2023-03-23 20:55:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:55:27] [INFO ] [Real]Absence check using state equation in 3212 ms returned sat
[2023-03-23 20:55:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:55:28] [INFO ] [Nat]Absence check using 170 positive place invariants in 195 ms returned sat
[2023-03-23 20:55:28] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 139 ms returned sat
[2023-03-23 20:55:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:55:33] [INFO ] [Nat]Absence check using state equation in 4415 ms returned sat
[2023-03-23 20:55:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:55:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 96 ms returned sat
[2023-03-23 20:55:33] [INFO ] Computed and/alt/rep : 684/2379/684 causal constraints (skipped 736 transitions) in 181 ms.
[2023-03-23 20:55:34] [INFO ] Added : 25 causal constraints over 5 iterations in 884 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 1014 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1014/1014 places, 1430/1430 transitions.
Applied a total of 0 rules in 45 ms. Remains 1014 /1014 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-23 20:55:34] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 20:55:34] [INFO ] Invariant cache hit.
[2023-03-23 20:55:35] [INFO ] Dead Transitions using invariants and state equation in 1651 ms found 0 transitions.
[2023-03-23 20:55:35] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 20:55:35] [INFO ] Invariant cache hit.
[2023-03-23 20:55:37] [INFO ] Implicit Places using invariants in 1308 ms returned []
[2023-03-23 20:55:37] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 20:55:37] [INFO ] Invariant cache hit.
[2023-03-23 20:55:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:55:45] [INFO ] Implicit Places using invariants and state equation in 8170 ms returned []
Implicit Place search using SMT with State Equation took 9488 ms to find 0 implicit places.
[2023-03-23 20:55:45] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-23 20:55:45] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 20:55:45] [INFO ] Invariant cache hit.
[2023-03-23 20:55:47] [INFO ] Dead Transitions using invariants and state equation in 1635 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12850 ms. Remains : 1014/1014 places, 1430/1430 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 200 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2023-03-23 20:55:47] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 20:55:47] [INFO ] Invariant cache hit.
[2023-03-23 20:55:48] [INFO ] [Real]Absence check using 170 positive place invariants in 140 ms returned sat
[2023-03-23 20:55:48] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 64 ms returned sat
[2023-03-23 20:55:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:55:52] [INFO ] [Real]Absence check using state equation in 3244 ms returned sat
[2023-03-23 20:55:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:55:53] [INFO ] [Nat]Absence check using 170 positive place invariants in 204 ms returned sat
[2023-03-23 20:55:53] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 146 ms returned sat
[2023-03-23 20:55:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:55:58] [INFO ] [Nat]Absence check using state equation in 4599 ms returned sat
[2023-03-23 20:55:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:55:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 112 ms returned sat
[2023-03-23 20:55:58] [INFO ] Computed and/alt/rep : 684/2379/684 causal constraints (skipped 736 transitions) in 105 ms.
[2023-03-23 20:55:59] [INFO ] Added : 25 causal constraints over 5 iterations in 707 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5535 reset in 599 ms.
Product exploration explored 100000 steps with 5620 reset in 627 ms.
Support contains 8 out of 1014 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1014/1014 places, 1430/1430 transitions.
Applied a total of 0 rules in 35 ms. Remains 1014 /1014 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-23 20:56:00] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 20:56:00] [INFO ] Invariant cache hit.
[2023-03-23 20:56:01] [INFO ] Dead Transitions using invariants and state equation in 1635 ms found 0 transitions.
[2023-03-23 20:56:01] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 20:56:01] [INFO ] Invariant cache hit.
[2023-03-23 20:56:03] [INFO ] Implicit Places using invariants in 1380 ms returned []
[2023-03-23 20:56:03] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 20:56:03] [INFO ] Invariant cache hit.
[2023-03-23 20:56:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:56:12] [INFO ] Implicit Places using invariants and state equation in 8704 ms returned []
Implicit Place search using SMT with State Equation took 10091 ms to find 0 implicit places.
[2023-03-23 20:56:12] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-23 20:56:12] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 20:56:12] [INFO ] Invariant cache hit.
[2023-03-23 20:56:13] [INFO ] Dead Transitions using invariants and state equation in 1578 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13370 ms. Remains : 1014/1014 places, 1430/1430 transitions.
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-03 finished in 65697 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||G((F(G(p1))&&F(p2)))))))'
Support contains 96 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Applied a total of 0 rules in 22 ms. Remains 1188 /1188 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
[2023-03-23 20:56:13] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1188 cols
[2023-03-23 20:56:13] [INFO ] Computed 182 place invariants in 37 ms
[2023-03-23 20:56:15] [INFO ] Dead Transitions using invariants and state equation in 1677 ms found 0 transitions.
[2023-03-23 20:56:15] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:56:15] [INFO ] Invariant cache hit.
[2023-03-23 20:56:17] [INFO ] Implicit Places using invariants in 1609 ms returned []
[2023-03-23 20:56:17] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:56:17] [INFO ] Invariant cache hit.
[2023-03-23 20:56:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:56:21] [INFO ] Implicit Places using invariants and state equation in 4240 ms returned []
Implicit Place search using SMT with State Equation took 5853 ms to find 0 implicit places.
[2023-03-23 20:56:21] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:56:21] [INFO ] Invariant cache hit.
[2023-03-23 20:56:23] [INFO ] Dead Transitions using invariants and state equation in 1807 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9366 ms. Remains : 1188/1188 places, 1599/1599 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s1187 1), p1:(AND (OR (LT s509 1) (LT s1008 1) (LT s1013 1) (LT s1016 1)) (OR (LT s509 1) (LT s1006 1) (LT s1011 1) (LT s1016 1)) (OR (LT s509 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 10323 reset in 673 ms.
Product exploration explored 100000 steps with 10325 reset in 654 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 295 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 1730 steps, including 121 resets, run visited all 4 properties in 23 ms. (steps per millisecond=75 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p0), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 8 factoid took 382 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-23 20:56:26] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:56:26] [INFO ] Invariant cache hit.
[2023-03-23 20:56:27] [INFO ] [Real]Absence check using 175 positive place invariants in 199 ms returned sat
[2023-03-23 20:56:27] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 65 ms returned sat
[2023-03-23 20:56:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:56:32] [INFO ] [Real]Absence check using state equation in 4638 ms returned sat
[2023-03-23 20:56:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:56:34] [INFO ] [Nat]Absence check using 175 positive place invariants in 275 ms returned sat
[2023-03-23 20:56:34] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 302 ms returned sat
[2023-03-23 20:56:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:56:39] [INFO ] [Nat]Absence check using state equation in 4786 ms returned sat
[2023-03-23 20:56:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:56:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 36 ms returned sat
[2023-03-23 20:56:39] [INFO ] Computed and/alt/rep : 854/1914/854 causal constraints (skipped 735 transitions) in 109 ms.
[2023-03-23 20:56:40] [INFO ] Added : 33 causal constraints over 7 iterations in 1078 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 96 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Applied a total of 0 rules in 21 ms. Remains 1188 /1188 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
[2023-03-23 20:56:40] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:56:40] [INFO ] Invariant cache hit.
[2023-03-23 20:56:42] [INFO ] Dead Transitions using invariants and state equation in 1681 ms found 0 transitions.
[2023-03-23 20:56:42] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:56:42] [INFO ] Invariant cache hit.
[2023-03-23 20:56:43] [INFO ] Implicit Places using invariants in 1612 ms returned []
[2023-03-23 20:56:44] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:56:44] [INFO ] Invariant cache hit.
[2023-03-23 20:56:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:56:53] [INFO ] Implicit Places using invariants and state equation in 9052 ms returned []
Implicit Place search using SMT with State Equation took 10677 ms to find 0 implicit places.
[2023-03-23 20:56:53] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:56:53] [INFO ] Invariant cache hit.
[2023-03-23 20:56:54] [INFO ] Dead Transitions using invariants and state equation in 1750 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14146 ms. Remains : 1188/1188 places, 1599/1599 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 302 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 2017 steps, including 146 resets, run visited all 4 properties in 22 ms. (steps per millisecond=91 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p0), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 502 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 228 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-23 20:56:56] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:56:56] [INFO ] Invariant cache hit.
[2023-03-23 20:56:58] [INFO ] [Real]Absence check using 175 positive place invariants in 225 ms returned sat
[2023-03-23 20:56:58] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 71 ms returned sat
[2023-03-23 20:56:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:02] [INFO ] [Real]Absence check using state equation in 4726 ms returned sat
[2023-03-23 20:57:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:57:04] [INFO ] [Nat]Absence check using 175 positive place invariants in 269 ms returned sat
[2023-03-23 20:57:05] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 314 ms returned sat
[2023-03-23 20:57:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:09] [INFO ] [Nat]Absence check using state equation in 4800 ms returned sat
[2023-03-23 20:57:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:57:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 30 ms returned sat
[2023-03-23 20:57:10] [INFO ] Computed and/alt/rep : 854/1914/854 causal constraints (skipped 735 transitions) in 105 ms.
[2023-03-23 20:57:10] [INFO ] Added : 33 causal constraints over 7 iterations in 992 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10305 reset in 547 ms.
Product exploration explored 100000 steps with 10325 reset in 589 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 96 out of 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 1188 transition count 1599
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 82 place count 1188 transition count 1600
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 1188 transition count 1600
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 169 places in 1 ms
Iterating global reduction 1 with 85 rules applied. Total rules applied 169 place count 1188 transition count 1600
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 252 place count 1105 transition count 1517
Deduced a syphon composed of 86 places in 1 ms
Iterating global reduction 1 with 83 rules applied. Total rules applied 335 place count 1105 transition count 1517
Deduced a syphon composed of 86 places in 0 ms
Applied a total of 335 rules in 343 ms. Remains 1105 /1188 variables (removed 83) and now considering 1517/1599 (removed 82) transitions.
[2023-03-23 20:57:12] [INFO ] Flow matrix only has 1513 transitions (discarded 4 similar events)
// Phase 1: matrix 1513 rows 1105 cols
[2023-03-23 20:57:12] [INFO ] Computed 182 place invariants in 33 ms
[2023-03-23 20:57:14] [INFO ] Dead Transitions using invariants and state equation in 2015 ms found 0 transitions.
[2023-03-23 20:57:14] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-23 20:57:14] [INFO ] Flow matrix only has 1513 transitions (discarded 4 similar events)
[2023-03-23 20:57:14] [INFO ] Invariant cache hit.
[2023-03-23 20:57:16] [INFO ] Dead Transitions using invariants and state equation in 1888 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1105/1188 places, 1517/1599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4287 ms. Remains : 1105/1188 places, 1517/1599 transitions.
Support contains 96 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Applied a total of 0 rules in 32 ms. Remains 1188 /1188 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
[2023-03-23 20:57:16] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1188 cols
[2023-03-23 20:57:16] [INFO ] Computed 182 place invariants in 27 ms
[2023-03-23 20:57:18] [INFO ] Dead Transitions using invariants and state equation in 1685 ms found 0 transitions.
[2023-03-23 20:57:18] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:57:18] [INFO ] Invariant cache hit.
[2023-03-23 20:57:20] [INFO ] Implicit Places using invariants in 1550 ms returned []
[2023-03-23 20:57:20] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:57:20] [INFO ] Invariant cache hit.
[2023-03-23 20:57:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:57:28] [INFO ] Implicit Places using invariants and state equation in 8363 ms returned []
Implicit Place search using SMT with State Equation took 9915 ms to find 0 implicit places.
[2023-03-23 20:57:28] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:57:28] [INFO ] Invariant cache hit.
[2023-03-23 20:57:30] [INFO ] Dead Transitions using invariants and state equation in 1860 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13503 ms. Remains : 1188/1188 places, 1599/1599 transitions.
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-04 finished in 76565 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 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1183 transition count 1514
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 1098 transition count 1514
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 170 place count 1098 transition count 1430
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 338 place count 1014 transition count 1430
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 342 place count 1012 transition count 1428
Applied a total of 342 rules in 90 ms. Remains 1012 /1188 variables (removed 176) and now considering 1428/1599 (removed 171) transitions.
[2023-03-23 20:57:30] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2023-03-23 20:57:30] [INFO ] Computed 177 place invariants in 61 ms
[2023-03-23 20:57:31] [INFO ] Dead Transitions using invariants and state equation in 1394 ms found 0 transitions.
[2023-03-23 20:57:31] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
[2023-03-23 20:57:31] [INFO ] Invariant cache hit.
[2023-03-23 20:57:33] [INFO ] Implicit Places using invariants in 1500 ms returned []
[2023-03-23 20:57:33] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
[2023-03-23 20:57:33] [INFO ] Invariant cache hit.
[2023-03-23 20:57:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:57:42] [INFO ] Implicit Places using invariants and state equation in 9203 ms returned []
Implicit Place search using SMT with State Equation took 10715 ms to find 0 implicit places.
[2023-03-23 20:57:42] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-23 20:57:42] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
[2023-03-23 20:57:42] [INFO ] Invariant cache hit.
[2023-03-23 20:57:44] [INFO ] Dead Transitions using invariants and state equation in 1363 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1012/1188 places, 1428/1599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13607 ms. Remains : 1012/1188 places, 1428/1599 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-05 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 s1009 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 8 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J80-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-05 finished in 13663 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))||(F(p1)&&G(F(p2)))))'
Support contains 171 out of 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1183 transition count 1596
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1180 transition count 1596
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1180 transition count 1593
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 12 place count 1177 transition count 1593
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 1174 transition count 1590
Applied a total of 18 rules in 79 ms. Remains 1174 /1188 variables (removed 14) and now considering 1590/1599 (removed 9) transitions.
[2023-03-23 20:57:44] [INFO ] Flow matrix only has 1586 transitions (discarded 4 similar events)
// Phase 1: matrix 1586 rows 1174 cols
[2023-03-23 20:57:44] [INFO ] Computed 177 place invariants in 33 ms
[2023-03-23 20:57:45] [INFO ] Dead Transitions using invariants and state equation in 1749 ms found 0 transitions.
[2023-03-23 20:57:45] [INFO ] Flow matrix only has 1586 transitions (discarded 4 similar events)
[2023-03-23 20:57:45] [INFO ] Invariant cache hit.
[2023-03-23 20:57:47] [INFO ] Implicit Places using invariants in 1609 ms returned []
[2023-03-23 20:57:47] [INFO ] Flow matrix only has 1586 transitions (discarded 4 similar events)
[2023-03-23 20:57:47] [INFO ] Invariant cache hit.
[2023-03-23 20:57:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:57:58] [INFO ] Implicit Places using invariants and state equation in 11362 ms returned []
Implicit Place search using SMT with State Equation took 12985 ms to find 0 implicit places.
[2023-03-23 20:57:58] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-23 20:57:58] [INFO ] Flow matrix only has 1586 transitions (discarded 4 similar events)
[2023-03-23 20:57:58] [INFO ] Invariant cache hit.
[2023-03-23 20:58:00] [INFO ] Dead Transitions using invariants and state equation in 1669 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1174/1188 places, 1590/1599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16540 ms. Remains : 1174/1188 places, 1590/1599 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s499 1) (LT s502 1) (LT s505 9)) (OR (LT s499 1) (LT s503 1) (LT s505 9)) (OR (LT s499 1) (LT s504 1) (LT s505 9)) (OR (LT s499 1) (LT s50...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J80-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-07 finished in 16687 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((G(p0)||F(p1)))))'
Support contains 8 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1183 transition count 1599
Applied a total of 5 rules in 26 ms. Remains 1183 /1188 variables (removed 5) and now considering 1599/1599 (removed 0) transitions.
[2023-03-23 20:58:00] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2023-03-23 20:58:00] [INFO ] Computed 177 place invariants in 33 ms
[2023-03-23 20:58:02] [INFO ] Dead Transitions using invariants and state equation in 1693 ms found 0 transitions.
[2023-03-23 20:58:02] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:58:02] [INFO ] Invariant cache hit.
[2023-03-23 20:58:04] [INFO ] Implicit Places using invariants in 1664 ms returned []
[2023-03-23 20:58:04] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:58:04] [INFO ] Invariant cache hit.
[2023-03-23 20:58:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:58:13] [INFO ] Implicit Places using invariants and state equation in 8845 ms returned []
Implicit Place search using SMT with State Equation took 10526 ms to find 0 implicit places.
[2023-03-23 20:58:13] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:58:13] [INFO ] Invariant cache hit.
[2023-03-23 20:58:14] [INFO ] Dead Transitions using invariants and state equation in 1661 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1188 places, 1599/1599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13909 ms. Remains : 1183/1188 places, 1599/1599 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s501 1), p1:(OR (AND (GEQ s503 1) (GEQ s505 1) (GEQ s506 1) (GEQ s509 8)) (AND (GEQ s503 1) (GEQ s507 2) (GEQ s509 8)) (AND (GEQ s503 1) (GEQ s504...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J80-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-08 finished in 14051 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(p1)||p0)))'
Support contains 169 out of 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1183 transition count 1514
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 1098 transition count 1514
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 170 place count 1098 transition count 1429
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 340 place count 1013 transition count 1429
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 346 place count 1010 transition count 1426
Applied a total of 346 rules in 90 ms. Remains 1010 /1188 variables (removed 178) and now considering 1426/1599 (removed 173) transitions.
[2023-03-23 20:58:14] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-23 20:58:14] [INFO ] Computed 177 place invariants in 35 ms
[2023-03-23 20:58:16] [INFO ] Dead Transitions using invariants and state equation in 1173 ms found 0 transitions.
[2023-03-23 20:58:16] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-23 20:58:16] [INFO ] Invariant cache hit.
[2023-03-23 20:58:16] [INFO ] Implicit Places using invariants in 760 ms returned []
[2023-03-23 20:58:16] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-23 20:58:16] [INFO ] Invariant cache hit.
[2023-03-23 20:58:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:58:19] [INFO ] Implicit Places using invariants and state equation in 2714 ms returned []
Implicit Place search using SMT with State Equation took 3508 ms to find 0 implicit places.
[2023-03-23 20:58:19] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-23 20:58:19] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-23 20:58:19] [INFO ] Invariant cache hit.
[2023-03-23 20:58:20] [INFO ] Dead Transitions using invariants and state equation in 1256 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1010/1188 places, 1426/1599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6083 ms. Remains : 1010/1188 places, 1426/1599 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (OR (LT s912 1) (LT s974 1)) (OR (LT s913 1) (LT s923 1)) (OR (LT s910 1) (LT s946 1)) (OR (LT s913 1) (LT s988 1)) (OR (LT s911 1) (LT s960 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10254 reset in 4153 ms.
Product exploration explored 100000 steps with 10245 reset in 4168 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 306 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Support contains 169 out of 1010 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 34 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-23 20:58:29] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-23 20:58:29] [INFO ] Invariant cache hit.
[2023-03-23 20:58:31] [INFO ] Dead Transitions using invariants and state equation in 1201 ms found 0 transitions.
[2023-03-23 20:58:31] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-23 20:58:31] [INFO ] Invariant cache hit.
[2023-03-23 20:58:31] [INFO ] Implicit Places using invariants in 770 ms returned []
[2023-03-23 20:58:31] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-23 20:58:31] [INFO ] Invariant cache hit.
[2023-03-23 20:58:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:58:36] [INFO ] Implicit Places using invariants and state equation in 4857 ms returned []
Implicit Place search using SMT with State Equation took 5629 ms to find 0 implicit places.
[2023-03-23 20:58:36] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-23 20:58:36] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-23 20:58:36] [INFO ] Invariant cache hit.
[2023-03-23 20:58:38] [INFO ] Dead Transitions using invariants and state equation in 1166 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8064 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 12 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10288 reset in 4416 ms.
Product exploration explored 100000 steps with 10245 reset in 4514 ms.
Support contains 169 out of 1010 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 40 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-23 20:58:47] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-23 20:58:47] [INFO ] Invariant cache hit.
[2023-03-23 20:58:48] [INFO ] Dead Transitions using invariants and state equation in 1239 ms found 0 transitions.
[2023-03-23 20:58:48] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-23 20:58:48] [INFO ] Invariant cache hit.
[2023-03-23 20:58:49] [INFO ] Implicit Places using invariants in 766 ms returned []
[2023-03-23 20:58:49] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-23 20:58:49] [INFO ] Invariant cache hit.
[2023-03-23 20:58:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:58:54] [INFO ] Implicit Places using invariants and state equation in 4788 ms returned []
Implicit Place search using SMT with State Equation took 5556 ms to find 0 implicit places.
[2023-03-23 20:58:54] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-23 20:58:54] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-23 20:58:54] [INFO ] Invariant cache hit.
[2023-03-23 20:58:55] [INFO ] Dead Transitions using invariants and state equation in 1212 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8089 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-10 finished in 40874 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(G(p1))&&F((!p1 U (p2||G(!p1)))))))'
Support contains 9 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1183 transition count 1599
Applied a total of 5 rules in 30 ms. Remains 1183 /1188 variables (removed 5) and now considering 1599/1599 (removed 0) transitions.
[2023-03-23 20:58:55] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2023-03-23 20:58:55] [INFO ] Computed 177 place invariants in 40 ms
[2023-03-23 20:58:57] [INFO ] Dead Transitions using invariants and state equation in 1749 ms found 0 transitions.
[2023-03-23 20:58:57] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:58:57] [INFO ] Invariant cache hit.
[2023-03-23 20:58:59] [INFO ] Implicit Places using invariants in 1719 ms returned []
[2023-03-23 20:58:59] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:58:59] [INFO ] Invariant cache hit.
[2023-03-23 20:58:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:59:08] [INFO ] Implicit Places using invariants and state equation in 9339 ms returned []
Implicit Place search using SMT with State Equation took 11060 ms to find 0 implicit places.
[2023-03-23 20:59:08] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-23 20:59:08] [INFO ] Invariant cache hit.
[2023-03-23 20:59:10] [INFO ] Dead Transitions using invariants and state equation in 1609 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1188 places, 1599/1599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14461 ms. Remains : 1183/1188 places, 1599/1599 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(GEQ s502 1), p0:(OR (AND (GEQ s503 1) (GEQ s504 1) (GEQ s506 1) (GEQ s507 1) (GEQ s508 1) (GEQ s509 6)) (AND (GEQ s503 1) (GEQ s507 4) (GEQ s509 6)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][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-S05J80-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-12 finished in 14698 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 166 out of 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1183 transition count 1514
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 1098 transition count 1514
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 170 place count 1098 transition count 1429
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 340 place count 1013 transition count 1429
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 346 place count 1010 transition count 1426
Applied a total of 346 rules in 84 ms. Remains 1010 /1188 variables (removed 178) and now considering 1426/1599 (removed 173) transitions.
[2023-03-23 20:59:10] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-23 20:59:10] [INFO ] Computed 177 place invariants in 32 ms
[2023-03-23 20:59:11] [INFO ] Dead Transitions using invariants and state equation in 1213 ms found 0 transitions.
[2023-03-23 20:59:11] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-23 20:59:11] [INFO ] Invariant cache hit.
[2023-03-23 20:59:13] [INFO ] Implicit Places using invariants in 1391 ms returned []
[2023-03-23 20:59:13] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-23 20:59:13] [INFO ] Invariant cache hit.
[2023-03-23 20:59:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:59:19] [INFO ] Implicit Places using invariants and state equation in 5916 ms returned []
Implicit Place search using SMT with State Equation took 7322 ms to find 0 implicit places.
[2023-03-23 20:59:19] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-23 20:59:19] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-23 20:59:19] [INFO ] Invariant cache hit.
[2023-03-23 20:59:20] [INFO ] Dead Transitions using invariants and state equation in 1205 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1010/1188 places, 1426/1599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9877 ms. Remains : 1010/1188 places, 1426/1599 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (AND (GEQ s0 1) (GEQ s127 1) (GEQ s411 1)) (AND (GEQ s0 1) (GEQ s137 1) (GEQ s411 1)) (AND (GEQ s0 1) (GEQ s156 1) (GEQ s411 1)) (AND (GEQ s0 ...], 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 1 ms.
FORMULA PolyORBNT-COL-S05J80-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-15 finished in 9937 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)))'
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||G((F(G(p1))&&F(p2)))))))'
Found a Shortening insensitive property : PolyORBNT-COL-S05J80-LTLFireability-04
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 96 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 1188 transition count 1517
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 164 place count 1106 transition count 1517
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 164 place count 1106 transition count 1432
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 334 place count 1021 transition count 1432
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 338 place count 1019 transition count 1430
Applied a total of 338 rules in 109 ms. Remains 1019 /1188 variables (removed 169) and now considering 1430/1599 (removed 169) transitions.
[2023-03-23 20:59:20] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1019 cols
[2023-03-23 20:59:20] [INFO ] Computed 182 place invariants in 27 ms
[2023-03-23 20:59:22] [INFO ] Dead Transitions using invariants and state equation in 1439 ms found 0 transitions.
[2023-03-23 20:59:22] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 20:59:22] [INFO ] Invariant cache hit.
[2023-03-23 20:59:23] [INFO ] Implicit Places using invariants in 1334 ms returned []
[2023-03-23 20:59:23] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 20:59:23] [INFO ] Invariant cache hit.
[2023-03-23 20:59:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:59:32] [INFO ] Implicit Places using invariants and state equation in 8573 ms returned []
Implicit Place search using SMT with State Equation took 9919 ms to find 0 implicit places.
[2023-03-23 20:59:32] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 20:59:32] [INFO ] Invariant cache hit.
[2023-03-23 20:59:33] [INFO ] Dead Transitions using invariants and state equation in 1411 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1019/1188 places, 1430/1599 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 12885 ms. Remains : 1019/1188 places, 1430/1599 transitions.
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s1018 1), p1:(AND (OR (LT s505 1) (LT s1004 1) (LT s1009 1) (LT s1012 1)) (OR (LT s505 1) (LT s1002 1) (LT s1007 1) (LT s1012 1)) (OR (LT s505 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 14822 reset in 598 ms.
Product exploration explored 100000 steps with 14807 reset in 654 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 305 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 713 steps, including 52 resets, run visited all 4 properties in 8 ms. (steps per millisecond=89 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND p1 (NOT p0))), (F p0), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 330 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-23 20:59:35] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 20:59:35] [INFO ] Invariant cache hit.
[2023-03-23 20:59:37] [INFO ] [Real]Absence check using 174 positive place invariants in 213 ms returned sat
[2023-03-23 20:59:37] [INFO ] [Real]Absence check using 174 positive and 8 generalized place invariants in 162 ms returned sat
[2023-03-23 20:59:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:59:40] [INFO ] [Real]Absence check using state equation in 3300 ms returned sat
[2023-03-23 20:59:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:59:42] [INFO ] [Nat]Absence check using 174 positive place invariants in 194 ms returned sat
[2023-03-23 20:59:42] [INFO ] [Nat]Absence check using 174 positive and 8 generalized place invariants in 114 ms returned sat
[2023-03-23 20:59:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:59:46] [INFO ] [Nat]Absence check using state equation in 3798 ms returned sat
[2023-03-23 20:59:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:59:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 395 ms returned sat
[2023-03-23 20:59:46] [INFO ] Computed and/alt/rep : 685/2383/685 causal constraints (skipped 735 transitions) in 83 ms.
[2023-03-23 20:59:48] [INFO ] Added : 21 causal constraints over 5 iterations in 2104 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 96 out of 1019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1019/1019 places, 1430/1430 transitions.
Applied a total of 0 rules in 17 ms. Remains 1019 /1019 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-23 20:59:48] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 20:59:48] [INFO ] Invariant cache hit.
[2023-03-23 20:59:50] [INFO ] Dead Transitions using invariants and state equation in 1259 ms found 0 transitions.
[2023-03-23 20:59:50] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 20:59:50] [INFO ] Invariant cache hit.
[2023-03-23 20:59:51] [INFO ] Implicit Places using invariants in 1325 ms returned []
[2023-03-23 20:59:51] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 20:59:51] [INFO ] Invariant cache hit.
[2023-03-23 20:59:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:59:56] [INFO ] Implicit Places using invariants and state equation in 5431 ms returned []
Implicit Place search using SMT with State Equation took 6806 ms to find 0 implicit places.
[2023-03-23 20:59:56] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 20:59:56] [INFO ] Invariant cache hit.
[2023-03-23 20:59:58] [INFO ] Dead Transitions using invariants and state equation in 1277 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9368 ms. Remains : 1019/1019 places, 1430/1430 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 328 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 538 steps, including 39 resets, run visited all 4 properties in 10 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) p1)), (F p0), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 412 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-23 20:59:59] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 20:59:59] [INFO ] Invariant cache hit.
[2023-03-23 21:00:00] [INFO ] [Real]Absence check using 174 positive place invariants in 230 ms returned sat
[2023-03-23 21:00:01] [INFO ] [Real]Absence check using 174 positive and 8 generalized place invariants in 167 ms returned sat
[2023-03-23 21:00:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:00:04] [INFO ] [Real]Absence check using state equation in 3582 ms returned sat
[2023-03-23 21:00:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:00:06] [INFO ] [Nat]Absence check using 174 positive place invariants in 202 ms returned sat
[2023-03-23 21:00:06] [INFO ] [Nat]Absence check using 174 positive and 8 generalized place invariants in 125 ms returned sat
[2023-03-23 21:00:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:00:10] [INFO ] [Nat]Absence check using state equation in 3866 ms returned sat
[2023-03-23 21:00:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 21:00:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 444 ms returned sat
[2023-03-23 21:00:10] [INFO ] Computed and/alt/rep : 685/2383/685 causal constraints (skipped 735 transitions) in 100 ms.
[2023-03-23 21:00:12] [INFO ] Added : 21 causal constraints over 5 iterations in 2160 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 14843 reset in 642 ms.
Product exploration explored 100000 steps with 14813 reset in 684 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 96 out of 1019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1019/1019 places, 1430/1430 transitions.
Applied a total of 0 rules in 29 ms. Remains 1019 /1019 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-23 21:00:14] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 21:00:14] [INFO ] Invariant cache hit.
[2023-03-23 21:00:15] [INFO ] Dead Transitions using invariants and state equation in 1326 ms found 0 transitions.
[2023-03-23 21:00:15] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-23 21:00:15] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 21:00:15] [INFO ] Invariant cache hit.
[2023-03-23 21:00:17] [INFO ] Dead Transitions using invariants and state equation in 1357 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2740 ms. Remains : 1019/1019 places, 1430/1430 transitions.
Support contains 96 out of 1019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1019/1019 places, 1430/1430 transitions.
Applied a total of 0 rules in 17 ms. Remains 1019 /1019 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-23 21:00:17] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 21:00:17] [INFO ] Invariant cache hit.
[2023-03-23 21:00:18] [INFO ] Dead Transitions using invariants and state equation in 1361 ms found 0 transitions.
[2023-03-23 21:00:18] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 21:00:18] [INFO ] Invariant cache hit.
[2023-03-23 21:00:19] [INFO ] Implicit Places using invariants in 1263 ms returned []
[2023-03-23 21:00:19] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 21:00:19] [INFO ] Invariant cache hit.
[2023-03-23 21:00:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 21:00:29] [INFO ] Implicit Places using invariants and state equation in 9670 ms returned []
Implicit Place search using SMT with State Equation took 10947 ms to find 0 implicit places.
[2023-03-23 21:00:29] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-23 21:00:29] [INFO ] Invariant cache hit.
[2023-03-23 21:00:30] [INFO ] Dead Transitions using invariants and state equation in 1301 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13628 ms. Remains : 1019/1019 places, 1430/1430 transitions.
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-04 finished in 70568 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(p1)||p0)))'
[2023-03-23 21:00:31] [INFO ] Flatten gal took : 88 ms
[2023-03-23 21:00:31] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2023-03-23 21:00:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1188 places, 1599 transitions and 7962 arcs took 9 ms.
Total runtime 449100 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1903/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1903/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1903/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PolyORBNT-COL-S05J80-LTLFireability-03
Could not compute solution for formula : PolyORBNT-COL-S05J80-LTLFireability-04
Could not compute solution for formula : PolyORBNT-COL-S05J80-LTLFireability-10
BK_STOP 1679605233777
--------------------
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-S05J80-LTLFireability-03
ltl formula formula --ltl=/tmp/1903/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 1188 places, 1599 transitions and 7962 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.190 real 0.040 user 0.070 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1903/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1903/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1903/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1903/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name PolyORBNT-COL-S05J80-LTLFireability-04
ltl formula formula --ltl=/tmp/1903/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 1188 places, 1599 transitions and 7962 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.180 real 0.040 user 0.070 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1903/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1903/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1903/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1903/ltl_1_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** 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:
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** 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:
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** 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:
*** 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:
ltl formula name PolyORBNT-COL-S05J80-LTLFireability-10
ltl formula formula --ltl=/tmp/1903/ltl_2_
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 1188 places, 1599 transitions and 7962 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.190 real 0.070 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1903/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1903/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1903/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1903/ltl_2_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** 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:
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** 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:
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
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-S05J80"
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-S05J80, 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-167873950800668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J80.tgz
mv PolyORBNT-COL-S05J80 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;