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-167873950900756.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-PT-S10J20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950900756
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 22M
-rw-r--r-- 1 mcc users 17K Feb 26 01:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 01:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1002K Feb 26 01:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Feb 26 01:17 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 6.5K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Feb 26 03:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 196K Feb 26 03:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 708K Feb 26 02:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.7M Feb 26 02:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 13M 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-PT-S10J20-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679638894325

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-PT-S10J20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 06:21:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 06:21:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 06:21:36] [INFO ] Load time of PNML (sax parser for PT used): 533 ms
[2023-03-24 06:21:36] [INFO ] Transformed 474 places.
[2023-03-24 06:21:36] [INFO ] Transformed 11760 transitions.
[2023-03-24 06:21:36] [INFO ] Parsed PT model containing 474 places and 11760 transitions and 111119 arcs in 694 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 84 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 467 transition count 1650
Applied a total of 7 rules in 115 ms. Remains 467 /474 variables (removed 7) and now considering 1650/1650 (removed 0) transitions.
[2023-03-24 06:21:37] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 467 cols
[2023-03-24 06:21:37] [INFO ] Computed 65 place invariants in 70 ms
[2023-03-24 06:21:38] [INFO ] Dead Transitions using invariants and state equation in 1593 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2023-03-24 06:21:38] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 467 cols
[2023-03-24 06:21:38] [INFO ] Computed 65 place invariants in 41 ms
[2023-03-24 06:21:39] [INFO ] Implicit Places using invariants in 499 ms returned []
[2023-03-24 06:21:39] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
[2023-03-24 06:21:39] [INFO ] Invariant cache hit.
[2023-03-24 06:21:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:21:41] [INFO ] Implicit Places using invariants and state equation in 1969 ms returned []
Implicit Place search using SMT with State Equation took 2471 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 467/474 places, 1035/1650 transitions.
Applied a total of 0 rules in 22 ms. Remains 467 /467 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4231 ms. Remains : 467/474 places, 1035/1650 transitions.
Support contains 84 out of 467 places after structural reductions.
[2023-03-24 06:21:41] [INFO ] Flatten gal took : 156 ms
[2023-03-24 06:21:41] [INFO ] Flatten gal took : 125 ms
[2023-03-24 06:21:42] [INFO ] Input system was already deterministic with 1035 transitions.
Support contains 81 out of 467 places (down from 84) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 764 ms. (steps per millisecond=13 ) properties (out of 22) seen :9
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-24 06:21:43] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
[2023-03-24 06:21:43] [INFO ] Invariant cache hit.
[2023-03-24 06:21:43] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2023-03-24 06:21:43] [INFO ] [Real]Absence check using 45 positive and 20 generalized place invariants in 16 ms returned sat
[2023-03-24 06:21:43] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2023-03-24 06:21:43] [INFO ] [Nat]Absence check using 45 positive place invariants in 14 ms returned sat
[2023-03-24 06:21:43] [INFO ] [Nat]Absence check using 45 positive and 20 generalized place invariants in 33 ms returned sat
[2023-03-24 06:21:49] [INFO ] After 5767ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-24 06:21:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:21:49] [INFO ] After 271ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2023-03-24 06:21:50] [INFO ] Deduced a trap composed of 221 places in 345 ms of which 6 ms to minimize.
[2023-03-24 06:21:50] [INFO ] Deduced a trap composed of 213 places in 357 ms of which 1 ms to minimize.
[2023-03-24 06:21:51] [INFO ] Deduced a trap composed of 217 places in 306 ms of which 1 ms to minimize.
[2023-03-24 06:21:51] [INFO ] Deduced a trap composed of 225 places in 304 ms of which 1 ms to minimize.
[2023-03-24 06:21:51] [INFO ] Deduced a trap composed of 217 places in 392 ms of which 1 ms to minimize.
[2023-03-24 06:21:52] [INFO ] Deduced a trap composed of 221 places in 304 ms of which 1 ms to minimize.
[2023-03-24 06:21:52] [INFO ] Deduced a trap composed of 229 places in 296 ms of which 0 ms to minimize.
[2023-03-24 06:21:52] [INFO ] Deduced a trap composed of 225 places in 284 ms of which 1 ms to minimize.
[2023-03-24 06:21:53] [INFO ] Deduced a trap composed of 238 places in 295 ms of which 1 ms to minimize.
[2023-03-24 06:21:53] [INFO ] Deduced a trap composed of 211 places in 284 ms of which 1 ms to minimize.
[2023-03-24 06:21:53] [INFO ] Deduced a trap composed of 215 places in 295 ms of which 0 ms to minimize.
[2023-03-24 06:21:54] [INFO ] Deduced a trap composed of 239 places in 291 ms of which 1 ms to minimize.
[2023-03-24 06:21:54] [INFO ] Deduced a trap composed of 223 places in 303 ms of which 0 ms to minimize.
[2023-03-24 06:21:55] [INFO ] Deduced a trap composed of 243 places in 270 ms of which 1 ms to minimize.
[2023-03-24 06:21:55] [INFO ] Deduced a trap composed of 213 places in 282 ms of which 1 ms to minimize.
[2023-03-24 06:21:56] [INFO ] Deduced a trap composed of 228 places in 265 ms of which 0 ms to minimize.
[2023-03-24 06:21:56] [INFO ] Deduced a trap composed of 233 places in 310 ms of which 1 ms to minimize.
[2023-03-24 06:21:56] [INFO ] Deduced a trap composed of 219 places in 281 ms of which 0 ms to minimize.
[2023-03-24 06:21:57] [INFO ] Deduced a trap composed of 225 places in 292 ms of which 1 ms to minimize.
[2023-03-24 06:21:57] [INFO ] Deduced a trap composed of 211 places in 307 ms of which 1 ms to minimize.
[2023-03-24 06:21:57] [INFO ] Deduced a trap composed of 222 places in 291 ms of which 1 ms to minimize.
[2023-03-24 06:21:58] [INFO ] Deduced a trap composed of 219 places in 289 ms of which 1 ms to minimize.
[2023-03-24 06:21:58] [INFO ] Deduced a trap composed of 226 places in 291 ms of which 0 ms to minimize.
[2023-03-24 06:21:59] [INFO ] Deduced a trap composed of 209 places in 279 ms of which 0 ms to minimize.
[2023-03-24 06:21:59] [INFO ] Deduced a trap composed of 220 places in 281 ms of which 0 ms to minimize.
[2023-03-24 06:22:00] [INFO ] Deduced a trap composed of 237 places in 289 ms of which 0 ms to minimize.
[2023-03-24 06:22:00] [INFO ] Deduced a trap composed of 210 places in 298 ms of which 0 ms to minimize.
[2023-03-24 06:22:00] [INFO ] Deduced a trap composed of 231 places in 305 ms of which 1 ms to minimize.
[2023-03-24 06:22:01] [INFO ] Deduced a trap composed of 230 places in 310 ms of which 1 ms to minimize.
[2023-03-24 06:22:01] [INFO ] Deduced a trap composed of 229 places in 303 ms of which 0 ms to minimize.
[2023-03-24 06:22:02] [INFO ] Deduced a trap composed of 225 places in 310 ms of which 1 ms to minimize.
[2023-03-24 06:22:02] [INFO ] Deduced a trap composed of 221 places in 310 ms of which 1 ms to minimize.
[2023-03-24 06:22:02] [INFO ] Deduced a trap composed of 223 places in 306 ms of which 0 ms to minimize.
[2023-03-24 06:22:03] [INFO ] Deduced a trap composed of 223 places in 305 ms of which 1 ms to minimize.
[2023-03-24 06:22:03] [INFO ] Deduced a trap composed of 237 places in 317 ms of which 2 ms to minimize.
[2023-03-24 06:22:04] [INFO ] Deduced a trap composed of 221 places in 304 ms of which 0 ms to minimize.
[2023-03-24 06:22:05] [INFO ] Deduced a trap composed of 225 places in 318 ms of which 1 ms to minimize.
[2023-03-24 06:22:05] [INFO ] Deduced a trap composed of 223 places in 272 ms of which 1 ms to minimize.
[2023-03-24 06:22:05] [INFO ] Deduced a trap composed of 219 places in 309 ms of which 1 ms to minimize.
[2023-03-24 06:22:06] [INFO ] Deduced a trap composed of 207 places in 326 ms of which 1 ms to minimize.
[2023-03-24 06:22:07] [INFO ] Deduced a trap composed of 221 places in 316 ms of which 1 ms to minimize.
[2023-03-24 06:22:07] [INFO ] Deduced a trap composed of 209 places in 276 ms of which 0 ms to minimize.
[2023-03-24 06:22:07] [INFO ] Deduced a trap composed of 225 places in 304 ms of which 0 ms to minimize.
[2023-03-24 06:22:08] [INFO ] Deduced a trap composed of 226 places in 318 ms of which 2 ms to minimize.
[2023-03-24 06:22:08] [INFO ] Deduced a trap composed of 228 places in 308 ms of which 0 ms to minimize.
[2023-03-24 06:22:09] [INFO ] Deduced a trap composed of 2 places in 375 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 06:22:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 06:22:09] [INFO ] After 25394ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1035/1035 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 464 transition count 1010
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 53 place count 439 transition count 1010
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 53 place count 439 transition count 987
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 99 place count 416 transition count 987
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 415 transition count 986
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 415 transition count 986
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 105 place count 413 transition count 984
Applied a total of 105 rules in 145 ms. Remains 413 /467 variables (removed 54) and now considering 984/1035 (removed 51) transitions.
[2023-03-24 06:22:09] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2023-03-24 06:22:09] [INFO ] Computed 62 place invariants in 11 ms
[2023-03-24 06:22:09] [INFO ] Dead Transitions using invariants and state equation in 549 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 696 ms. Remains : 413/467 places, 984/1035 transitions.
Incomplete random walk after 10000 steps, including 658 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 06:22:09] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
[2023-03-24 06:22:09] [INFO ] Invariant cache hit.
[2023-03-24 06:22:10] [INFO ] [Real]Absence check using 44 positive place invariants in 10 ms returned sat
[2023-03-24 06:22:10] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 16 ms returned sat
[2023-03-24 06:22:10] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 06:22:10] [INFO ] [Nat]Absence check using 44 positive place invariants in 19 ms returned sat
[2023-03-24 06:22:10] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 16 ms returned sat
[2023-03-24 06:22:10] [INFO ] After 680ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 06:22:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:22:11] [INFO ] After 292ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 06:22:11] [INFO ] Deduced a trap composed of 164 places in 259 ms of which 1 ms to minimize.
[2023-03-24 06:22:11] [INFO ] Deduced a trap composed of 170 places in 256 ms of which 1 ms to minimize.
[2023-03-24 06:22:12] [INFO ] Deduced a trap composed of 168 places in 259 ms of which 0 ms to minimize.
[2023-03-24 06:22:12] [INFO ] Deduced a trap composed of 168 places in 262 ms of which 0 ms to minimize.
[2023-03-24 06:22:12] [INFO ] Deduced a trap composed of 176 places in 272 ms of which 2 ms to minimize.
[2023-03-24 06:22:12] [INFO ] Deduced a trap composed of 168 places in 263 ms of which 1 ms to minimize.
[2023-03-24 06:22:13] [INFO ] Deduced a trap composed of 172 places in 259 ms of which 1 ms to minimize.
[2023-03-24 06:22:13] [INFO ] Deduced a trap composed of 172 places in 249 ms of which 0 ms to minimize.
[2023-03-24 06:22:13] [INFO ] Deduced a trap composed of 170 places in 263 ms of which 1 ms to minimize.
[2023-03-24 06:22:14] [INFO ] Deduced a trap composed of 178 places in 259 ms of which 1 ms to minimize.
[2023-03-24 06:22:14] [INFO ] Deduced a trap composed of 162 places in 266 ms of which 8 ms to minimize.
[2023-03-24 06:22:14] [INFO ] Deduced a trap composed of 170 places in 255 ms of which 1 ms to minimize.
[2023-03-24 06:22:15] [INFO ] Deduced a trap composed of 176 places in 255 ms of which 1 ms to minimize.
[2023-03-24 06:22:15] [INFO ] Deduced a trap composed of 169 places in 249 ms of which 0 ms to minimize.
[2023-03-24 06:22:16] [INFO ] Deduced a trap composed of 170 places in 250 ms of which 0 ms to minimize.
[2023-03-24 06:22:16] [INFO ] Deduced a trap composed of 166 places in 260 ms of which 0 ms to minimize.
[2023-03-24 06:22:16] [INFO ] Deduced a trap composed of 170 places in 250 ms of which 0 ms to minimize.
[2023-03-24 06:22:17] [INFO ] Deduced a trap composed of 170 places in 251 ms of which 1 ms to minimize.
[2023-03-24 06:22:17] [INFO ] Deduced a trap composed of 166 places in 260 ms of which 1 ms to minimize.
[2023-03-24 06:22:17] [INFO ] Deduced a trap composed of 168 places in 258 ms of which 1 ms to minimize.
[2023-03-24 06:22:17] [INFO ] Deduced a trap composed of 173 places in 253 ms of which 1 ms to minimize.
[2023-03-24 06:22:18] [INFO ] Deduced a trap composed of 170 places in 257 ms of which 1 ms to minimize.
[2023-03-24 06:22:18] [INFO ] Deduced a trap composed of 166 places in 263 ms of which 1 ms to minimize.
[2023-03-24 06:22:19] [INFO ] Deduced a trap composed of 166 places in 255 ms of which 1 ms to minimize.
[2023-03-24 06:22:19] [INFO ] Deduced a trap composed of 170 places in 257 ms of which 1 ms to minimize.
[2023-03-24 06:22:19] [INFO ] Deduced a trap composed of 172 places in 252 ms of which 0 ms to minimize.
[2023-03-24 06:22:20] [INFO ] Deduced a trap composed of 166 places in 254 ms of which 0 ms to minimize.
[2023-03-24 06:22:20] [INFO ] Deduced a trap composed of 160 places in 267 ms of which 0 ms to minimize.
[2023-03-24 06:22:20] [INFO ] Deduced a trap composed of 158 places in 255 ms of which 1 ms to minimize.
[2023-03-24 06:22:21] [INFO ] Deduced a trap composed of 172 places in 244 ms of which 1 ms to minimize.
[2023-03-24 06:22:21] [INFO ] Deduced a trap composed of 166 places in 258 ms of which 1 ms to minimize.
[2023-03-24 06:22:21] [INFO ] Deduced a trap composed of 164 places in 259 ms of which 1 ms to minimize.
[2023-03-24 06:22:21] [INFO ] Deduced a trap composed of 166 places in 269 ms of which 1 ms to minimize.
[2023-03-24 06:22:22] [INFO ] Deduced a trap composed of 172 places in 262 ms of which 0 ms to minimize.
[2023-03-24 06:22:22] [INFO ] Deduced a trap composed of 170 places in 255 ms of which 0 ms to minimize.
[2023-03-24 06:22:22] [INFO ] Deduced a trap composed of 160 places in 245 ms of which 0 ms to minimize.
[2023-03-24 06:22:23] [INFO ] Deduced a trap composed of 160 places in 257 ms of which 0 ms to minimize.
[2023-03-24 06:22:23] [INFO ] Deduced a trap composed of 175 places in 260 ms of which 1 ms to minimize.
[2023-03-24 06:22:24] [INFO ] Deduced a trap composed of 162 places in 263 ms of which 1 ms to minimize.
[2023-03-24 06:22:24] [INFO ] Deduced a trap composed of 170 places in 261 ms of which 1 ms to minimize.
[2023-03-24 06:22:24] [INFO ] Deduced a trap composed of 162 places in 245 ms of which 1 ms to minimize.
[2023-03-24 06:22:25] [INFO ] Deduced a trap composed of 162 places in 270 ms of which 0 ms to minimize.
[2023-03-24 06:22:25] [INFO ] Deduced a trap composed of 168 places in 256 ms of which 0 ms to minimize.
[2023-03-24 06:22:25] [INFO ] Deduced a trap composed of 174 places in 266 ms of which 0 ms to minimize.
[2023-03-24 06:22:26] [INFO ] Deduced a trap composed of 162 places in 263 ms of which 1 ms to minimize.
[2023-03-24 06:22:27] [INFO ] Deduced a trap composed of 166 places in 255 ms of which 0 ms to minimize.
[2023-03-24 06:22:27] [INFO ] Deduced a trap composed of 184 places in 250 ms of which 1 ms to minimize.
[2023-03-24 06:22:27] [INFO ] Deduced a trap composed of 168 places in 258 ms of which 1 ms to minimize.
[2023-03-24 06:22:28] [INFO ] Deduced a trap composed of 164 places in 255 ms of which 0 ms to minimize.
[2023-03-24 06:22:28] [INFO ] Deduced a trap composed of 168 places in 248 ms of which 0 ms to minimize.
[2023-03-24 06:22:28] [INFO ] Deduced a trap composed of 170 places in 255 ms of which 0 ms to minimize.
[2023-03-24 06:22:29] [INFO ] Deduced a trap composed of 170 places in 266 ms of which 0 ms to minimize.
[2023-03-24 06:22:29] [INFO ] Deduced a trap composed of 170 places in 261 ms of which 1 ms to minimize.
[2023-03-24 06:22:30] [INFO ] Deduced a trap composed of 164 places in 253 ms of which 1 ms to minimize.
[2023-03-24 06:22:31] [INFO ] Deduced a trap composed of 176 places in 277 ms of which 1 ms to minimize.
[2023-03-24 06:22:35] [INFO ] Trap strengthening (SAT) tested/added 55/55 trap constraints in 23929 ms
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.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-24 06:22:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 06:22:35] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 984/984 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 413 transition count 983
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 412 transition count 983
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 412 transition count 981
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 410 transition count 981
Applied a total of 6 rules in 74 ms. Remains 410 /413 variables (removed 3) and now considering 981/984 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 410/413 places, 981/984 transitions.
Incomplete random walk after 10000 steps, including 730 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 343932 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 343932 steps, saw 56606 distinct states, run finished after 3005 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 06:22:38] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-24 06:22:38] [INFO ] Computed 62 place invariants in 11 ms
[2023-03-24 06:22:38] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-24 06:22:38] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 13 ms returned sat
[2023-03-24 06:22:38] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 06:22:38] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-24 06:22:38] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 14 ms returned sat
[2023-03-24 06:22:38] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 06:22:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:22:39] [INFO ] After 390ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 06:22:39] [INFO ] Deduced a trap composed of 181 places in 264 ms of which 1 ms to minimize.
[2023-03-24 06:22:39] [INFO ] Deduced a trap composed of 166 places in 258 ms of which 0 ms to minimize.
[2023-03-24 06:22:40] [INFO ] Deduced a trap composed of 167 places in 244 ms of which 1 ms to minimize.
[2023-03-24 06:22:40] [INFO ] Deduced a trap composed of 160 places in 263 ms of which 0 ms to minimize.
[2023-03-24 06:22:40] [INFO ] Deduced a trap composed of 160 places in 250 ms of which 1 ms to minimize.
[2023-03-24 06:22:41] [INFO ] Deduced a trap composed of 164 places in 260 ms of which 0 ms to minimize.
[2023-03-24 06:22:41] [INFO ] Deduced a trap composed of 164 places in 254 ms of which 1 ms to minimize.
[2023-03-24 06:22:41] [INFO ] Deduced a trap composed of 162 places in 255 ms of which 1 ms to minimize.
[2023-03-24 06:22:42] [INFO ] Deduced a trap composed of 160 places in 254 ms of which 0 ms to minimize.
[2023-03-24 06:22:42] [INFO ] Deduced a trap composed of 160 places in 276 ms of which 1 ms to minimize.
[2023-03-24 06:22:42] [INFO ] Deduced a trap composed of 170 places in 255 ms of which 0 ms to minimize.
[2023-03-24 06:22:43] [INFO ] Deduced a trap composed of 164 places in 247 ms of which 1 ms to minimize.
[2023-03-24 06:22:43] [INFO ] Deduced a trap composed of 172 places in 255 ms of which 1 ms to minimize.
[2023-03-24 06:22:43] [INFO ] Deduced a trap composed of 162 places in 253 ms of which 0 ms to minimize.
[2023-03-24 06:22:44] [INFO ] Deduced a trap composed of 169 places in 272 ms of which 0 ms to minimize.
[2023-03-24 06:22:44] [INFO ] Deduced a trap composed of 173 places in 264 ms of which 1 ms to minimize.
[2023-03-24 06:22:44] [INFO ] Deduced a trap composed of 166 places in 252 ms of which 0 ms to minimize.
[2023-03-24 06:22:45] [INFO ] Deduced a trap composed of 164 places in 251 ms of which 0 ms to minimize.
[2023-03-24 06:22:45] [INFO ] Deduced a trap composed of 177 places in 249 ms of which 0 ms to minimize.
[2023-03-24 06:22:46] [INFO ] Deduced a trap composed of 160 places in 257 ms of which 0 ms to minimize.
[2023-03-24 06:22:46] [INFO ] Deduced a trap composed of 171 places in 252 ms of which 1 ms to minimize.
[2023-03-24 06:22:47] [INFO ] Deduced a trap composed of 175 places in 269 ms of which 1 ms to minimize.
[2023-03-24 06:22:47] [INFO ] Deduced a trap composed of 162 places in 259 ms of which 1 ms to minimize.
[2023-03-24 06:22:48] [INFO ] Deduced a trap composed of 166 places in 261 ms of which 1 ms to minimize.
[2023-03-24 06:22:48] [INFO ] Deduced a trap composed of 164 places in 252 ms of which 0 ms to minimize.
[2023-03-24 06:22:49] [INFO ] Deduced a trap composed of 160 places in 262 ms of which 1 ms to minimize.
[2023-03-24 06:22:51] [INFO ] Deduced a trap composed of 166 places in 259 ms of which 1 ms to minimize.
[2023-03-24 06:22:52] [INFO ] Deduced a trap composed of 176 places in 274 ms of which 1 ms to minimize.
[2023-03-24 06:22:52] [INFO ] Deduced a trap composed of 156 places in 257 ms of which 0 ms to minimize.
[2023-03-24 06:22:52] [INFO ] Deduced a trap composed of 164 places in 262 ms of which 0 ms to minimize.
[2023-03-24 06:22:53] [INFO ] Deduced a trap composed of 170 places in 258 ms of which 0 ms to minimize.
[2023-03-24 06:22:53] [INFO ] Deduced a trap composed of 162 places in 255 ms of which 0 ms to minimize.
[2023-03-24 06:22:53] [INFO ] Deduced a trap composed of 166 places in 268 ms of which 0 ms to minimize.
[2023-03-24 06:22:54] [INFO ] Deduced a trap composed of 160 places in 255 ms of which 0 ms to minimize.
[2023-03-24 06:22:54] [INFO ] Deduced a trap composed of 173 places in 255 ms of which 0 ms to minimize.
[2023-03-24 06:22:55] [INFO ] Deduced a trap composed of 170 places in 261 ms of which 0 ms to minimize.
[2023-03-24 06:22:55] [INFO ] Deduced a trap composed of 179 places in 257 ms of which 0 ms to minimize.
[2023-03-24 06:22:59] [INFO ] Deduced a trap composed of 154 places in 257 ms of which 1 ms to minimize.
[2023-03-24 06:23:00] [INFO ] Deduced a trap composed of 158 places in 244 ms of which 0 ms to minimize.
[2023-03-24 06:23:00] [INFO ] Deduced a trap composed of 171 places in 246 ms of which 0 ms to minimize.
[2023-03-24 06:23:01] [INFO ] Deduced a trap composed of 160 places in 244 ms of which 0 ms to minimize.
[2023-03-24 06:23:03] [INFO ] Trap strengthening (SAT) tested/added 41/41 trap constraints in 24152 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-24 06:23:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 06:23:03] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 32 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 30 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-24 06:23:03] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-24 06:23:03] [INFO ] Invariant cache hit.
[2023-03-24 06:23:03] [INFO ] Implicit Places using invariants in 479 ms returned []
[2023-03-24 06:23:03] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-24 06:23:03] [INFO ] Invariant cache hit.
[2023-03-24 06:23:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:23:06] [INFO ] Implicit Places using invariants and state equation in 2914 ms returned []
Implicit Place search using SMT with State Equation took 3396 ms to find 0 implicit places.
[2023-03-24 06:23:06] [INFO ] Redundant transitions in 69 ms returned []
[2023-03-24 06:23:06] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-24 06:23:06] [INFO ] Invariant cache hit.
[2023-03-24 06:23:07] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4020 ms. Remains : 410/410 places, 981/981 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 410 transition count 972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 410 transition count 971
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 409 transition count 971
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 409 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 408 transition count 970
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 408 transition count 960
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 398 transition count 960
Applied a total of 33 rules in 102 ms. Remains 398 /410 variables (removed 12) and now considering 960/981 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 960 rows 398 cols
[2023-03-24 06:23:07] [INFO ] Computed 62 place invariants in 10 ms
[2023-03-24 06:23:07] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-24 06:23:07] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 12 ms returned sat
[2023-03-24 06:23:08] [INFO ] After 385ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 06:23:08] [INFO ] Deduced a trap composed of 175 places in 216 ms of which 0 ms to minimize.
[2023-03-24 06:23:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2023-03-24 06:23:08] [INFO ] After 687ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 06:23:08] [INFO ] After 778ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 06:23:08] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-24 06:23:08] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 13 ms returned sat
[2023-03-24 06:23:09] [INFO ] After 657ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 06:23:09] [INFO ] Deduced a trap composed of 154 places in 217 ms of which 0 ms to minimize.
[2023-03-24 06:23:09] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 1 ms to minimize.
[2023-03-24 06:23:09] [INFO ] Deduced a trap composed of 176 places in 223 ms of which 1 ms to minimize.
[2023-03-24 06:23:10] [INFO ] Deduced a trap composed of 158 places in 227 ms of which 0 ms to minimize.
[2023-03-24 06:23:10] [INFO ] Deduced a trap composed of 158 places in 218 ms of which 1 ms to minimize.
[2023-03-24 06:23:10] [INFO ] Deduced a trap composed of 158 places in 217 ms of which 0 ms to minimize.
[2023-03-24 06:23:10] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 1 ms to minimize.
[2023-03-24 06:23:11] [INFO ] Deduced a trap composed of 168 places in 216 ms of which 1 ms to minimize.
[2023-03-24 06:23:11] [INFO ] Deduced a trap composed of 160 places in 224 ms of which 0 ms to minimize.
[2023-03-24 06:23:11] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 1 ms to minimize.
[2023-03-24 06:23:11] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 1 ms to minimize.
[2023-03-24 06:23:12] [INFO ] Deduced a trap composed of 174 places in 217 ms of which 0 ms to minimize.
[2023-03-24 06:23:12] [INFO ] Deduced a trap composed of 160 places in 224 ms of which 1 ms to minimize.
[2023-03-24 06:23:12] [INFO ] Deduced a trap composed of 156 places in 219 ms of which 0 ms to minimize.
[2023-03-24 06:23:12] [INFO ] Deduced a trap composed of 154 places in 215 ms of which 0 ms to minimize.
[2023-03-24 06:23:13] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 1 ms to minimize.
[2023-03-24 06:23:13] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 0 ms to minimize.
[2023-03-24 06:23:13] [INFO ] Deduced a trap composed of 158 places in 183 ms of which 1 ms to minimize.
[2023-03-24 06:23:13] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 0 ms to minimize.
[2023-03-24 06:23:14] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 0 ms to minimize.
[2023-03-24 06:23:14] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 0 ms to minimize.
[2023-03-24 06:23:14] [INFO ] Deduced a trap composed of 156 places in 219 ms of which 1 ms to minimize.
[2023-03-24 06:23:14] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 0 ms to minimize.
[2023-03-24 06:23:15] [INFO ] Deduced a trap composed of 154 places in 212 ms of which 1 ms to minimize.
[2023-03-24 06:23:15] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 1 ms to minimize.
[2023-03-24 06:23:15] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 1 ms to minimize.
[2023-03-24 06:23:15] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 0 ms to minimize.
[2023-03-24 06:23:16] [INFO ] Deduced a trap composed of 158 places in 217 ms of which 1 ms to minimize.
[2023-03-24 06:23:16] [INFO ] Deduced a trap composed of 156 places in 211 ms of which 0 ms to minimize.
[2023-03-24 06:23:16] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 1 ms to minimize.
[2023-03-24 06:23:16] [INFO ] Deduced a trap composed of 154 places in 219 ms of which 1 ms to minimize.
[2023-03-24 06:23:17] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2023-03-24 06:23:17] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 0 ms to minimize.
[2023-03-24 06:23:17] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 1 ms to minimize.
[2023-03-24 06:23:17] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 0 ms to minimize.
[2023-03-24 06:23:18] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 0 ms to minimize.
[2023-03-24 06:23:18] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 0 ms to minimize.
[2023-03-24 06:23:18] [INFO ] Deduced a trap composed of 156 places in 221 ms of which 0 ms to minimize.
[2023-03-24 06:23:18] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 0 ms to minimize.
[2023-03-24 06:23:19] [INFO ] Deduced a trap composed of 175 places in 209 ms of which 1 ms to minimize.
[2023-03-24 06:23:19] [INFO ] Deduced a trap composed of 170 places in 221 ms of which 0 ms to minimize.
[2023-03-24 06:23:19] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 1 ms to minimize.
[2023-03-24 06:23:19] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 1 ms to minimize.
[2023-03-24 06:23:20] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 1 ms to minimize.
[2023-03-24 06:23:20] [INFO ] Deduced a trap composed of 158 places in 229 ms of which 0 ms to minimize.
[2023-03-24 06:23:20] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2023-03-24 06:23:20] [INFO ] Deduced a trap composed of 168 places in 219 ms of which 4 ms to minimize.
[2023-03-24 06:23:21] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 0 ms to minimize.
[2023-03-24 06:23:21] [INFO ] Deduced a trap composed of 168 places in 212 ms of which 0 ms to minimize.
[2023-03-24 06:23:21] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 1 ms to minimize.
[2023-03-24 06:23:21] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 0 ms to minimize.
[2023-03-24 06:23:22] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 0 ms to minimize.
[2023-03-24 06:23:22] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 1 ms to minimize.
[2023-03-24 06:23:22] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 1 ms to minimize.
[2023-03-24 06:23:22] [INFO ] Deduced a trap composed of 160 places in 214 ms of which 0 ms to minimize.
[2023-03-24 06:23:23] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 1 ms to minimize.
[2023-03-24 06:23:23] [INFO ] Deduced a trap composed of 159 places in 211 ms of which 1 ms to minimize.
[2023-03-24 06:23:23] [INFO ] Deduced a trap composed of 168 places in 214 ms of which 1 ms to minimize.
[2023-03-24 06:23:23] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 0 ms to minimize.
[2023-03-24 06:23:24] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 0 ms to minimize.
[2023-03-24 06:23:24] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 1 ms to minimize.
[2023-03-24 06:23:24] [INFO ] Deduced a trap composed of 172 places in 213 ms of which 1 ms to minimize.
[2023-03-24 06:23:24] [INFO ] Deduced a trap composed of 175 places in 216 ms of which 1 ms to minimize.
[2023-03-24 06:23:25] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 1 ms to minimize.
[2023-03-24 06:23:25] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 1 ms to minimize.
[2023-03-24 06:23:25] [INFO ] Deduced a trap composed of 152 places in 215 ms of which 0 ms to minimize.
[2023-03-24 06:23:25] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 1 ms to minimize.
[2023-03-24 06:23:26] [INFO ] Deduced a trap composed of 172 places in 221 ms of which 1 ms to minimize.
[2023-03-24 06:23:26] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 1 ms to minimize.
[2023-03-24 06:23:26] [INFO ] Deduced a trap composed of 158 places in 225 ms of which 0 ms to minimize.
[2023-03-24 06:23:26] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 0 ms to minimize.
[2023-03-24 06:23:27] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 0 ms to minimize.
[2023-03-24 06:23:27] [INFO ] Deduced a trap composed of 157 places in 225 ms of which 1 ms to minimize.
[2023-03-24 06:23:27] [INFO ] Deduced a trap composed of 175 places in 228 ms of which 1 ms to minimize.
[2023-03-24 06:23:28] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 1 ms to minimize.
[2023-03-24 06:23:28] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 0 ms to minimize.
[2023-03-24 06:23:28] [INFO ] Deduced a trap composed of 170 places in 222 ms of which 0 ms to minimize.
[2023-03-24 06:23:28] [INFO ] Deduced a trap composed of 175 places in 225 ms of which 0 ms to minimize.
[2023-03-24 06:23:29] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 0 ms to minimize.
[2023-03-24 06:23:29] [INFO ] Deduced a trap composed of 170 places in 221 ms of which 0 ms to minimize.
[2023-03-24 06:23:29] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 0 ms to minimize.
[2023-03-24 06:23:29] [INFO ] Deduced a trap composed of 154 places in 216 ms of which 1 ms to minimize.
[2023-03-24 06:23:30] [INFO ] Deduced a trap composed of 158 places in 223 ms of which 0 ms to minimize.
[2023-03-24 06:23:30] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 0 ms to minimize.
[2023-03-24 06:23:30] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 0 ms to minimize.
[2023-03-24 06:23:32] [INFO ] Deduced a trap composed of 179 places in 219 ms of which 0 ms to minimize.
[2023-03-24 06:23:32] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 1 ms to minimize.
[2023-03-24 06:23:35] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 1 ms to minimize.
[2023-03-24 06:23:36] [INFO ] Deduced a trap composed of 158 places in 231 ms of which 2 ms to minimize.
[2023-03-24 06:23:36] [INFO ] Deduced a trap composed of 166 places in 223 ms of which 1 ms to minimize.
[2023-03-24 06:23:36] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 1 ms to minimize.
[2023-03-24 06:23:37] [INFO ] Deduced a trap composed of 158 places in 217 ms of which 0 ms to minimize.
[2023-03-24 06:23:37] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 1 ms to minimize.
[2023-03-24 06:23:38] [INFO ] Deduced a trap composed of 156 places in 210 ms of which 1 ms to minimize.
[2023-03-24 06:23:38] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 0 ms to minimize.
[2023-03-24 06:23:38] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 0 ms to minimize.
[2023-03-24 06:23:38] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 1 ms to minimize.
[2023-03-24 06:23:39] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 0 ms to minimize.
[2023-03-24 06:23:39] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 0 ms to minimize.
[2023-03-24 06:23:39] [INFO ] Deduced a trap composed of 158 places in 219 ms of which 1 ms to minimize.
[2023-03-24 06:23:39] [INFO ] Deduced a trap composed of 156 places in 216 ms of which 0 ms to minimize.
[2023-03-24 06:23:40] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 1 ms to minimize.
[2023-03-24 06:23:40] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 1 ms to minimize.
[2023-03-24 06:23:40] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 0 ms to minimize.
[2023-03-24 06:23:40] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 1 ms to minimize.
[2023-03-24 06:23:41] [INFO ] Deduced a trap composed of 158 places in 214 ms of which 2 ms to minimize.
[2023-03-24 06:23:50] [INFO ] Trap strengthening (SAT) tested/added 106/106 trap constraints in 40994 ms
[2023-03-24 06:23:50] [INFO ] After 42045ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-24 06:23:50] [INFO ] After 42134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
FORMULA PolyORBNT-PT-S10J20-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!((F(p0)||X(G(p1))))'
Support contains 24 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1035/1035 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 463 transition count 1034
Applied a total of 5 rules in 18 ms. Remains 463 /467 variables (removed 4) and now considering 1034/1035 (removed 1) transitions.
[2023-03-24 06:23:50] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2023-03-24 06:23:50] [INFO ] Computed 62 place invariants in 11 ms
[2023-03-24 06:23:51] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
[2023-03-24 06:23:51] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:23:51] [INFO ] Invariant cache hit.
[2023-03-24 06:23:52] [INFO ] Implicit Places using invariants in 472 ms returned []
[2023-03-24 06:23:52] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:23:52] [INFO ] Invariant cache hit.
[2023-03-24 06:23:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:23:56] [INFO ] Implicit Places using invariants and state equation in 3945 ms returned []
Implicit Place search using SMT with State Equation took 4419 ms to find 0 implicit places.
[2023-03-24 06:23:56] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:23:56] [INFO ] Invariant cache hit.
[2023-03-24 06:23:56] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/467 places, 1034/1035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5978 ms. Remains : 463/467 places, 1034/1035 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s256 1), p1:(AND (OR (LT s4 1) (LT s243 1) (LT s389 1)) (OR (LT s4 1) (LT s32 1) (LT s243 1)) (OR (LT s4 1) (LT s243 1) (LT s390 1)) (OR (LT s4 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5601 reset in 1107 ms.
Product exploration explored 100000 steps with 5601 reset in 1029 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 239 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 559 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 170566 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 170566 steps, saw 48866 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-24 06:24:03] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:24:03] [INFO ] Invariant cache hit.
[2023-03-24 06:24:03] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2023-03-24 06:24:03] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 24 ms returned sat
[2023-03-24 06:24:03] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-24 06:24:03] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-24 06:24:03] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 19 ms returned sat
[2023-03-24 06:24:04] [INFO ] After 1193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-24 06:24:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:24:05] [INFO ] After 701ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-24 06:24:05] [INFO ] After 1083ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 234 ms.
[2023-03-24 06:24:05] [INFO ] After 2680ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 24 out of 463 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 463/463 places, 1034/1034 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 463 transition count 1010
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 439 transition count 1009
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 438 transition count 1009
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 50 place count 438 transition count 984
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 100 place count 413 transition count 984
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 412 transition count 983
Applied a total of 102 rules in 69 ms. Remains 412 /463 variables (removed 51) and now considering 983/1034 (removed 51) transitions.
[2023-03-24 06:24:05] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2023-03-24 06:24:05] [INFO ] Computed 62 place invariants in 11 ms
[2023-03-24 06:24:06] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 614 ms. Remains : 412/463 places, 983/1034 transitions.
Finished random walk after 26 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=13 )
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 p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 292 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 24 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 1034/1034 transitions.
Applied a total of 0 rules in 7 ms. Remains 463 /463 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
[2023-03-24 06:24:07] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2023-03-24 06:24:07] [INFO ] Computed 62 place invariants in 15 ms
[2023-03-24 06:24:07] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
[2023-03-24 06:24:07] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:24:07] [INFO ] Invariant cache hit.
[2023-03-24 06:24:08] [INFO ] Implicit Places using invariants in 491 ms returned []
[2023-03-24 06:24:08] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:24:08] [INFO ] Invariant cache hit.
[2023-03-24 06:24:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:24:13] [INFO ] Implicit Places using invariants and state equation in 5176 ms returned []
Implicit Place search using SMT with State Equation took 5670 ms to find 0 implicit places.
[2023-03-24 06:24:13] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:24:13] [INFO ] Invariant cache hit.
[2023-03-24 06:24:14] [INFO ] Dead Transitions using invariants and state equation in 767 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7215 ms. Remains : 463/463 places, 1034/1034 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 p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 237 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 559 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 169526 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 169526 steps, saw 48506 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-24 06:24:18] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:24:18] [INFO ] Invariant cache hit.
[2023-03-24 06:24:18] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-24 06:24:18] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 18 ms returned sat
[2023-03-24 06:24:18] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-24 06:24:18] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-24 06:24:18] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 20 ms returned sat
[2023-03-24 06:24:19] [INFO ] After 1216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-24 06:24:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:24:20] [INFO ] After 708ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-24 06:24:20] [INFO ] After 1049ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 238 ms.
[2023-03-24 06:24:20] [INFO ] After 2645ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 24 out of 463 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 463/463 places, 1034/1034 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 463 transition count 1010
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 439 transition count 1009
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 438 transition count 1009
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 50 place count 438 transition count 984
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 100 place count 413 transition count 984
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 412 transition count 983
Applied a total of 102 rules in 61 ms. Remains 412 /463 variables (removed 51) and now considering 983/1034 (removed 51) transitions.
[2023-03-24 06:24:20] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2023-03-24 06:24:20] [INFO ] Computed 62 place invariants in 16 ms
[2023-03-24 06:24:21] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 604 ms. Remains : 412/463 places, 983/1034 transitions.
Finished random walk after 33 steps, including 1 resets, run visited all 3 properties in 2 ms. (steps per millisecond=16 )
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 p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 277 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5605 reset in 978 ms.
Product exploration explored 100000 steps with 5605 reset in 997 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 24 out of 463 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 463/463 places, 1034/1034 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 463 transition count 1034
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 24 place count 463 transition count 1035
Deduced a syphon composed of 26 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 463 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 462 transition count 1034
Deduced a syphon composed of 25 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 462 transition count 1034
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 53 place count 462 transition count 1034
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 76 place count 439 transition count 1011
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 99 place count 439 transition count 1011
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 99 rules in 123 ms. Remains 439 /463 variables (removed 24) and now considering 1011/1034 (removed 23) transitions.
[2023-03-24 06:24:24] [INFO ] Flow matrix only has 1002 transitions (discarded 9 similar events)
// Phase 1: matrix 1002 rows 439 cols
[2023-03-24 06:24:24] [INFO ] Computed 62 place invariants in 11 ms
[2023-03-24 06:24:25] [INFO ] Dead Transitions using invariants and state equation in 773 ms found 0 transitions.
[2023-03-24 06:24:25] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-24 06:24:25] [INFO ] Flow matrix only has 1002 transitions (discarded 9 similar events)
[2023-03-24 06:24:25] [INFO ] Invariant cache hit.
[2023-03-24 06:24:25] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 439/463 places, 1011/1034 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1587 ms. Remains : 439/463 places, 1011/1034 transitions.
Support contains 24 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 1034/1034 transitions.
Applied a total of 0 rules in 11 ms. Remains 463 /463 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
[2023-03-24 06:24:25] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2023-03-24 06:24:25] [INFO ] Computed 62 place invariants in 10 ms
[2023-03-24 06:24:26] [INFO ] Dead Transitions using invariants and state equation in 778 ms found 0 transitions.
[2023-03-24 06:24:26] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:24:26] [INFO ] Invariant cache hit.
[2023-03-24 06:24:27] [INFO ] Implicit Places using invariants in 493 ms returned []
[2023-03-24 06:24:27] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:24:27] [INFO ] Invariant cache hit.
[2023-03-24 06:24:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:24:32] [INFO ] Implicit Places using invariants and state equation in 4936 ms returned []
Implicit Place search using SMT with State Equation took 5431 ms to find 0 implicit places.
[2023-03-24 06:24:32] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:24:32] [INFO ] Invariant cache hit.
[2023-03-24 06:24:32] [INFO ] Dead Transitions using invariants and state equation in 762 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6984 ms. Remains : 463/463 places, 1034/1034 transitions.
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-00 finished in 42331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 1035/1035 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 464 transition count 1011
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 440 transition count 1010
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 439 transition count 1010
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 50 place count 439 transition count 986
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 98 place count 415 transition count 986
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 414 transition count 985
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 414 transition count 985
Applied a total of 100 rules in 63 ms. Remains 414 /467 variables (removed 53) and now considering 985/1035 (removed 50) transitions.
[2023-03-24 06:24:33] [INFO ] Flow matrix only has 976 transitions (discarded 9 similar events)
// Phase 1: matrix 976 rows 414 cols
[2023-03-24 06:24:33] [INFO ] Computed 62 place invariants in 15 ms
[2023-03-24 06:24:33] [INFO ] Dead Transitions using invariants and state equation in 640 ms found 0 transitions.
[2023-03-24 06:24:33] [INFO ] Flow matrix only has 976 transitions (discarded 9 similar events)
[2023-03-24 06:24:33] [INFO ] Invariant cache hit.
[2023-03-24 06:24:34] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-03-24 06:24:34] [INFO ] Flow matrix only has 976 transitions (discarded 9 similar events)
[2023-03-24 06:24:34] [INFO ] Invariant cache hit.
[2023-03-24 06:24:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:24:40] [INFO ] Implicit Places using invariants and state equation in 5901 ms returned []
Implicit Place search using SMT with State Equation took 6371 ms to find 0 implicit places.
[2023-03-24 06:24:40] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-24 06:24:40] [INFO ] Flow matrix only has 976 transitions (discarded 9 similar events)
[2023-03-24 06:24:40] [INFO ] Invariant cache hit.
[2023-03-24 06:24:40] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 414/467 places, 985/1035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7630 ms. Remains : 414/467 places, 985/1035 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s229 1), p1:(LT s186 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7309 reset in 843 ms.
Product exploration explored 100000 steps with 7256 reset in 875 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)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 3 factoid took 206 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 43 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
[2023-03-24 06:24:43] [INFO ] Flow matrix only has 976 transitions (discarded 9 similar events)
[2023-03-24 06:24:43] [INFO ] Invariant cache hit.
[2023-03-24 06:24:43] [INFO ] [Real]Absence check using 46 positive place invariants in 21 ms returned sat
[2023-03-24 06:24:43] [INFO ] [Real]Absence check using 46 positive and 16 generalized place invariants in 41 ms returned sat
[2023-03-24 06:24:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:24:45] [INFO ] [Real]Absence check using state equation in 1582 ms returned sat
[2023-03-24 06:24:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:24:45] [INFO ] [Nat]Absence check using 46 positive place invariants in 26 ms returned sat
[2023-03-24 06:24:45] [INFO ] [Nat]Absence check using 46 positive and 16 generalized place invariants in 23 ms returned sat
[2023-03-24 06:24:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:24:47] [INFO ] [Nat]Absence check using state equation in 1700 ms returned sat
[2023-03-24 06:24:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:24:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 2211 ms returned sat
[2023-03-24 06:24:49] [INFO ] Computed and/alt/rep : 643/2597/643 causal constraints (skipped 322 transitions) in 119 ms.
[2023-03-24 06:24:50] [INFO ] Added : 14 causal constraints over 4 iterations in 462 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 414 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 414/414 places, 985/985 transitions.
Applied a total of 0 rules in 24 ms. Remains 414 /414 variables (removed 0) and now considering 985/985 (removed 0) transitions.
[2023-03-24 06:24:50] [INFO ] Flow matrix only has 976 transitions (discarded 9 similar events)
[2023-03-24 06:24:50] [INFO ] Invariant cache hit.
[2023-03-24 06:24:50] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
[2023-03-24 06:24:50] [INFO ] Flow matrix only has 976 transitions (discarded 9 similar events)
[2023-03-24 06:24:50] [INFO ] Invariant cache hit.
[2023-03-24 06:24:51] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-03-24 06:24:51] [INFO ] Flow matrix only has 976 transitions (discarded 9 similar events)
[2023-03-24 06:24:51] [INFO ] Invariant cache hit.
[2023-03-24 06:24:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:24:57] [INFO ] Implicit Places using invariants and state equation in 5943 ms returned []
Implicit Place search using SMT with State Equation took 6408 ms to find 0 implicit places.
[2023-03-24 06:24:57] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-24 06:24:57] [INFO ] Flow matrix only has 976 transitions (discarded 9 similar events)
[2023-03-24 06:24:57] [INFO ] Invariant cache hit.
[2023-03-24 06:24:57] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7537 ms. Remains : 414/414 places, 985/985 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 p1)]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 112 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 37 ms :[(NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 1 factoid took 146 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 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
[2023-03-24 06:24:58] [INFO ] Flow matrix only has 976 transitions (discarded 9 similar events)
[2023-03-24 06:24:58] [INFO ] Invariant cache hit.
[2023-03-24 06:24:58] [INFO ] [Real]Absence check using 46 positive place invariants in 19 ms returned sat
[2023-03-24 06:24:58] [INFO ] [Real]Absence check using 46 positive and 16 generalized place invariants in 41 ms returned sat
[2023-03-24 06:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:25:00] [INFO ] [Real]Absence check using state equation in 1599 ms returned sat
[2023-03-24 06:25:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:25:00] [INFO ] [Nat]Absence check using 46 positive place invariants in 26 ms returned sat
[2023-03-24 06:25:00] [INFO ] [Nat]Absence check using 46 positive and 16 generalized place invariants in 23 ms returned sat
[2023-03-24 06:25:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:25:02] [INFO ] [Nat]Absence check using state equation in 1698 ms returned sat
[2023-03-24 06:25:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:25:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 2281 ms returned sat
[2023-03-24 06:25:04] [INFO ] Computed and/alt/rep : 643/2597/643 causal constraints (skipped 322 transitions) in 142 ms.
[2023-03-24 06:25:05] [INFO ] Added : 14 causal constraints over 4 iterations in 479 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Product exploration explored 100000 steps with 7349 reset in 833 ms.
Product exploration explored 100000 steps with 7294 reset in 842 ms.
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 414/414 places, 985/985 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 412 transition count 983
Applied a total of 4 rules in 28 ms. Remains 412 /414 variables (removed 2) and now considering 983/985 (removed 2) transitions.
[2023-03-24 06:25:07] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2023-03-24 06:25:07] [INFO ] Computed 62 place invariants in 24 ms
[2023-03-24 06:25:07] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
[2023-03-24 06:25:07] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:25:07] [INFO ] Invariant cache hit.
[2023-03-24 06:25:08] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-03-24 06:25:08] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:25:08] [INFO ] Invariant cache hit.
[2023-03-24 06:25:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:25:12] [INFO ] Implicit Places using invariants and state equation in 4032 ms returned []
Implicit Place search using SMT with State Equation took 4493 ms to find 0 implicit places.
[2023-03-24 06:25:12] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-24 06:25:12] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:25:12] [INFO ] Invariant cache hit.
[2023-03-24 06:25:12] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 412/414 places, 983/985 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5636 ms. Remains : 412/414 places, 983/985 transitions.
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-02 finished in 39701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 12 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1035/1035 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 463 transition count 1034
Applied a total of 5 rules in 25 ms. Remains 463 /467 variables (removed 4) and now considering 1034/1035 (removed 1) transitions.
[2023-03-24 06:25:12] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2023-03-24 06:25:12] [INFO ] Computed 62 place invariants in 10 ms
[2023-03-24 06:25:13] [INFO ] Dead Transitions using invariants and state equation in 844 ms found 0 transitions.
[2023-03-24 06:25:13] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:25:13] [INFO ] Invariant cache hit.
[2023-03-24 06:25:14] [INFO ] Implicit Places using invariants in 409 ms returned []
[2023-03-24 06:25:14] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:25:14] [INFO ] Invariant cache hit.
[2023-03-24 06:25:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:25:18] [INFO ] Implicit Places using invariants and state equation in 4807 ms returned []
Implicit Place search using SMT with State Equation took 5217 ms to find 0 implicit places.
[2023-03-24 06:25:18] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:25:18] [INFO ] Invariant cache hit.
[2023-03-24 06:25:19] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/467 places, 1034/1035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6856 ms. Remains : 463/467 places, 1034/1035 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s213 1) (GEQ s250 1) (GEQ s312 9)) (AND (GEQ s250 1) (GEQ s312 9) (GEQ s435 1)) (AND (GEQ s171 1) (GEQ s250 1) (GEQ s312 9)) (AND (GEQ s2...], 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 16 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-03 finished in 6933 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)&&F(!p0)))'
Support contains 1 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1035/1035 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 463 transition count 1034
Applied a total of 5 rules in 21 ms. Remains 463 /467 variables (removed 4) and now considering 1034/1035 (removed 1) transitions.
[2023-03-24 06:25:19] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:25:19] [INFO ] Invariant cache hit.
[2023-03-24 06:25:20] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
[2023-03-24 06:25:20] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:25:20] [INFO ] Invariant cache hit.
[2023-03-24 06:25:20] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-03-24 06:25:20] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:25:20] [INFO ] Invariant cache hit.
[2023-03-24 06:25:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:25:24] [INFO ] Implicit Places using invariants and state equation in 3314 ms returned []
Implicit Place search using SMT with State Equation took 3766 ms to find 0 implicit places.
[2023-03-24 06:25:24] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:25:24] [INFO ] Invariant cache hit.
[2023-03-24 06:25:24] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/467 places, 1034/1035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5223 ms. Remains : 463/467 places, 1034/1035 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), p0, true]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s64 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 16088 reset in 838 ms.
Product exploration explored 100000 steps with 16006 reset in 762 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[p0]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[p0]
Stuttering acceptance computed with spot in 27 ms :[p0]
[2023-03-24 06:25:27] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:25:27] [INFO ] Invariant cache hit.
[2023-03-24 06:25:27] [INFO ] [Real]Absence check using 45 positive place invariants in 19 ms returned sat
[2023-03-24 06:25:27] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 55 ms returned sat
[2023-03-24 06:25:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:25:28] [INFO ] [Real]Absence check using state equation in 940 ms returned sat
[2023-03-24 06:25:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:25:29] [INFO ] [Nat]Absence check using 45 positive place invariants in 20 ms returned sat
[2023-03-24 06:25:29] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 53 ms returned sat
[2023-03-24 06:25:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:25:30] [INFO ] [Nat]Absence check using state equation in 839 ms returned sat
[2023-03-24 06:25:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:25:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 81 ms returned sat
[2023-03-24 06:25:30] [INFO ] Computed and/alt/rep : 691/2267/691 causal constraints (skipped 323 transitions) in 99 ms.
[2023-03-24 06:25:30] [INFO ] Added : 33 causal constraints over 8 iterations in 608 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 463 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 463/463 places, 1034/1034 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 463 transition count 1010
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 439 transition count 1009
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 438 transition count 1009
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 50 place count 438 transition count 985
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 98 place count 414 transition count 985
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 3 with 6 rules applied. Total rules applied 104 place count 411 transition count 982
Applied a total of 104 rules in 55 ms. Remains 411 /463 variables (removed 52) and now considering 982/1034 (removed 52) transitions.
[2023-03-24 06:25:31] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2023-03-24 06:25:31] [INFO ] Computed 62 place invariants in 16 ms
[2023-03-24 06:25:31] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
[2023-03-24 06:25:31] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2023-03-24 06:25:31] [INFO ] Invariant cache hit.
[2023-03-24 06:25:32] [INFO ] Implicit Places using invariants in 485 ms returned []
[2023-03-24 06:25:32] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2023-03-24 06:25:32] [INFO ] Invariant cache hit.
[2023-03-24 06:25:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:25:35] [INFO ] Implicit Places using invariants and state equation in 3741 ms returned []
Implicit Place search using SMT with State Equation took 4230 ms to find 0 implicit places.
[2023-03-24 06:25:35] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-24 06:25:35] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2023-03-24 06:25:35] [INFO ] Invariant cache hit.
[2023-03-24 06:25:36] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/463 places, 982/1034 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5349 ms. Remains : 411/463 places, 982/1034 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[p0]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[p0]
Stuttering acceptance computed with spot in 31 ms :[p0]
[2023-03-24 06:25:36] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2023-03-24 06:25:36] [INFO ] Invariant cache hit.
[2023-03-24 06:25:37] [INFO ] [Real]Absence check using 45 positive place invariants in 17 ms returned sat
[2023-03-24 06:25:37] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 84 ms returned sat
[2023-03-24 06:25:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:25:37] [INFO ] [Real]Absence check using state equation in 722 ms returned sat
[2023-03-24 06:25:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:25:38] [INFO ] [Nat]Absence check using 45 positive place invariants in 20 ms returned sat
[2023-03-24 06:25:38] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 31 ms returned sat
[2023-03-24 06:25:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:25:39] [INFO ] [Nat]Absence check using state equation in 1081 ms returned sat
[2023-03-24 06:25:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:25:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2023-03-24 06:25:39] [INFO ] Computed and/alt/rep : 641/2592/641 causal constraints (skipped 321 transitions) in 67 ms.
[2023-03-24 06:25:39] [INFO ] Added : 8 causal constraints over 2 iterations in 240 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 34 ms :[p0]
Product exploration explored 100000 steps with 14122 reset in 664 ms.
Product exploration explored 100000 steps with 14263 reset in 666 ms.
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 18 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2023-03-24 06:25:41] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2023-03-24 06:25:41] [INFO ] Invariant cache hit.
[2023-03-24 06:25:41] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
[2023-03-24 06:25:41] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2023-03-24 06:25:41] [INFO ] Invariant cache hit.
[2023-03-24 06:25:42] [INFO ] Implicit Places using invariants in 524 ms returned []
[2023-03-24 06:25:42] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2023-03-24 06:25:42] [INFO ] Invariant cache hit.
[2023-03-24 06:25:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:25:46] [INFO ] Implicit Places using invariants and state equation in 4743 ms returned []
Implicit Place search using SMT with State Equation took 5269 ms to find 0 implicit places.
[2023-03-24 06:25:46] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-24 06:25:46] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2023-03-24 06:25:46] [INFO ] Invariant cache hit.
[2023-03-24 06:25:47] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6390 ms. Remains : 411/411 places, 982/982 transitions.
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-04 finished in 27780 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 1 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 1035/1035 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 464 transition count 1009
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 438 transition count 1009
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 52 place count 438 transition count 985
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 100 place count 414 transition count 985
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 413 transition count 984
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 413 transition count 984
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 106 place count 411 transition count 982
Applied a total of 106 rules in 52 ms. Remains 411 /467 variables (removed 56) and now considering 982/1035 (removed 53) transitions.
[2023-03-24 06:25:47] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2023-03-24 06:25:47] [INFO ] Computed 62 place invariants in 18 ms
[2023-03-24 06:25:48] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
[2023-03-24 06:25:48] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2023-03-24 06:25:48] [INFO ] Invariant cache hit.
[2023-03-24 06:25:48] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-03-24 06:25:48] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2023-03-24 06:25:48] [INFO ] Invariant cache hit.
[2023-03-24 06:25:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:25:51] [INFO ] Implicit Places using invariants and state equation in 3145 ms returned []
Implicit Place search using SMT with State Equation took 3610 ms to find 0 implicit places.
[2023-03-24 06:25:51] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-24 06:25:51] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2023-03-24 06:25:51] [INFO ] Invariant cache hit.
[2023-03-24 06:25:52] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/467 places, 982/1035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4819 ms. Remains : 411/467 places, 982/1035 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s159 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9470 reset in 740 ms.
Product exploration explored 100000 steps with 9455 reset in 759 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2023-03-24 06:25:54] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2023-03-24 06:25:54] [INFO ] Invariant cache hit.
[2023-03-24 06:25:54] [INFO ] [Real]Absence check using 45 positive place invariants in 18 ms returned sat
[2023-03-24 06:25:54] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 34 ms returned sat
[2023-03-24 06:25:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:25:55] [INFO ] [Real]Absence check using state equation in 1046 ms returned sat
[2023-03-24 06:25:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:25:56] [INFO ] [Nat]Absence check using 45 positive place invariants in 18 ms returned sat
[2023-03-24 06:25:56] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 29 ms returned sat
[2023-03-24 06:25:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:25:57] [INFO ] [Nat]Absence check using state equation in 869 ms returned sat
[2023-03-24 06:25:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:25:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 20 ms returned sat
[2023-03-24 06:25:57] [INFO ] Computed and/alt/rep : 641/2592/641 causal constraints (skipped 321 transitions) in 73 ms.
[2023-03-24 06:25:57] [INFO ] Added : 6 causal constraints over 2 iterations in 292 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 24 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2023-03-24 06:25:57] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2023-03-24 06:25:57] [INFO ] Invariant cache hit.
[2023-03-24 06:25:58] [INFO ] Dead Transitions using invariants and state equation in 574 ms found 0 transitions.
[2023-03-24 06:25:58] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2023-03-24 06:25:58] [INFO ] Invariant cache hit.
[2023-03-24 06:25:58] [INFO ] Implicit Places using invariants in 474 ms returned []
[2023-03-24 06:25:58] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2023-03-24 06:25:58] [INFO ] Invariant cache hit.
[2023-03-24 06:25:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:26:01] [INFO ] Implicit Places using invariants and state equation in 3061 ms returned []
Implicit Place search using SMT with State Equation took 3539 ms to find 0 implicit places.
[2023-03-24 06:26:01] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-24 06:26:01] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2023-03-24 06:26:01] [INFO ] Invariant cache hit.
[2023-03-24 06:26:02] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4722 ms. Remains : 411/411 places, 982/982 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-03-24 06:26:02] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2023-03-24 06:26:02] [INFO ] Invariant cache hit.
[2023-03-24 06:26:02] [INFO ] [Real]Absence check using 45 positive place invariants in 17 ms returned sat
[2023-03-24 06:26:02] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 34 ms returned sat
[2023-03-24 06:26:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:26:03] [INFO ] [Real]Absence check using state equation in 1023 ms returned sat
[2023-03-24 06:26:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:26:04] [INFO ] [Nat]Absence check using 45 positive place invariants in 18 ms returned sat
[2023-03-24 06:26:04] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 28 ms returned sat
[2023-03-24 06:26:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:26:05] [INFO ] [Nat]Absence check using state equation in 851 ms returned sat
[2023-03-24 06:26:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:26:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 23 ms returned sat
[2023-03-24 06:26:05] [INFO ] Computed and/alt/rep : 641/2592/641 causal constraints (skipped 321 transitions) in 75 ms.
[2023-03-24 06:26:05] [INFO ] Added : 6 causal constraints over 2 iterations in 294 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 9479 reset in 745 ms.
Product exploration explored 100000 steps with 9473 reset in 763 ms.
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 17 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2023-03-24 06:26:07] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2023-03-24 06:26:07] [INFO ] Invariant cache hit.
[2023-03-24 06:26:07] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
[2023-03-24 06:26:07] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2023-03-24 06:26:07] [INFO ] Invariant cache hit.
[2023-03-24 06:26:08] [INFO ] Implicit Places using invariants in 460 ms returned []
[2023-03-24 06:26:08] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2023-03-24 06:26:08] [INFO ] Invariant cache hit.
[2023-03-24 06:26:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:26:11] [INFO ] Implicit Places using invariants and state equation in 2975 ms returned []
Implicit Place search using SMT with State Equation took 3436 ms to find 0 implicit places.
[2023-03-24 06:26:11] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-24 06:26:11] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2023-03-24 06:26:11] [INFO ] Invariant cache hit.
[2023-03-24 06:26:11] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4631 ms. Remains : 411/411 places, 982/982 transitions.
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-05 finished in 24242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 24 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 1035/1035 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 464 transition count 1009
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 438 transition count 1009
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 52 place count 438 transition count 984
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 102 place count 413 transition count 984
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 412 transition count 983
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 412 transition count 983
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 108 place count 410 transition count 981
Applied a total of 108 rules in 55 ms. Remains 410 /467 variables (removed 57) and now considering 981/1035 (removed 54) transitions.
[2023-03-24 06:26:11] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-24 06:26:11] [INFO ] Computed 62 place invariants in 10 ms
[2023-03-24 06:26:12] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
[2023-03-24 06:26:12] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-24 06:26:12] [INFO ] Invariant cache hit.
[2023-03-24 06:26:12] [INFO ] Implicit Places using invariants in 445 ms returned []
[2023-03-24 06:26:12] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-24 06:26:12] [INFO ] Invariant cache hit.
[2023-03-24 06:26:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:26:15] [INFO ] Implicit Places using invariants and state equation in 2417 ms returned []
Implicit Place search using SMT with State Equation took 2864 ms to find 0 implicit places.
[2023-03-24 06:26:15] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-24 06:26:15] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-24 06:26:15] [INFO ] Invariant cache hit.
[2023-03-24 06:26:15] [INFO ] Dead Transitions using invariants and state equation in 556 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 410/467 places, 981/1035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4153 ms. Remains : 410/467 places, 981/1035 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s378 4), p1:(OR (AND (GEQ s4 1) (GEQ s132 1) (GEQ s366 1)) (AND (GEQ s4 1) (GEQ s118 1) (GEQ s366 1)) (AND (GEQ s4 1) (GEQ s145 1) (GEQ s366 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-06 finished in 4300 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 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 1035/1035 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 464 transition count 1011
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 440 transition count 1011
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 48 place count 440 transition count 985
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 100 place count 414 transition count 985
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 104 place count 412 transition count 983
Applied a total of 104 rules in 53 ms. Remains 412 /467 variables (removed 55) and now considering 983/1035 (removed 52) transitions.
[2023-03-24 06:26:16] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2023-03-24 06:26:16] [INFO ] Computed 62 place invariants in 14 ms
[2023-03-24 06:26:16] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
[2023-03-24 06:26:16] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:26:16] [INFO ] Invariant cache hit.
[2023-03-24 06:26:17] [INFO ] Implicit Places using invariants in 486 ms returned []
[2023-03-24 06:26:17] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:26:17] [INFO ] Invariant cache hit.
[2023-03-24 06:26:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:26:20] [INFO ] Implicit Places using invariants and state equation in 3049 ms returned []
Implicit Place search using SMT with State Equation took 3537 ms to find 0 implicit places.
[2023-03-24 06:26:20] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-24 06:26:20] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:26:20] [INFO ] Invariant cache hit.
[2023-03-24 06:26:20] [INFO ] Dead Transitions using invariants and state equation in 507 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 412/467 places, 983/1035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4701 ms. Remains : 412/467 places, 983/1035 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s136 1)], 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 7188 reset in 812 ms.
Product exploration explored 100000 steps with 7122 reset in 842 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 148 steps, including 11 resets, run visited all 1 properties in 4 ms. (steps per millisecond=37 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 129 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 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 1 out of 412 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 412/412 places, 983/983 transitions.
Applied a total of 0 rules in 22 ms. Remains 412 /412 variables (removed 0) and now considering 983/983 (removed 0) transitions.
[2023-03-24 06:26:22] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:26:22] [INFO ] Invariant cache hit.
[2023-03-24 06:26:23] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
[2023-03-24 06:26:23] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:26:23] [INFO ] Invariant cache hit.
[2023-03-24 06:26:23] [INFO ] Implicit Places using invariants in 487 ms returned []
[2023-03-24 06:26:23] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:26:23] [INFO ] Invariant cache hit.
[2023-03-24 06:26:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:26:26] [INFO ] Implicit Places using invariants and state equation in 3120 ms returned []
Implicit Place search using SMT with State Equation took 3613 ms to find 0 implicit places.
[2023-03-24 06:26:26] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-24 06:26:26] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:26:26] [INFO ] Invariant cache hit.
[2023-03-24 06:26:27] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4715 ms. Remains : 412/412 places, 983/983 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 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 71 steps, including 5 resets, run visited all 1 properties in 2 ms. (steps per millisecond=35 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7215 reset in 806 ms.
Product exploration explored 100000 steps with 7256 reset in 820 ms.
Support contains 1 out of 412 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 412/412 places, 983/983 transitions.
Applied a total of 0 rules in 15 ms. Remains 412 /412 variables (removed 0) and now considering 983/983 (removed 0) transitions.
[2023-03-24 06:26:29] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:26:29] [INFO ] Invariant cache hit.
[2023-03-24 06:26:30] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
[2023-03-24 06:26:30] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:26:30] [INFO ] Invariant cache hit.
[2023-03-24 06:26:30] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-24 06:26:30] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:26:30] [INFO ] Invariant cache hit.
[2023-03-24 06:26:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:26:33] [INFO ] Implicit Places using invariants and state equation in 3272 ms returned []
Implicit Place search using SMT with State Equation took 3743 ms to find 0 implicit places.
[2023-03-24 06:26:33] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-24 06:26:33] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:26:33] [INFO ] Invariant cache hit.
[2023-03-24 06:26:34] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4815 ms. Remains : 412/412 places, 983/983 transitions.
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-07 finished in 18316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 1035/1035 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 464 transition count 1010
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 439 transition count 1010
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 50 place count 439 transition count 987
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 96 place count 416 transition count 987
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 415 transition count 986
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 415 transition count 986
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 102 place count 413 transition count 984
Applied a total of 102 rules in 47 ms. Remains 413 /467 variables (removed 54) and now considering 984/1035 (removed 51) transitions.
[2023-03-24 06:26:34] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2023-03-24 06:26:34] [INFO ] Computed 62 place invariants in 17 ms
[2023-03-24 06:26:35] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
[2023-03-24 06:26:35] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
[2023-03-24 06:26:35] [INFO ] Invariant cache hit.
[2023-03-24 06:26:35] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-03-24 06:26:35] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
[2023-03-24 06:26:35] [INFO ] Invariant cache hit.
[2023-03-24 06:26:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:26:39] [INFO ] Implicit Places using invariants and state equation in 4333 ms returned []
Implicit Place search using SMT with State Equation took 4805 ms to find 0 implicit places.
[2023-03-24 06:26:39] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-24 06:26:39] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
[2023-03-24 06:26:39] [INFO ] Invariant cache hit.
[2023-03-24 06:26:40] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 413/467 places, 984/1035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6036 ms. Remains : 413/467 places, 984/1035 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s160 1), p1:(GEQ s242 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-09 finished in 6166 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' '!(((!p0 U G(p0))||(G(!p0)&&X(p1))))'
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1035/1035 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 463 transition count 1034
Applied a total of 5 rules in 19 ms. Remains 463 /467 variables (removed 4) and now considering 1034/1035 (removed 1) transitions.
[2023-03-24 06:26:40] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2023-03-24 06:26:40] [INFO ] Computed 62 place invariants in 14 ms
[2023-03-24 06:26:41] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
[2023-03-24 06:26:41] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:26:41] [INFO ] Invariant cache hit.
[2023-03-24 06:26:41] [INFO ] Implicit Places using invariants in 527 ms returned []
[2023-03-24 06:26:41] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:26:41] [INFO ] Invariant cache hit.
[2023-03-24 06:26:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:26:44] [INFO ] Implicit Places using invariants and state equation in 2524 ms returned []
Implicit Place search using SMT with State Equation took 3053 ms to find 0 implicit places.
[2023-03-24 06:26:44] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:26:44] [INFO ] Invariant cache hit.
[2023-03-24 06:26:45] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/467 places, 1034/1035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4583 ms. Remains : 463/467 places, 1034/1035 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (AND (NOT p0) (NOT p1)), false, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 3}], [{ cond=p0, acceptance={0} source=5 dest: 3}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(GEQ s256 1), p1:(GEQ s21 1)], 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-10 finished in 4802 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&(F(G(p0))||G(p1))))))'
Support contains 4 out of 467 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1035/1035 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 465 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 464 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 464 transition count 1034
Applied a total of 4 rules in 22 ms. Remains 464 /467 variables (removed 3) and now considering 1034/1035 (removed 1) transitions.
[2023-03-24 06:26:45] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 464 cols
[2023-03-24 06:26:45] [INFO ] Computed 63 place invariants in 16 ms
[2023-03-24 06:26:46] [INFO ] Dead Transitions using invariants and state equation in 778 ms found 0 transitions.
[2023-03-24 06:26:46] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:26:46] [INFO ] Invariant cache hit.
[2023-03-24 06:26:46] [INFO ] Implicit Places using invariants in 511 ms returned []
[2023-03-24 06:26:46] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:26:46] [INFO ] Invariant cache hit.
[2023-03-24 06:26:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:26:52] [INFO ] Implicit Places using invariants and state equation in 6088 ms returned []
Implicit Place search using SMT with State Equation took 6601 ms to find 0 implicit places.
[2023-03-24 06:26:52] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:26:52] [INFO ] Invariant cache hit.
[2023-03-24 06:26:53] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 464/467 places, 1034/1035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8158 ms. Remains : 464/467 places, 1034/1035 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s47 1) (LT s193 1) (LT s313 1) (LT s450 1))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 1 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-11 finished in 8263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1) U p2)))'
Support contains 8 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 1035/1035 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 465 transition count 1012
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 442 transition count 1011
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 441 transition count 1011
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 48 place count 441 transition count 988
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 94 place count 418 transition count 988
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 417 transition count 987
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 417 transition count 987
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 416 transition count 986
Applied a total of 98 rules in 58 ms. Remains 416 /467 variables (removed 51) and now considering 986/1035 (removed 49) transitions.
[2023-03-24 06:26:53] [INFO ] Flow matrix only has 977 transitions (discarded 9 similar events)
// Phase 1: matrix 977 rows 416 cols
[2023-03-24 06:26:53] [INFO ] Computed 63 place invariants in 16 ms
[2023-03-24 06:26:54] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
[2023-03-24 06:26:54] [INFO ] Flow matrix only has 977 transitions (discarded 9 similar events)
[2023-03-24 06:26:54] [INFO ] Invariant cache hit.
[2023-03-24 06:26:54] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-24 06:26:54] [INFO ] Flow matrix only has 977 transitions (discarded 9 similar events)
[2023-03-24 06:26:54] [INFO ] Invariant cache hit.
[2023-03-24 06:26:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:26:56] [INFO ] Implicit Places using invariants and state equation in 2056 ms returned []
Implicit Place search using SMT with State Equation took 2517 ms to find 0 implicit places.
[2023-03-24 06:26:56] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-24 06:26:56] [INFO ] Flow matrix only has 977 transitions (discarded 9 similar events)
[2023-03-24 06:26:56] [INFO ] Invariant cache hit.
[2023-03-24 06:26:57] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 416/467 places, 986/1035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3805 ms. Remains : 416/467 places, 986/1035 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), true, (NOT p1), (NOT p2)]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s175 1) (GEQ s198 1) (GEQ s222 1) (GEQ s279 1)), p1:(GEQ s19 1), p0:(AND (GEQ s227 1) (GEQ s279 8) (GEQ s346 1) (GEQ s391 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-12 finished in 3960 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((!p1 U (p2||G(!p1)))))))'
Support contains 7 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1035/1035 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 463 transition count 1034
Applied a total of 5 rules in 20 ms. Remains 463 /467 variables (removed 4) and now considering 1034/1035 (removed 1) transitions.
[2023-03-24 06:26:57] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2023-03-24 06:26:57] [INFO ] Computed 62 place invariants in 20 ms
[2023-03-24 06:26:58] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
[2023-03-24 06:26:58] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:26:58] [INFO ] Invariant cache hit.
[2023-03-24 06:26:58] [INFO ] Implicit Places using invariants in 501 ms returned []
[2023-03-24 06:26:58] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:26:58] [INFO ] Invariant cache hit.
[2023-03-24 06:26:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:27:03] [INFO ] Implicit Places using invariants and state equation in 4970 ms returned []
Implicit Place search using SMT with State Equation took 5473 ms to find 0 implicit places.
[2023-03-24 06:27:03] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 06:27:03] [INFO ] Invariant cache hit.
[2023-03-24 06:27:04] [INFO ] Dead Transitions using invariants and state equation in 747 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/467 places, 1034/1035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6993 ms. Remains : 463/467 places, 1034/1035 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND (NOT p2) p1)]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s280 1) (LT s369 1)), p2:(AND (NOT (AND (GEQ s250 1) (GEQ s312 8) (GEQ s391 2))) (NOT (AND (GEQ s1 1) (GEQ s303 1)))), p1:(AND (GEQ s1 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 760 ms.
Product exploration explored 100000 steps with 33333 reset in 779 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p2 (NOT p1))
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S10J20-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-15 finished in 8827 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)||X(G(p1))))'
Found a Lengthening insensitive property : PolyORBNT-PT-S10J20-LTLFireability-00
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 24 out of 467 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 467/467 places, 1035/1035 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 464 transition count 1010
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 439 transition count 1009
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 438 transition count 1009
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 52 place count 438 transition count 984
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 102 place count 413 transition count 984
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 412 transition count 983
Applied a total of 104 rules in 50 ms. Remains 412 /467 variables (removed 55) and now considering 983/1035 (removed 52) transitions.
[2023-03-24 06:27:06] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2023-03-24 06:27:06] [INFO ] Computed 62 place invariants in 22 ms
[2023-03-24 06:27:07] [INFO ] Dead Transitions using invariants and state equation in 557 ms found 0 transitions.
[2023-03-24 06:27:07] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:27:07] [INFO ] Invariant cache hit.
[2023-03-24 06:27:07] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-24 06:27:07] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:27:07] [INFO ] Invariant cache hit.
[2023-03-24 06:27:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:27:09] [INFO ] Implicit Places using invariants and state equation in 1854 ms returned []
Implicit Place search using SMT with State Equation took 2294 ms to find 0 implicit places.
[2023-03-24 06:27:09] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:27:09] [INFO ] Invariant cache hit.
[2023-03-24 06:27:10] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 412/467 places, 983/1035 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3409 ms. Remains : 412/467 places, 983/1035 transitions.
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s227 1), p1:(AND (OR (LT s4 1) (LT s218 1) (LT s346 1)) (OR (LT s4 1) (LT s28 1) (LT s218 1)) (OR (LT s4 1) (LT s218 1) (LT s347 1)) (OR (LT s4 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8068 reset in 1024 ms.
Product exploration explored 100000 steps with 8096 reset in 1048 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 210 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 47 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=23 )
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 p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 269 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 24 out of 412 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 412/412 places, 983/983 transitions.
Applied a total of 0 rules in 5 ms. Remains 412 /412 variables (removed 0) and now considering 983/983 (removed 0) transitions.
[2023-03-24 06:27:12] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:27:12] [INFO ] Invariant cache hit.
[2023-03-24 06:27:13] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
[2023-03-24 06:27:13] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:27:13] [INFO ] Invariant cache hit.
[2023-03-24 06:27:13] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-03-24 06:27:13] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:27:13] [INFO ] Invariant cache hit.
[2023-03-24 06:27:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:27:17] [INFO ] Implicit Places using invariants and state equation in 3139 ms returned []
Implicit Place search using SMT with State Equation took 3600 ms to find 0 implicit places.
[2023-03-24 06:27:17] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:27:17] [INFO ] Invariant cache hit.
[2023-03-24 06:27:17] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4616 ms. Remains : 412/412 places, 983/983 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 p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 181 steps, including 12 resets, run visited all 3 properties in 9 ms. (steps per millisecond=20 )
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 p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 269 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8054 reset in 1027 ms.
Product exploration explored 100000 steps with 8111 reset in 1051 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 24 out of 412 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 412/412 places, 983/983 transitions.
Applied a total of 0 rules in 15 ms. Remains 412 /412 variables (removed 0) and now considering 983/983 (removed 0) transitions.
[2023-03-24 06:27:20] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:27:20] [INFO ] Invariant cache hit.
[2023-03-24 06:27:21] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
[2023-03-24 06:27:21] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-24 06:27:21] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:27:21] [INFO ] Invariant cache hit.
[2023-03-24 06:27:21] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1040 ms. Remains : 412/412 places, 983/983 transitions.
Support contains 24 out of 412 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 412/412 places, 983/983 transitions.
Applied a total of 0 rules in 5 ms. Remains 412 /412 variables (removed 0) and now considering 983/983 (removed 0) transitions.
[2023-03-24 06:27:21] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:27:21] [INFO ] Invariant cache hit.
[2023-03-24 06:27:22] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
[2023-03-24 06:27:22] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:27:22] [INFO ] Invariant cache hit.
[2023-03-24 06:27:22] [INFO ] Implicit Places using invariants in 443 ms returned []
[2023-03-24 06:27:22] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:27:22] [INFO ] Invariant cache hit.
[2023-03-24 06:27:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:27:24] [INFO ] Implicit Places using invariants and state equation in 1773 ms returned []
Implicit Place search using SMT with State Equation took 2218 ms to find 0 implicit places.
[2023-03-24 06:27:24] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2023-03-24 06:27:24] [INFO ] Invariant cache hit.
[2023-03-24 06:27:24] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3215 ms. Remains : 412/412 places, 983/983 transitions.
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-00 finished in 18595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
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)&&F(!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' '!(F(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' '!(F(G(p0)))'
[2023-03-24 06:27:25] [INFO ] Flatten gal took : 85 ms
[2023-03-24 06:27:25] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-24 06:27:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 467 places, 1035 transitions and 6790 arcs took 9 ms.
Total runtime 349212 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2684/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2684/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2684/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2684/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2684/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PolyORBNT-PT-S10J20-LTLFireability-00
Could not compute solution for formula : PolyORBNT-PT-S10J20-LTLFireability-02
Could not compute solution for formula : PolyORBNT-PT-S10J20-LTLFireability-04
Could not compute solution for formula : PolyORBNT-PT-S10J20-LTLFireability-05
Could not compute solution for formula : PolyORBNT-PT-S10J20-LTLFireability-07

BK_STOP 1679639249085

--------------------
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-PT-S10J20-LTLFireability-00
ltl formula formula --ltl=/tmp/2684/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 467 places, 1035 transitions and 6790 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2684/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2684/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2684/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.060 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2684/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name PolyORBNT-PT-S10J20-LTLFireability-02
ltl formula formula --ltl=/tmp/2684/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 467 places, 1035 transitions and 6790 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2684/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2684/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2684/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.390 real 0.050 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2684/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name PolyORBNT-PT-S10J20-LTLFireability-04
ltl formula formula --ltl=/tmp/2684/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 467 places, 1035 transitions and 6790 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.400 real 0.050 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2684/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2684/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2684/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2684/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name PolyORBNT-PT-S10J20-LTLFireability-05
ltl formula formula --ltl=/tmp/2684/ltl_3_
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: =============================================================================
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 467 places, 1035 transitions and 6790 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.350 real 0.040 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2684/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2684/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2684/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2684/ltl_3_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name PolyORBNT-PT-S10J20-LTLFireability-07
ltl formula formula --ltl=/tmp/2684/ltl_4_
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 467 places, 1035 transitions and 6790 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.370 real 0.060 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2684/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2684/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2684/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2684/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S10J20"
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-PT-S10J20, 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-167873950900756"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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