About the Execution of LoLa+red for Peterson-PT-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2107.327 | 963254.00 | 1086582.00 | 3264.90 | TF?FFFFFTTFFFF?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r263-smll-167863538500628.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 lolaxred
Input is Peterson-PT-5, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538500628
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.3M
-rw-r--r-- 1 mcc users 139K Feb 25 22:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 565K Feb 25 22:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 124K Feb 25 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 584K Feb 25 22:22 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 64K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 201K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 48K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 166K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 161K Feb 25 22:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 668K Feb 25 22:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 189K Feb 25 22:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 841K Feb 25 22:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 535K 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 Peterson-PT-5-LTLFireability-00
FORMULA_NAME Peterson-PT-5-LTLFireability-01
FORMULA_NAME Peterson-PT-5-LTLFireability-02
FORMULA_NAME Peterson-PT-5-LTLFireability-03
FORMULA_NAME Peterson-PT-5-LTLFireability-04
FORMULA_NAME Peterson-PT-5-LTLFireability-05
FORMULA_NAME Peterson-PT-5-LTLFireability-06
FORMULA_NAME Peterson-PT-5-LTLFireability-07
FORMULA_NAME Peterson-PT-5-LTLFireability-08
FORMULA_NAME Peterson-PT-5-LTLFireability-09
FORMULA_NAME Peterson-PT-5-LTLFireability-10
FORMULA_NAME Peterson-PT-5-LTLFireability-11
FORMULA_NAME Peterson-PT-5-LTLFireability-12
FORMULA_NAME Peterson-PT-5-LTLFireability-13
FORMULA_NAME Peterson-PT-5-LTLFireability-14
FORMULA_NAME Peterson-PT-5-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678864349471
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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-5
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 07:12:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 07:12:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 07:12:33] [INFO ] Load time of PNML (sax parser for PT used): 267 ms
[2023-03-15 07:12:33] [INFO ] Transformed 834 places.
[2023-03-15 07:12:33] [INFO ] Transformed 1242 transitions.
[2023-03-15 07:12:33] [INFO ] Found NUPN structural information;
[2023-03-15 07:12:33] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_1_3_5, IsEndLoop_2_1_5, BeginLoop_5_4_3, BeginLoop_3_4_3, BeginLoop_4_4_3, BeginLoop_4_1_5, BeginLoop_3_1_5, BeginLoop_5_1_5, BeginLoop_1_4_5, TestAlone_0_1_4, TestIdentity_1_3_3, TestIdentity_2_3_3, TestIdentity_0_0_2, TestIdentity_1_4_1, TestIdentity_4_4_1, TestIdentity_3_4_1, TestIdentity_5_3_2, TestIdentity_0_4_2, TestIdentity_1_4_2, TestIdentity_3_3_2, TestIdentity_4_3_2, TestIdentity_5_2_2]
[2023-03-15 07:12:33] [INFO ] Parsed PT model containing 834 places and 1242 transitions and 3828 arcs in 543 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-PT-5-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 653 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 63 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:12:33] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 07:12:33] [INFO ] Computed 23 place invariants in 30 ms
[2023-03-15 07:12:34] [INFO ] Implicit Places using invariants in 628 ms returned []
[2023-03-15 07:12:34] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:12:34] [INFO ] Invariant cache hit.
[2023-03-15 07:12:35] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:12:35] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 1665 ms to find 0 implicit places.
[2023-03-15 07:12:35] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:12:35] [INFO ] Invariant cache hit.
[2023-03-15 07:12:36] [INFO ] Dead Transitions using invariants and state equation in 1065 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2798 ms. Remains : 834/834 places, 1242/1242 transitions.
Support contains 653 out of 834 places after structural reductions.
[2023-03-15 07:12:36] [INFO ] Flatten gal took : 152 ms
[2023-03-15 07:12:37] [INFO ] Flatten gal took : 116 ms
[2023-03-15 07:12:37] [INFO ] Input system was already deterministic with 1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 835 ms. (steps per millisecond=11 ) properties (out of 30) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-15 07:12:39] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:12:39] [INFO ] Invariant cache hit.
[2023-03-15 07:12:40] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2023-03-15 07:12:40] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-15 07:12:41] [INFO ] After 2527ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-15 07:12:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2023-03-15 07:12:42] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-15 07:12:44] [INFO ] After 1454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-15 07:12:44] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:12:45] [INFO ] After 1314ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-15 07:12:46] [INFO ] Deduced a trap composed of 26 places in 613 ms of which 22 ms to minimize.
[2023-03-15 07:12:46] [INFO ] Deduced a trap composed of 112 places in 811 ms of which 3 ms to minimize.
[2023-03-15 07:12:47] [INFO ] Deduced a trap composed of 132 places in 758 ms of which 2 ms to minimize.
[2023-03-15 07:12:48] [INFO ] Deduced a trap composed of 141 places in 735 ms of which 2 ms to minimize.
[2023-03-15 07:12:49] [INFO ] Deduced a trap composed of 167 places in 678 ms of which 3 ms to minimize.
[2023-03-15 07:12:50] [INFO ] Deduced a trap composed of 79 places in 807 ms of which 1 ms to minimize.
[2023-03-15 07:12:50] [INFO ] Deduced a trap composed of 51 places in 724 ms of which 1 ms to minimize.
[2023-03-15 07:12:51] [INFO ] Deduced a trap composed of 106 places in 776 ms of which 2 ms to minimize.
[2023-03-15 07:12:52] [INFO ] Deduced a trap composed of 43 places in 782 ms of which 1 ms to minimize.
[2023-03-15 07:12:53] [INFO ] Deduced a trap composed of 17 places in 702 ms of which 1 ms to minimize.
[2023-03-15 07:12:54] [INFO ] Deduced a trap composed of 119 places in 570 ms of which 1 ms to minimize.
[2023-03-15 07:12:54] [INFO ] Deduced a trap composed of 99 places in 618 ms of which 1 ms to minimize.
[2023-03-15 07:12:55] [INFO ] Deduced a trap composed of 55 places in 607 ms of which 1 ms to minimize.
[2023-03-15 07:12:56] [INFO ] Deduced a trap composed of 229 places in 587 ms of which 1 ms to minimize.
[2023-03-15 07:12:56] [INFO ] Deduced a trap composed of 73 places in 791 ms of which 2 ms to minimize.
[2023-03-15 07:12:57] [INFO ] Deduced a trap composed of 167 places in 527 ms of which 1 ms to minimize.
[2023-03-15 07:12:58] [INFO ] Deduced a trap composed of 67 places in 609 ms of which 1 ms to minimize.
[2023-03-15 07:12:58] [INFO ] Deduced a trap composed of 123 places in 604 ms of which 1 ms to minimize.
[2023-03-15 07:12:59] [INFO ] Deduced a trap composed of 126 places in 834 ms of which 1 ms to minimize.
[2023-03-15 07:13:00] [INFO ] Deduced a trap composed of 108 places in 763 ms of which 4 ms to minimize.
[2023-03-15 07:13:01] [INFO ] Deduced a trap composed of 67 places in 768 ms of which 2 ms to minimize.
[2023-03-15 07:13:02] [INFO ] Deduced a trap composed of 52 places in 809 ms of which 1 ms to minimize.
[2023-03-15 07:13:03] [INFO ] Deduced a trap composed of 49 places in 815 ms of which 1 ms to minimize.
[2023-03-15 07:13:04] [INFO ] Deduced a trap composed of 49 places in 818 ms of which 1 ms to minimize.
[2023-03-15 07:13:04] [INFO ] Deduced a trap composed of 22 places in 809 ms of which 1 ms to minimize.
[2023-03-15 07:13:05] [INFO ] Deduced a trap composed of 18 places in 809 ms of which 1 ms to minimize.
[2023-03-15 07:13:06] [INFO ] Deduced a trap composed of 74 places in 845 ms of which 1 ms to minimize.
[2023-03-15 07:13:07] [INFO ] Deduced a trap composed of 27 places in 822 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 07:13:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 07:13:07] [INFO ] After 25702ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 108 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 0 with 338 rules applied. Total rules applied 338 place count 834 transition count 904
Reduce places removed 338 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 341 rules applied. Total rules applied 679 place count 496 transition count 901
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 682 place count 493 transition count 901
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 153 Pre rules applied. Total rules applied 682 place count 493 transition count 748
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 988 place count 340 transition count 748
Applied a total of 988 rules in 163 ms. Remains 340 /834 variables (removed 494) and now considering 748/1242 (removed 494) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 340/834 places, 748/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 593 ms. (steps per millisecond=16 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-15 07:13:09] [INFO ] Flow matrix only has 628 transitions (discarded 120 similar events)
// Phase 1: matrix 628 rows 340 cols
[2023-03-15 07:13:09] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-15 07:13:09] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-03-15 07:13:09] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-15 07:13:11] [INFO ] After 1755ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-15 07:13:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-15 07:13:11] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-15 07:13:12] [INFO ] After 987ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-15 07:13:12] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:13:13] [INFO ] After 696ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-15 07:13:13] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 1 ms to minimize.
[2023-03-15 07:13:13] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 1 ms to minimize.
[2023-03-15 07:13:13] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 1 ms to minimize.
[2023-03-15 07:13:14] [INFO ] Deduced a trap composed of 29 places in 189 ms of which 1 ms to minimize.
[2023-03-15 07:13:14] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 0 ms to minimize.
[2023-03-15 07:13:14] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 1 ms to minimize.
[2023-03-15 07:13:14] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 7 ms to minimize.
[2023-03-15 07:13:14] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 1 ms to minimize.
[2023-03-15 07:13:15] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 1 ms to minimize.
[2023-03-15 07:13:15] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 0 ms to minimize.
[2023-03-15 07:13:15] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 1 ms to minimize.
[2023-03-15 07:13:15] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 2 ms to minimize.
[2023-03-15 07:13:15] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 0 ms to minimize.
[2023-03-15 07:13:16] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 0 ms to minimize.
[2023-03-15 07:13:16] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 1 ms to minimize.
[2023-03-15 07:13:16] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 0 ms to minimize.
[2023-03-15 07:13:16] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 0 ms to minimize.
[2023-03-15 07:13:16] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 1 ms to minimize.
[2023-03-15 07:13:16] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 0 ms to minimize.
[2023-03-15 07:13:17] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 0 ms to minimize.
[2023-03-15 07:13:17] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 1 ms to minimize.
[2023-03-15 07:13:17] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 1 ms to minimize.
[2023-03-15 07:13:17] [INFO ] Deduced a trap composed of 60 places in 150 ms of which 2 ms to minimize.
[2023-03-15 07:13:17] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 1 ms to minimize.
[2023-03-15 07:13:18] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 1 ms to minimize.
[2023-03-15 07:13:18] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 0 ms to minimize.
[2023-03-15 07:13:18] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 1 ms to minimize.
[2023-03-15 07:13:18] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2023-03-15 07:13:18] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 5499 ms
[2023-03-15 07:13:19] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 1 ms to minimize.
[2023-03-15 07:13:19] [INFO ] Deduced a trap composed of 69 places in 152 ms of which 0 ms to minimize.
[2023-03-15 07:13:19] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 1 ms to minimize.
[2023-03-15 07:13:19] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 1 ms to minimize.
[2023-03-15 07:13:20] [INFO ] Deduced a trap composed of 52 places in 146 ms of which 1 ms to minimize.
[2023-03-15 07:13:20] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 0 ms to minimize.
[2023-03-15 07:13:20] [INFO ] Deduced a trap composed of 48 places in 155 ms of which 1 ms to minimize.
[2023-03-15 07:13:20] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 0 ms to minimize.
[2023-03-15 07:13:20] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 0 ms to minimize.
[2023-03-15 07:13:21] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 1 ms to minimize.
[2023-03-15 07:13:21] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 1 ms to minimize.
[2023-03-15 07:13:21] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 6 ms to minimize.
[2023-03-15 07:13:21] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2023-03-15 07:13:21] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2023-03-15 07:13:22] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 1 ms to minimize.
[2023-03-15 07:13:22] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 1 ms to minimize.
[2023-03-15 07:13:22] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2023-03-15 07:13:22] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 0 ms to minimize.
[2023-03-15 07:13:22] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2023-03-15 07:13:23] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 1 ms to minimize.
[2023-03-15 07:13:23] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3903 ms
[2023-03-15 07:13:23] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 1 ms to minimize.
[2023-03-15 07:13:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2023-03-15 07:13:23] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2023-03-15 07:13:23] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2023-03-15 07:13:23] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2023-03-15 07:13:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 335 ms
[2023-03-15 07:13:23] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 1 ms to minimize.
[2023-03-15 07:13:24] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 1 ms to minimize.
[2023-03-15 07:13:24] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 1 ms to minimize.
[2023-03-15 07:13:24] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 0 ms to minimize.
[2023-03-15 07:13:24] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 0 ms to minimize.
[2023-03-15 07:13:24] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 0 ms to minimize.
[2023-03-15 07:13:24] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2023-03-15 07:13:24] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 0 ms to minimize.
[2023-03-15 07:13:25] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 1 ms to minimize.
[2023-03-15 07:13:25] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2023-03-15 07:13:25] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2023-03-15 07:13:25] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 1 ms to minimize.
[2023-03-15 07:13:25] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 1 ms to minimize.
[2023-03-15 07:13:26] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 1 ms to minimize.
[2023-03-15 07:13:26] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 1 ms to minimize.
[2023-03-15 07:13:26] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 1 ms to minimize.
[2023-03-15 07:13:26] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 1 ms to minimize.
[2023-03-15 07:13:26] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 1 ms to minimize.
[2023-03-15 07:13:26] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 1 ms to minimize.
[2023-03-15 07:13:27] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3260 ms
[2023-03-15 07:13:27] [INFO ] Deduced a trap composed of 57 places in 146 ms of which 0 ms to minimize.
[2023-03-15 07:13:27] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 0 ms to minimize.
[2023-03-15 07:13:27] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 0 ms to minimize.
[2023-03-15 07:13:27] [INFO ] Deduced a trap composed of 64 places in 169 ms of which 1 ms to minimize.
[2023-03-15 07:13:28] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 1 ms to minimize.
[2023-03-15 07:13:28] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 0 ms to minimize.
[2023-03-15 07:13:28] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 1 ms to minimize.
[2023-03-15 07:13:28] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 1 ms to minimize.
[2023-03-15 07:13:28] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 1 ms to minimize.
[2023-03-15 07:13:28] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 0 ms to minimize.
[2023-03-15 07:13:29] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 0 ms to minimize.
[2023-03-15 07:13:29] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 0 ms to minimize.
[2023-03-15 07:13:29] [INFO ] Deduced a trap composed of 58 places in 127 ms of which 0 ms to minimize.
[2023-03-15 07:13:29] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 0 ms to minimize.
[2023-03-15 07:13:29] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 1 ms to minimize.
[2023-03-15 07:13:30] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 1 ms to minimize.
[2023-03-15 07:13:30] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 1 ms to minimize.
[2023-03-15 07:13:30] [INFO ] Deduced a trap composed of 63 places in 125 ms of which 1 ms to minimize.
[2023-03-15 07:13:30] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 0 ms to minimize.
[2023-03-15 07:13:30] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 0 ms to minimize.
[2023-03-15 07:13:30] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3557 ms
[2023-03-15 07:13:30] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 1 ms to minimize.
[2023-03-15 07:13:30] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 0 ms to minimize.
[2023-03-15 07:13:31] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 1 ms to minimize.
[2023-03-15 07:13:31] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2023-03-15 07:13:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 616 ms
[2023-03-15 07:13:31] [INFO ] After 18830ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1107 ms.
[2023-03-15 07:13:32] [INFO ] After 21297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 283 ms.
Support contains 106 out of 340 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 340/340 places, 748/748 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 340 transition count 747
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 339 transition count 747
Applied a total of 2 rules in 47 ms. Remains 339 /340 variables (removed 1) and now considering 747/748 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 339/340 places, 747/748 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 339136 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 339136 steps, saw 50083 distinct states, run finished after 3003 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-15 07:13:36] [INFO ] Flow matrix only has 627 transitions (discarded 120 similar events)
// Phase 1: matrix 627 rows 339 cols
[2023-03-15 07:13:36] [INFO ] Computed 23 place invariants in 10 ms
[2023-03-15 07:13:37] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 07:13:37] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 07:13:37] [INFO ] After 1083ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-15 07:13:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-15 07:13:38] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 07:13:39] [INFO ] After 842ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-15 07:13:39] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:13:39] [INFO ] After 711ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-15 07:13:40] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 0 ms to minimize.
[2023-03-15 07:13:40] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 0 ms to minimize.
[2023-03-15 07:13:40] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 1 ms to minimize.
[2023-03-15 07:13:40] [INFO ] Deduced a trap composed of 59 places in 193 ms of which 0 ms to minimize.
[2023-03-15 07:13:40] [INFO ] Deduced a trap composed of 64 places in 177 ms of which 0 ms to minimize.
[2023-03-15 07:13:41] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 0 ms to minimize.
[2023-03-15 07:13:41] [INFO ] Deduced a trap composed of 50 places in 165 ms of which 0 ms to minimize.
[2023-03-15 07:13:41] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 0 ms to minimize.
[2023-03-15 07:13:41] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 1 ms to minimize.
[2023-03-15 07:13:41] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 0 ms to minimize.
[2023-03-15 07:13:42] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 1 ms to minimize.
[2023-03-15 07:13:42] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 0 ms to minimize.
[2023-03-15 07:13:42] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 1 ms to minimize.
[2023-03-15 07:13:42] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 1 ms to minimize.
[2023-03-15 07:13:42] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 0 ms to minimize.
[2023-03-15 07:13:42] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 0 ms to minimize.
[2023-03-15 07:13:43] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 0 ms to minimize.
[2023-03-15 07:13:43] [INFO ] Deduced a trap composed of 30 places in 175 ms of which 1 ms to minimize.
[2023-03-15 07:13:43] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 2 ms to minimize.
[2023-03-15 07:13:43] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 1 ms to minimize.
[2023-03-15 07:13:43] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 0 ms to minimize.
[2023-03-15 07:13:44] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 1 ms to minimize.
[2023-03-15 07:13:44] [INFO ] Deduced a trap composed of 65 places in 178 ms of which 0 ms to minimize.
[2023-03-15 07:13:44] [INFO ] Deduced a trap composed of 79 places in 169 ms of which 1 ms to minimize.
[2023-03-15 07:13:44] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 1 ms to minimize.
[2023-03-15 07:13:44] [INFO ] Deduced a trap composed of 79 places in 178 ms of which 0 ms to minimize.
[2023-03-15 07:13:45] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 0 ms to minimize.
[2023-03-15 07:13:45] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 0 ms to minimize.
[2023-03-15 07:13:45] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 0 ms to minimize.
[2023-03-15 07:13:45] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 0 ms to minimize.
[2023-03-15 07:13:45] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 1 ms to minimize.
[2023-03-15 07:13:46] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 1 ms to minimize.
[2023-03-15 07:13:46] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 6420 ms
[2023-03-15 07:13:46] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 0 ms to minimize.
[2023-03-15 07:13:47] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 1 ms to minimize.
[2023-03-15 07:13:47] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 1 ms to minimize.
[2023-03-15 07:13:47] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 1 ms to minimize.
[2023-03-15 07:13:47] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 0 ms to minimize.
[2023-03-15 07:13:47] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 1 ms to minimize.
[2023-03-15 07:13:47] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 0 ms to minimize.
[2023-03-15 07:13:48] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 0 ms to minimize.
[2023-03-15 07:13:48] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 1 ms to minimize.
[2023-03-15 07:13:48] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 0 ms to minimize.
[2023-03-15 07:13:48] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 0 ms to minimize.
[2023-03-15 07:13:48] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 0 ms to minimize.
[2023-03-15 07:13:49] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 0 ms to minimize.
[2023-03-15 07:13:49] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 1 ms to minimize.
[2023-03-15 07:13:49] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 1 ms to minimize.
[2023-03-15 07:13:49] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 1 ms to minimize.
[2023-03-15 07:13:50] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 0 ms to minimize.
[2023-03-15 07:13:50] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 1 ms to minimize.
[2023-03-15 07:13:50] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 0 ms to minimize.
[2023-03-15 07:13:50] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 1 ms to minimize.
[2023-03-15 07:13:50] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 1 ms to minimize.
[2023-03-15 07:13:51] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2023-03-15 07:13:51] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 1 ms to minimize.
[2023-03-15 07:13:51] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4821 ms
[2023-03-15 07:13:51] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 0 ms to minimize.
[2023-03-15 07:13:51] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 1 ms to minimize.
[2023-03-15 07:13:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 306 ms
[2023-03-15 07:13:52] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 0 ms to minimize.
[2023-03-15 07:13:52] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 1 ms to minimize.
[2023-03-15 07:13:52] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 0 ms to minimize.
[2023-03-15 07:13:52] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 0 ms to minimize.
[2023-03-15 07:13:52] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 1 ms to minimize.
[2023-03-15 07:13:53] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 0 ms to minimize.
[2023-03-15 07:13:53] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 0 ms to minimize.
[2023-03-15 07:13:53] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 0 ms to minimize.
[2023-03-15 07:13:53] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 1 ms to minimize.
[2023-03-15 07:13:53] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 0 ms to minimize.
[2023-03-15 07:13:53] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 0 ms to minimize.
[2023-03-15 07:13:54] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 0 ms to minimize.
[2023-03-15 07:13:54] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2144 ms
[2023-03-15 07:13:54] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 0 ms to minimize.
[2023-03-15 07:13:54] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 1 ms to minimize.
[2023-03-15 07:13:54] [INFO ] Deduced a trap composed of 62 places in 172 ms of which 0 ms to minimize.
[2023-03-15 07:13:54] [INFO ] Deduced a trap composed of 67 places in 140 ms of which 1 ms to minimize.
[2023-03-15 07:13:55] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 0 ms to minimize.
[2023-03-15 07:13:55] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 0 ms to minimize.
[2023-03-15 07:13:55] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 1 ms to minimize.
[2023-03-15 07:13:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1396 ms
[2023-03-15 07:13:55] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 0 ms to minimize.
[2023-03-15 07:13:56] [INFO ] Deduced a trap composed of 33 places in 216 ms of which 1 ms to minimize.
[2023-03-15 07:13:56] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 1 ms to minimize.
[2023-03-15 07:13:56] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 0 ms to minimize.
[2023-03-15 07:13:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 871 ms
[2023-03-15 07:13:56] [INFO ] After 17444ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1339 ms.
[2023-03-15 07:13:57] [INFO ] After 19875ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 106 out of 339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 747/747 transitions.
Applied a total of 0 rules in 25 ms. Remains 339 /339 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 339/339 places, 747/747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 747/747 transitions.
Applied a total of 0 rules in 34 ms. Remains 339 /339 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2023-03-15 07:13:57] [INFO ] Flow matrix only has 627 transitions (discarded 120 similar events)
[2023-03-15 07:13:57] [INFO ] Invariant cache hit.
[2023-03-15 07:13:58] [INFO ] Implicit Places using invariants in 367 ms returned [290, 310, 311, 312, 313, 314]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 371 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 333/339 places, 747/747 transitions.
Applied a total of 0 rules in 26 ms. Remains 333 /333 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 432 ms. Remains : 333/339 places, 747/747 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 301133 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 301133 steps, saw 45343 distinct states, run finished after 3002 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-15 07:14:02] [INFO ] Flow matrix only has 627 transitions (discarded 120 similar events)
// Phase 1: matrix 627 rows 333 cols
[2023-03-15 07:14:02] [INFO ] Computed 17 place invariants in 9 ms
[2023-03-15 07:14:02] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-15 07:14:03] [INFO ] After 1330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-15 07:14:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 07:14:05] [INFO ] After 1100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-15 07:14:05] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:14:06] [INFO ] After 977ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-15 07:14:06] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 1 ms to minimize.
[2023-03-15 07:14:06] [INFO ] Deduced a trap composed of 11 places in 277 ms of which 1 ms to minimize.
[2023-03-15 07:14:07] [INFO ] Deduced a trap composed of 12 places in 281 ms of which 0 ms to minimize.
[2023-03-15 07:14:07] [INFO ] Deduced a trap composed of 10 places in 278 ms of which 1 ms to minimize.
[2023-03-15 07:14:07] [INFO ] Deduced a trap composed of 10 places in 281 ms of which 1 ms to minimize.
[2023-03-15 07:14:08] [INFO ] Deduced a trap composed of 33 places in 200 ms of which 0 ms to minimize.
[2023-03-15 07:14:08] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 1 ms to minimize.
[2023-03-15 07:14:08] [INFO ] Deduced a trap composed of 9 places in 288 ms of which 1 ms to minimize.
[2023-03-15 07:14:08] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 1 ms to minimize.
[2023-03-15 07:14:09] [INFO ] Deduced a trap composed of 53 places in 193 ms of which 1 ms to minimize.
[2023-03-15 07:14:09] [INFO ] Deduced a trap composed of 33 places in 228 ms of which 1 ms to minimize.
[2023-03-15 07:14:09] [INFO ] Deduced a trap composed of 58 places in 203 ms of which 1 ms to minimize.
[2023-03-15 07:14:09] [INFO ] Deduced a trap composed of 28 places in 210 ms of which 1 ms to minimize.
[2023-03-15 07:14:10] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 0 ms to minimize.
[2023-03-15 07:14:10] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 0 ms to minimize.
[2023-03-15 07:14:10] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 1 ms to minimize.
[2023-03-15 07:14:10] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 0 ms to minimize.
[2023-03-15 07:14:11] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 1 ms to minimize.
[2023-03-15 07:14:11] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 0 ms to minimize.
[2023-03-15 07:14:11] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 1 ms to minimize.
[2023-03-15 07:14:11] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 1 ms to minimize.
[2023-03-15 07:14:12] [INFO ] Deduced a trap composed of 33 places in 254 ms of which 1 ms to minimize.
[2023-03-15 07:14:12] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 1 ms to minimize.
[2023-03-15 07:14:12] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 1 ms to minimize.
[2023-03-15 07:14:12] [INFO ] Deduced a trap composed of 63 places in 223 ms of which 0 ms to minimize.
[2023-03-15 07:14:12] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 1 ms to minimize.
[2023-03-15 07:14:13] [INFO ] Deduced a trap composed of 28 places in 184 ms of which 2 ms to minimize.
[2023-03-15 07:14:13] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 0 ms to minimize.
[2023-03-15 07:14:13] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 1 ms to minimize.
[2023-03-15 07:14:13] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 1 ms to minimize.
[2023-03-15 07:14:13] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 7589 ms
[2023-03-15 07:14:14] [INFO ] Deduced a trap composed of 9 places in 289 ms of which 1 ms to minimize.
[2023-03-15 07:14:15] [INFO ] Deduced a trap composed of 58 places in 265 ms of which 1 ms to minimize.
[2023-03-15 07:14:15] [INFO ] Deduced a trap composed of 20 places in 282 ms of which 1 ms to minimize.
[2023-03-15 07:14:15] [INFO ] Deduced a trap composed of 21 places in 273 ms of which 1 ms to minimize.
[2023-03-15 07:14:15] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 1 ms to minimize.
[2023-03-15 07:14:16] [INFO ] Deduced a trap composed of 39 places in 277 ms of which 1 ms to minimize.
[2023-03-15 07:14:16] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 0 ms to minimize.
[2023-03-15 07:14:16] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 1 ms to minimize.
[2023-03-15 07:14:16] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 1 ms to minimize.
[2023-03-15 07:14:17] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 1 ms to minimize.
[2023-03-15 07:14:17] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 0 ms to minimize.
[2023-03-15 07:14:17] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 1 ms to minimize.
[2023-03-15 07:14:17] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 0 ms to minimize.
[2023-03-15 07:14:17] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:14:17] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3498 ms
[2023-03-15 07:14:18] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2023-03-15 07:14:18] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 0 ms to minimize.
[2023-03-15 07:14:18] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 0 ms to minimize.
[2023-03-15 07:14:18] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 0 ms to minimize.
[2023-03-15 07:14:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 572 ms
[2023-03-15 07:14:18] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2023-03-15 07:14:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2023-03-15 07:14:19] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2023-03-15 07:14:19] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 1 ms to minimize.
[2023-03-15 07:14:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 278 ms
[2023-03-15 07:14:19] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 0 ms to minimize.
[2023-03-15 07:14:19] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 1 ms to minimize.
[2023-03-15 07:14:19] [INFO ] Deduced a trap composed of 68 places in 159 ms of which 1 ms to minimize.
[2023-03-15 07:14:19] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 1 ms to minimize.
[2023-03-15 07:14:20] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 1 ms to minimize.
[2023-03-15 07:14:20] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 1 ms to minimize.
[2023-03-15 07:14:20] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 1 ms to minimize.
[2023-03-15 07:14:20] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 0 ms to minimize.
[2023-03-15 07:14:20] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 0 ms to minimize.
[2023-03-15 07:14:21] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 1 ms to minimize.
[2023-03-15 07:14:21] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 0 ms to minimize.
[2023-03-15 07:14:21] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 1 ms to minimize.
[2023-03-15 07:14:21] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 0 ms to minimize.
[2023-03-15 07:14:21] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2207 ms
[2023-03-15 07:14:21] [INFO ] After 16178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 787 ms.
[2023-03-15 07:14:22] [INFO ] After 18363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 106 out of 333 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 333/333 places, 747/747 transitions.
Applied a total of 0 rules in 24 ms. Remains 333 /333 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 333/333 places, 747/747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 333/333 places, 747/747 transitions.
Applied a total of 0 rules in 20 ms. Remains 333 /333 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2023-03-15 07:14:22] [INFO ] Flow matrix only has 627 transitions (discarded 120 similar events)
[2023-03-15 07:14:22] [INFO ] Invariant cache hit.
[2023-03-15 07:14:22] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-15 07:14:22] [INFO ] Flow matrix only has 627 transitions (discarded 120 similar events)
[2023-03-15 07:14:22] [INFO ] Invariant cache hit.
[2023-03-15 07:14:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:14:23] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1238 ms to find 0 implicit places.
[2023-03-15 07:14:23] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-15 07:14:23] [INFO ] Flow matrix only has 627 transitions (discarded 120 similar events)
[2023-03-15 07:14:23] [INFO ] Invariant cache hit.
[2023-03-15 07:14:24] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1886 ms. Remains : 333/333 places, 747/747 transitions.
FORMULA Peterson-PT-5-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||(!p1 U (p2||G(!p1))))))))'
Support contains 270 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 10 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:14:24] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 07:14:24] [INFO ] Computed 23 place invariants in 6 ms
[2023-03-15 07:14:25] [INFO ] Implicit Places using invariants in 449 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 452 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 474 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 376 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : Peterson-PT-5-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(OR p0 p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(AND (NOT (OR (AND (EQ s607 1) (EQ s805 1)) (AND (EQ s534 1) (EQ s810 1)) (AND (EQ s606 1) (EQ s799 1)) (AND (EQ s611 1) (EQ s803 1)) (AND (EQ s522 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 799 ms.
Product exploration explored 100000 steps with 0 reset in 785 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 p2 (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 213 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 07:14:28] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2023-03-15 07:14:28] [INFO ] Computed 17 place invariants in 11 ms
[2023-03-15 07:14:29] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-15 07:14:31] [INFO ] After 2441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 07:14:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 07:14:36] [INFO ] After 4727ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 07:14:36] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:14:42] [INFO ] After 5501ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 07:14:44] [INFO ] Deduced a trap composed of 11 places in 543 ms of which 1 ms to minimize.
[2023-03-15 07:14:44] [INFO ] Deduced a trap composed of 14 places in 503 ms of which 1 ms to minimize.
[2023-03-15 07:14:45] [INFO ] Deduced a trap composed of 11 places in 533 ms of which 1 ms to minimize.
[2023-03-15 07:14:45] [INFO ] Deduced a trap composed of 11 places in 518 ms of which 1 ms to minimize.
[2023-03-15 07:14:46] [INFO ] Deduced a trap composed of 41 places in 501 ms of which 1 ms to minimize.
[2023-03-15 07:14:47] [INFO ] Deduced a trap composed of 41 places in 528 ms of which 1 ms to minimize.
[2023-03-15 07:14:47] [INFO ] Deduced a trap composed of 41 places in 517 ms of which 1 ms to minimize.
[2023-03-15 07:14:48] [INFO ] Deduced a trap composed of 41 places in 523 ms of which 1 ms to minimize.
[2023-03-15 07:14:49] [INFO ] Deduced a trap composed of 11 places in 517 ms of which 1 ms to minimize.
[2023-03-15 07:14:51] [INFO ] Deduced a trap composed of 62 places in 450 ms of which 1 ms to minimize.
[2023-03-15 07:14:51] [INFO ] Deduced a trap composed of 11 places in 465 ms of which 1 ms to minimize.
[2023-03-15 07:14:52] [INFO ] Deduced a trap composed of 28 places in 423 ms of which 1 ms to minimize.
[2023-03-15 07:14:52] [INFO ] Deduced a trap composed of 28 places in 403 ms of which 1 ms to minimize.
[2023-03-15 07:14:53] [INFO ] Deduced a trap composed of 28 places in 422 ms of which 1 ms to minimize.
[2023-03-15 07:14:54] [INFO ] Deduced a trap composed of 62 places in 437 ms of which 1 ms to minimize.
[2023-03-15 07:14:54] [INFO ] Deduced a trap composed of 28 places in 397 ms of which 0 ms to minimize.
[2023-03-15 07:14:55] [INFO ] Deduced a trap composed of 52 places in 369 ms of which 0 ms to minimize.
[2023-03-15 07:14:55] [INFO ] Deduced a trap composed of 89 places in 400 ms of which 1 ms to minimize.
[2023-03-15 07:14:56] [INFO ] Deduced a trap composed of 53 places in 391 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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-15 07:14:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 07:14:56] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 94 ms.
Support contains 270 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Iterating post reduction 0 with 175 rules applied. Total rules applied 175 place count 828 transition count 1067
Reduce places removed 175 places and 0 transitions.
Iterating post reduction 1 with 175 rules applied. Total rules applied 350 place count 653 transition count 1067
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 350 place count 653 transition count 1037
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 410 place count 623 transition count 1037
Applied a total of 410 rules in 62 ms. Remains 623 /828 variables (removed 205) and now considering 1037/1242 (removed 205) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 623/828 places, 1037/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 254233 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 254233 steps, saw 80749 distinct states, run finished after 3002 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-15 07:15:00] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
// Phase 1: matrix 917 rows 623 cols
[2023-03-15 07:15:00] [INFO ] Computed 17 place invariants in 5 ms
[2023-03-15 07:15:00] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 07:15:00] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 07:15:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 07:15:05] [INFO ] After 4069ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 07:15:05] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:15:09] [INFO ] After 3907ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 07:15:10] [INFO ] Deduced a trap composed of 22 places in 376 ms of which 1 ms to minimize.
[2023-03-15 07:15:11] [INFO ] Deduced a trap composed of 12 places in 387 ms of which 1 ms to minimize.
[2023-03-15 07:15:11] [INFO ] Deduced a trap composed of 25 places in 379 ms of which 1 ms to minimize.
[2023-03-15 07:15:12] [INFO ] Deduced a trap composed of 24 places in 365 ms of which 1 ms to minimize.
[2023-03-15 07:15:12] [INFO ] Deduced a trap composed of 29 places in 360 ms of which 0 ms to minimize.
[2023-03-15 07:15:13] [INFO ] Deduced a trap composed of 10 places in 334 ms of which 1 ms to minimize.
[2023-03-15 07:15:13] [INFO ] Deduced a trap composed of 21 places in 350 ms of which 1 ms to minimize.
[2023-03-15 07:15:13] [INFO ] Deduced a trap composed of 91 places in 200 ms of which 1 ms to minimize.
[2023-03-15 07:15:14] [INFO ] Deduced a trap composed of 72 places in 262 ms of which 0 ms to minimize.
[2023-03-15 07:15:14] [INFO ] Deduced a trap composed of 107 places in 258 ms of which 1 ms to minimize.
[2023-03-15 07:15:14] [INFO ] Deduced a trap composed of 110 places in 256 ms of which 0 ms to minimize.
[2023-03-15 07:15:15] [INFO ] Deduced a trap composed of 18 places in 351 ms of which 1 ms to minimize.
[2023-03-15 07:15:15] [INFO ] Deduced a trap composed of 10 places in 350 ms of which 1 ms to minimize.
[2023-03-15 07:15:16] [INFO ] Deduced a trap composed of 10 places in 359 ms of which 1 ms to minimize.
[2023-03-15 07:15:16] [INFO ] Deduced a trap composed of 10 places in 358 ms of which 1 ms to minimize.
[2023-03-15 07:15:17] [INFO ] Deduced a trap composed of 82 places in 289 ms of which 1 ms to minimize.
[2023-03-15 07:15:17] [INFO ] Deduced a trap composed of 25 places in 358 ms of which 0 ms to minimize.
[2023-03-15 07:15:18] [INFO ] Deduced a trap composed of 53 places in 361 ms of which 1 ms to minimize.
[2023-03-15 07:15:18] [INFO ] Deduced a trap composed of 25 places in 366 ms of which 0 ms to minimize.
[2023-03-15 07:15:19] [INFO ] Deduced a trap composed of 25 places in 359 ms of which 1 ms to minimize.
[2023-03-15 07:15:19] [INFO ] Deduced a trap composed of 98 places in 285 ms of which 1 ms to minimize.
[2023-03-15 07:15:19] [INFO ] Deduced a trap composed of 104 places in 277 ms of which 1 ms to minimize.
[2023-03-15 07:15:20] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 1 ms to minimize.
[2023-03-15 07:15:20] [INFO ] Deduced a trap composed of 64 places in 263 ms of which 0 ms to minimize.
[2023-03-15 07:15:21] [INFO ] Deduced a trap composed of 13 places in 331 ms of which 1 ms to minimize.
[2023-03-15 07:15:21] [INFO ] Deduced a trap composed of 51 places in 260 ms of which 0 ms to minimize.
[2023-03-15 07:15:21] [INFO ] Deduced a trap composed of 86 places in 193 ms of which 0 ms to minimize.
[2023-03-15 07:15:22] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 1 ms to minimize.
[2023-03-15 07:15:22] [INFO ] Deduced a trap composed of 110 places in 139 ms of which 0 ms to minimize.
[2023-03-15 07:15:22] [INFO ] Deduced a trap composed of 47 places in 302 ms of which 1 ms to minimize.
[2023-03-15 07:15:23] [INFO ] Deduced a trap composed of 38 places in 356 ms of which 1 ms to minimize.
[2023-03-15 07:15:23] [INFO ] Deduced a trap composed of 42 places in 349 ms of which 0 ms to minimize.
[2023-03-15 07:15:24] [INFO ] Deduced a trap composed of 64 places in 350 ms of which 1 ms to minimize.
[2023-03-15 07:15:24] [INFO ] Deduced a trap composed of 84 places in 331 ms of which 0 ms to minimize.
[2023-03-15 07:15:25] [INFO ] Deduced a trap composed of 38 places in 301 ms of which 0 ms to minimize.
[2023-03-15 07:15:25] [INFO ] Deduced a trap composed of 129 places in 149 ms of which 0 ms to minimize.
[2023-03-15 07:15:25] [INFO ] Deduced a trap composed of 67 places in 258 ms of which 1 ms to minimize.
[2023-03-15 07:15:25] [INFO ] Trap strengthening (SAT) tested/added 37/37 trap constraints in 15408 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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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-15 07:15:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 07:15:25] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 1 ms.
Support contains 270 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 26 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 623/623 places, 1037/1037 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 22 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
[2023-03-15 07:15:26] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 07:15:26] [INFO ] Invariant cache hit.
[2023-03-15 07:15:26] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-15 07:15:26] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 07:15:26] [INFO ] Invariant cache hit.
[2023-03-15 07:15:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:15:28] [INFO ] Implicit Places using invariants and state equation in 1993 ms returned []
Implicit Place search using SMT with State Equation took 2353 ms to find 0 implicit places.
[2023-03-15 07:15:28] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-15 07:15:28] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 07:15:28] [INFO ] Invariant cache hit.
[2023-03-15 07:15:29] [INFO ] Dead Transitions using invariants and state equation in 996 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3401 ms. Remains : 623/623 places, 1037/1037 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 623 transition count 917
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 138 place count 611 transition count 911
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 150 place count 605 transition count 905
Free-agglomeration rule applied 125 times.
Iterating global reduction 1 with 125 rules applied. Total rules applied 275 place count 605 transition count 780
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 1 with 125 rules applied. Total rules applied 400 place count 480 transition count 780
Applied a total of 400 rules in 94 ms. Remains 480 /623 variables (removed 143) and now considering 780/1037 (removed 257) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 780 rows 480 cols
[2023-03-15 07:15:29] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-15 07:15:30] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-15 07:15:30] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 07:15:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-15 07:15:34] [INFO ] After 3805ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 07:15:37] [INFO ] After 7283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3482 ms.
[2023-03-15 07:15:41] [INFO ] After 10990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR p0 p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 259 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 177 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Support contains 270 out of 828 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 35 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:15:41] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2023-03-15 07:15:41] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 07:15:42] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-15 07:15:42] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:15:42] [INFO ] Invariant cache hit.
[2023-03-15 07:15:42] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:15:45] [INFO ] Implicit Places using invariants and state equation in 3157 ms returned []
Implicit Place search using SMT with State Equation took 3606 ms to find 0 implicit places.
[2023-03-15 07:15:45] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:15:45] [INFO ] Invariant cache hit.
[2023-03-15 07:15:46] [INFO ] Dead Transitions using invariants and state equation in 1564 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5220 ms. Remains : 828/828 places, 1242/1242 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 p1) p2 p0), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (OR p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 239 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 07:15:48] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:15:48] [INFO ] Invariant cache hit.
[2023-03-15 07:15:48] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-15 07:15:51] [INFO ] After 2377ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 07:15:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 07:15:55] [INFO ] After 4517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 07:15:55] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:16:00] [INFO ] After 4194ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 07:16:02] [INFO ] Deduced a trap composed of 46 places in 509 ms of which 1 ms to minimize.
[2023-03-15 07:16:02] [INFO ] Deduced a trap composed of 44 places in 463 ms of which 1 ms to minimize.
[2023-03-15 07:16:03] [INFO ] Deduced a trap composed of 63 places in 516 ms of which 1 ms to minimize.
[2023-03-15 07:16:03] [INFO ] Deduced a trap composed of 63 places in 466 ms of which 0 ms to minimize.
[2023-03-15 07:16:04] [INFO ] Deduced a trap composed of 28 places in 461 ms of which 1 ms to minimize.
[2023-03-15 07:16:04] [INFO ] Deduced a trap composed of 26 places in 489 ms of which 1 ms to minimize.
[2023-03-15 07:16:05] [INFO ] Deduced a trap composed of 37 places in 447 ms of which 1 ms to minimize.
[2023-03-15 07:16:06] [INFO ] Deduced a trap composed of 18 places in 379 ms of which 1 ms to minimize.
[2023-03-15 07:16:06] [INFO ] Deduced a trap composed of 26 places in 335 ms of which 0 ms to minimize.
[2023-03-15 07:16:07] [INFO ] Deduced a trap composed of 115 places in 212 ms of which 1 ms to minimize.
[2023-03-15 07:16:07] [INFO ] Deduced a trap composed of 96 places in 298 ms of which 0 ms to minimize.
[2023-03-15 07:16:07] [INFO ] Deduced a trap composed of 115 places in 202 ms of which 1 ms to minimize.
[2023-03-15 07:16:08] [INFO ] Deduced a trap composed of 82 places in 244 ms of which 1 ms to minimize.
[2023-03-15 07:16:10] [INFO ] Deduced a trap composed of 13 places in 541 ms of which 1 ms to minimize.
[2023-03-15 07:16:10] [INFO ] Deduced a trap composed of 52 places in 508 ms of which 1 ms to minimize.
[2023-03-15 07:16:11] [INFO ] Deduced a trap composed of 127 places in 437 ms of which 1 ms to minimize.
[2023-03-15 07:16:11] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 9736 ms
[2023-03-15 07:16:13] [INFO ] Deduced a trap composed of 70 places in 418 ms of which 1 ms to minimize.
[2023-03-15 07:16:13] [INFO ] Deduced a trap composed of 11 places in 474 ms of which 1 ms to minimize.
[2023-03-15 07:16:14] [INFO ] Deduced a trap composed of 78 places in 392 ms of which 1 ms to minimize.
[2023-03-15 07:16:14] [INFO ] Deduced a trap composed of 30 places in 391 ms of which 1 ms to minimize.
[2023-03-15 07:16:15] [INFO ] Deduced a trap composed of 104 places in 419 ms of which 1 ms to minimize.
[2023-03-15 07:16:16] [INFO ] Deduced a trap composed of 104 places in 409 ms of which 1 ms to minimize.
[2023-03-15 07:16:16] [INFO ] Trap strengthening (SAT) tested/added 6/6 trap constraints in 3268 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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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-15 07:16:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 07:16:16] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 178 ms.
Support contains 270 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Iterating post reduction 0 with 175 rules applied. Total rules applied 175 place count 828 transition count 1067
Reduce places removed 175 places and 0 transitions.
Iterating post reduction 1 with 175 rules applied. Total rules applied 350 place count 653 transition count 1067
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 350 place count 653 transition count 1037
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 410 place count 623 transition count 1037
Applied a total of 410 rules in 48 ms. Remains 623 /828 variables (removed 205) and now considering 1037/1242 (removed 205) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 623/828 places, 1037/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 264222 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 264222 steps, saw 82086 distinct states, run finished after 3004 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-15 07:16:20] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
// Phase 1: matrix 917 rows 623 cols
[2023-03-15 07:16:20] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 07:16:20] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 07:16:20] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 07:16:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 07:16:25] [INFO ] After 4139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 07:16:25] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:16:28] [INFO ] After 3824ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 07:16:30] [INFO ] Deduced a trap composed of 22 places in 377 ms of which 1 ms to minimize.
[2023-03-15 07:16:31] [INFO ] Deduced a trap composed of 12 places in 374 ms of which 1 ms to minimize.
[2023-03-15 07:16:31] [INFO ] Deduced a trap composed of 25 places in 374 ms of which 1 ms to minimize.
[2023-03-15 07:16:31] [INFO ] Deduced a trap composed of 24 places in 377 ms of which 1 ms to minimize.
[2023-03-15 07:16:32] [INFO ] Deduced a trap composed of 29 places in 369 ms of which 1 ms to minimize.
[2023-03-15 07:16:32] [INFO ] Deduced a trap composed of 10 places in 336 ms of which 1 ms to minimize.
[2023-03-15 07:16:33] [INFO ] Deduced a trap composed of 21 places in 354 ms of which 1 ms to minimize.
[2023-03-15 07:16:33] [INFO ] Deduced a trap composed of 91 places in 204 ms of which 1 ms to minimize.
[2023-03-15 07:16:33] [INFO ] Deduced a trap composed of 72 places in 268 ms of which 1 ms to minimize.
[2023-03-15 07:16:34] [INFO ] Deduced a trap composed of 107 places in 262 ms of which 0 ms to minimize.
[2023-03-15 07:16:34] [INFO ] Deduced a trap composed of 110 places in 261 ms of which 0 ms to minimize.
[2023-03-15 07:16:35] [INFO ] Deduced a trap composed of 18 places in 360 ms of which 1 ms to minimize.
[2023-03-15 07:16:35] [INFO ] Deduced a trap composed of 10 places in 347 ms of which 1 ms to minimize.
[2023-03-15 07:16:35] [INFO ] Deduced a trap composed of 10 places in 364 ms of which 1 ms to minimize.
[2023-03-15 07:16:36] [INFO ] Deduced a trap composed of 10 places in 325 ms of which 0 ms to minimize.
[2023-03-15 07:16:36] [INFO ] Deduced a trap composed of 82 places in 289 ms of which 1 ms to minimize.
[2023-03-15 07:16:37] [INFO ] Deduced a trap composed of 25 places in 352 ms of which 1 ms to minimize.
[2023-03-15 07:16:37] [INFO ] Deduced a trap composed of 53 places in 357 ms of which 0 ms to minimize.
[2023-03-15 07:16:38] [INFO ] Deduced a trap composed of 25 places in 356 ms of which 0 ms to minimize.
[2023-03-15 07:16:38] [INFO ] Deduced a trap composed of 25 places in 356 ms of which 1 ms to minimize.
[2023-03-15 07:16:39] [INFO ] Deduced a trap composed of 98 places in 287 ms of which 0 ms to minimize.
[2023-03-15 07:16:39] [INFO ] Deduced a trap composed of 104 places in 277 ms of which 0 ms to minimize.
[2023-03-15 07:16:40] [INFO ] Deduced a trap composed of 53 places in 165 ms of which 0 ms to minimize.
[2023-03-15 07:16:40] [INFO ] Deduced a trap composed of 64 places in 272 ms of which 0 ms to minimize.
[2023-03-15 07:16:40] [INFO ] Deduced a trap composed of 13 places in 334 ms of which 0 ms to minimize.
[2023-03-15 07:16:41] [INFO ] Deduced a trap composed of 51 places in 275 ms of which 1 ms to minimize.
[2023-03-15 07:16:41] [INFO ] Deduced a trap composed of 86 places in 208 ms of which 0 ms to minimize.
[2023-03-15 07:16:41] [INFO ] Deduced a trap composed of 84 places in 150 ms of which 2 ms to minimize.
[2023-03-15 07:16:42] [INFO ] Deduced a trap composed of 110 places in 141 ms of which 1 ms to minimize.
[2023-03-15 07:16:42] [INFO ] Deduced a trap composed of 47 places in 267 ms of which 1 ms to minimize.
[2023-03-15 07:16:42] [INFO ] Deduced a trap composed of 38 places in 349 ms of which 1 ms to minimize.
[2023-03-15 07:16:43] [INFO ] Deduced a trap composed of 42 places in 347 ms of which 1 ms to minimize.
[2023-03-15 07:16:43] [INFO ] Deduced a trap composed of 64 places in 347 ms of which 1 ms to minimize.
[2023-03-15 07:16:44] [INFO ] Deduced a trap composed of 84 places in 347 ms of which 1 ms to minimize.
[2023-03-15 07:16:44] [INFO ] Deduced a trap composed of 38 places in 299 ms of which 1 ms to minimize.
[2023-03-15 07:16:44] [INFO ] Deduced a trap composed of 129 places in 190 ms of which 1 ms to minimize.
[2023-03-15 07:16:45] [INFO ] Deduced a trap composed of 67 places in 248 ms of which 0 ms to minimize.
[2023-03-15 07:16:45] [INFO ] Trap strengthening (SAT) tested/added 37/37 trap constraints in 15420 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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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-15 07:16:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 07:16:45] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 1 ms.
Support contains 270 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 21 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 623/623 places, 1037/1037 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 16 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
[2023-03-15 07:16:45] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 07:16:45] [INFO ] Invariant cache hit.
[2023-03-15 07:16:46] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-15 07:16:46] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 07:16:46] [INFO ] Invariant cache hit.
[2023-03-15 07:16:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:16:48] [INFO ] Implicit Places using invariants and state equation in 1964 ms returned []
Implicit Place search using SMT with State Equation took 2334 ms to find 0 implicit places.
[2023-03-15 07:16:48] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-15 07:16:48] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 07:16:48] [INFO ] Invariant cache hit.
[2023-03-15 07:16:49] [INFO ] Dead Transitions using invariants and state equation in 1033 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3416 ms. Remains : 623/623 places, 1037/1037 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 623 transition count 917
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 138 place count 611 transition count 911
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 150 place count 605 transition count 905
Free-agglomeration rule applied 125 times.
Iterating global reduction 1 with 125 rules applied. Total rules applied 275 place count 605 transition count 780
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 1 with 125 rules applied. Total rules applied 400 place count 480 transition count 780
Applied a total of 400 rules in 61 ms. Remains 480 /623 variables (removed 143) and now considering 780/1037 (removed 257) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 780 rows 480 cols
[2023-03-15 07:16:49] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-15 07:16:49] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-15 07:16:49] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 07:16:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-15 07:16:53] [INFO ] After 3736ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 07:16:57] [INFO ] After 7241ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3371 ms.
[2023-03-15 07:17:00] [INFO ] After 10839ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (OR p0 p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 256 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 173 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 177 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1187 ms.
Product exploration explored 100000 steps with 0 reset in 1230 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 174 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Support contains 270 out of 828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 175 rules applied. Total rules applied 175 place count 828 transition count 1242
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 175 place count 828 transition count 1242
Deduced a syphon composed of 181 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 181 place count 828 transition count 1242
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 205 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 205 place count 828 transition count 1242
Deduced a syphon composed of 205 places in 1 ms
Applied a total of 205 rules in 95 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:17:04] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-15 07:17:04] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2023-03-15 07:17:04] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 07:17:05] [INFO ] Dead Transitions using invariants and state equation in 1345 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 828/828 places, 1242/1242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1467 ms. Remains : 828/828 places, 1242/1242 transitions.
Support contains 270 out of 828 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 16 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:17:05] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2023-03-15 07:17:05] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 07:17:06] [INFO ] Implicit Places using invariants in 420 ms returned []
[2023-03-15 07:17:06] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:17:06] [INFO ] Invariant cache hit.
[2023-03-15 07:17:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:17:08] [INFO ] Implicit Places using invariants and state equation in 2726 ms returned []
Implicit Place search using SMT with State Equation took 3148 ms to find 0 implicit places.
[2023-03-15 07:17:08] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:17:08] [INFO ] Invariant cache hit.
[2023-03-15 07:17:10] [INFO ] Dead Transitions using invariants and state equation in 1103 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4269 ms. Remains : 828/828 places, 1242/1242 transitions.
Treatment of property Peterson-PT-5-LTLFireability-02 finished in 165647 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 36 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 356 place count 834 transition count 886
Reduce places removed 356 places and 0 transitions.
Iterating post reduction 1 with 356 rules applied. Total rules applied 712 place count 478 transition count 886
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 712 place count 478 transition count 726
Deduced a syphon composed of 160 places in 0 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 1032 place count 318 transition count 726
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1044 place count 312 transition count 720
Applied a total of 1044 rules in 43 ms. Remains 312 /834 variables (removed 522) and now considering 720/1242 (removed 522) transitions.
[2023-03-15 07:17:10] [INFO ] Flow matrix only has 600 transitions (discarded 120 similar events)
// Phase 1: matrix 600 rows 312 cols
[2023-03-15 07:17:10] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-15 07:17:10] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-15 07:17:10] [INFO ] Flow matrix only has 600 transitions (discarded 120 similar events)
[2023-03-15 07:17:10] [INFO ] Invariant cache hit.
[2023-03-15 07:17:10] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:17:11] [INFO ] Implicit Places using invariants and state equation in 1048 ms returned []
Implicit Place search using SMT with State Equation took 1345 ms to find 0 implicit places.
[2023-03-15 07:17:11] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-15 07:17:11] [INFO ] Flow matrix only has 600 transitions (discarded 120 similar events)
[2023-03-15 07:17:11] [INFO ] Invariant cache hit.
[2023-03-15 07:17:12] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/834 places, 720/1242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2009 ms. Remains : 312/834 places, 720/1242 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-03 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:(AND (OR (EQ s204 0) (EQ s289 0)) (OR (EQ s205 0) (EQ s288 0)) (OR (EQ s208 0) (EQ s268 0)) (OR (EQ s206 0) (EQ s291 0)) (OR (EQ s212 0) (EQ s292 0)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 107 reset in 436 ms.
Stack based approach found an accepted trace after 36 steps with 1 reset with depth 20 and stack size 20 in 1 ms.
FORMULA Peterson-PT-5-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLFireability-03 finished in 2584 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 p1)||G(F((X((!p3 U (G(!p3)||p4)))&&p2)))))'
Support contains 96 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 16 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:17:12] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 07:17:12] [INFO ] Computed 23 place invariants in 10 ms
[2023-03-15 07:17:13] [INFO ] Implicit Places using invariants in 482 ms returned []
[2023-03-15 07:17:13] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:17:13] [INFO ] Invariant cache hit.
[2023-03-15 07:17:14] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:17:15] [INFO ] Implicit Places using invariants and state equation in 2542 ms returned []
Implicit Place search using SMT with State Equation took 3024 ms to find 0 implicit places.
[2023-03-15 07:17:15] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:17:15] [INFO ] Invariant cache hit.
[2023-03-15 07:17:16] [INFO ] Dead Transitions using invariants and state equation in 1081 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4124 ms. Remains : 834/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 368 ms :[(OR (AND (NOT p1) p3 (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND p3 (NOT p4))), (OR (NOT p2) (AND p3 (NOT p4))), (OR (AND (NOT p1) p3 (NOT p4)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) p3 (NOT p4)), (AND p3 (NOT p4))]
Running random walk in product with property : Peterson-PT-5-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0 (NOT p2) (NOT p4) p3), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p4) p3), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p4) p3), acceptance={0} source=4 dest: 4}, { cond=(OR (AND (NOT p1) p0 p2 (NOT p4)) (AND (NOT p1) p0 (NOT p4) (NOT p3))), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p4) p3), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p4) p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (OR (AND (EQ s389 1) (EQ s806 1)) (AND (EQ s390 1) (EQ s805 1)) (AND (EQ s395 1) (EQ s785 1)) (AND (EQ s391 1) (EQ s808 1)) (AND (EQ s401 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19250 reset in 3503 ms.
Stack based approach found an accepted trace after 14897 steps with 2861 reset with depth 21 and stack size 21 in 518 ms.
FORMULA Peterson-PT-5-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLFireability-04 finished in 8543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 150 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 834 transition count 1157
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 749 transition count 1157
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 170 place count 749 transition count 1002
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 480 place count 594 transition count 1002
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 540 place count 564 transition count 972
Applied a total of 540 rules in 50 ms. Remains 564 /834 variables (removed 270) and now considering 972/1242 (removed 270) transitions.
[2023-03-15 07:17:21] [INFO ] Flow matrix only has 852 transitions (discarded 120 similar events)
// Phase 1: matrix 852 rows 564 cols
[2023-03-15 07:17:21] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-15 07:17:21] [INFO ] Implicit Places using invariants in 507 ms returned [528, 540, 541, 542, 543, 544]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 529 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 558/834 places, 972/1242 transitions.
Applied a total of 0 rules in 18 ms. Remains 558 /558 variables (removed 0) and now considering 972/972 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 598 ms. Remains : 558/834 places, 972/1242 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s430 1) (NEQ s481 1) (NEQ s373 1) (NEQ s433 1) (NEQ s377 1) (NEQ s423 1) (NEQ s367 1) (NEQ s473 1) (NEQ s426 1) (NEQ s477 1) (NEQ s371 1) (NE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3852 reset in 798 ms.
Stack based approach found an accepted trace after 392 steps with 16 reset with depth 33 and stack size 33 in 4 ms.
FORMULA Peterson-PT-5-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLFireability-05 finished in 1542 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((X(p2)||p1))))'
Support contains 216 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 10 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:17:22] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 07:17:22] [INFO ] Computed 23 place invariants in 10 ms
[2023-03-15 07:17:23] [INFO ] Implicit Places using invariants in 473 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 475 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 499 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : Peterson-PT-5-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (AND (EQ s786 1) (EQ s797 1)) (AND (EQ s793 1) (EQ s821 1)) (AND (EQ s768 1) (EQ s799 1)) (AND (EQ s788 1) (EQ s812 1)) (AND (EQ s783 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 2 reset in 1 ms.
FORMULA Peterson-PT-5-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-5-LTLFireability-07 finished in 727 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||(p1&&X((X(F(!p2))||G(p1)))))))'
Support contains 4 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:17:23] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:17:23] [INFO ] Invariant cache hit.
[2023-03-15 07:17:24] [INFO ] Implicit Places using invariants in 536 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 538 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 567 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s614 1) (EQ s369 1)), p1:(NEQ s369 1), p2:(AND (EQ s403 1) (EQ s824 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 842 ms.
Product exploration explored 100000 steps with 33333 reset in 947 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 (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1 (NOT p2))
Knowledge based reduction with 7 factoid took 232 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-5-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-5-LTLFireability-08 finished in 2785 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 2 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:17:26] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:17:26] [INFO ] Invariant cache hit.
[2023-03-15 07:17:26] [INFO ] Implicit Places using invariants in 557 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 559 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 591 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-09 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 (NEQ s402 1) (NEQ s510 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1030 ms.
Product exploration explored 100000 steps with 50000 reset in 977 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 : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-5-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-5-LTLFireability-09 finished in 2765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 359 transitions
Trivial Post-agglo rules discarded 359 transitions
Performed 359 trivial Post agglomeration. Transition count delta: 359
Iterating post reduction 0 with 359 rules applied. Total rules applied 359 place count 834 transition count 883
Reduce places removed 359 places and 0 transitions.
Iterating post reduction 1 with 359 rules applied. Total rules applied 718 place count 475 transition count 883
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 718 place count 475 transition count 703
Deduced a syphon composed of 180 places in 1 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1078 place count 295 transition count 703
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 1136 place count 266 transition count 674
Applied a total of 1136 rules in 39 ms. Remains 266 /834 variables (removed 568) and now considering 674/1242 (removed 568) transitions.
[2023-03-15 07:17:29] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 266 cols
[2023-03-15 07:17:29] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-15 07:17:29] [INFO ] Implicit Places using invariants in 359 ms returned [230, 242, 243, 244, 245, 246]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 363 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 260/834 places, 674/1242 transitions.
Applied a total of 0 rules in 9 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 412 ms. Remains : 260/834 places, 674/1242 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s120 1) (AND (EQ s185 1) (EQ s214 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 230 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA Peterson-PT-5-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLFireability-10 finished in 733 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)) U p1))'
Support contains 3 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 356 place count 834 transition count 886
Reduce places removed 356 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 357 rules applied. Total rules applied 713 place count 478 transition count 885
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 714 place count 477 transition count 885
Performed 181 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 181 Pre rules applied. Total rules applied 714 place count 477 transition count 704
Deduced a syphon composed of 181 places in 1 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 1076 place count 296 transition count 704
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1134 place count 267 transition count 675
Applied a total of 1134 rules in 35 ms. Remains 267 /834 variables (removed 567) and now considering 675/1242 (removed 567) transitions.
[2023-03-15 07:17:29] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
// Phase 1: matrix 555 rows 267 cols
[2023-03-15 07:17:29] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-15 07:17:30] [INFO ] Implicit Places using invariants in 356 ms returned [231, 243, 244, 245, 246, 247]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 358 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 261/834 places, 675/1242 transitions.
Applied a total of 0 rules in 8 ms. Remains 261 /261 variables (removed 0) and now considering 675/675 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 401 ms. Remains : 261/834 places, 675/1242 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s187 1) (EQ s193 1)), p0:(EQ s227 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 222 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 0 ms.
FORMULA Peterson-PT-5-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLFireability-11 finished in 718 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((p1&&G(p2))))))'
Support contains 5 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:17:30] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 07:17:30] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-15 07:17:31] [INFO ] Implicit Places using invariants in 543 ms returned [785, 805, 806, 807, 808]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 544 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 829/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 829 /829 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 574 ms. Remains : 829/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s665 0), p1:(OR (EQ s401 0) (EQ s804 0)), p2:(AND (EQ s772 1) (EQ s816 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 257 ms.
Stack based approach found an accepted trace after 291 steps with 0 reset with depth 292 and stack size 292 in 1 ms.
FORMULA Peterson-PT-5-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLFireability-12 finished in 1036 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(X(X((F(p0)||X(G(p1)))))))'
Support contains 3 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:17:31] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:17:31] [INFO ] Invariant cache hit.
[2023-03-15 07:17:32] [INFO ] Implicit Places using invariants in 542 ms returned [785, 806, 807, 808, 809]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 543 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 829/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 829 /829 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 574 ms. Remains : 829/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-5-LTLFireability-13 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}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (EQ s390 1) (EQ s804 1)), p1:(EQ s41 0)], 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, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 509 reset in 275 ms.
Stack based approach found an accepted trace after 7538 steps with 55 reset with depth 774 and stack size 772 in 21 ms.
FORMULA Peterson-PT-5-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLFireability-13 finished in 1155 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((X(G(p0))||G(p1)||(p1&&F(!p2))))))'
Support contains 5 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:17:32] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:17:32] [INFO ] Invariant cache hit.
[2023-03-15 07:17:33] [INFO ] Implicit Places using invariants in 549 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 554 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 583 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 255 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p0) p2), (NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 0}, { cond=(AND p2 p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(NEQ s213 1), p2:(AND (EQ s532 1) (EQ s797 1)), p0:(OR (EQ s390 0) (EQ s553 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 266 ms.
Product exploration explored 100000 steps with 0 reset in 311 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND p1 p2))), (X (AND p1 (NOT p2))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X p1)), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p0))))), (X (X (NOT (AND p1 p2 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 9 factoid took 555 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[true, (OR (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-15 07:17:35] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2023-03-15 07:17:35] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 07:17:35] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 07:17:36] [INFO ] After 582ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:1
[2023-03-15 07:17:36] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:17:36] [INFO ] After 110ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-15 07:17:36] [INFO ] After 1004ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-15 07:17:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 07:17:37] [INFO ] After 621ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-15 07:17:37] [INFO ] After 175ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-03-15 07:17:38] [INFO ] Deduced a trap composed of 63 places in 445 ms of which 1 ms to minimize.
[2023-03-15 07:17:38] [INFO ] Deduced a trap composed of 63 places in 465 ms of which 1 ms to minimize.
[2023-03-15 07:17:39] [INFO ] Deduced a trap composed of 89 places in 442 ms of which 0 ms to minimize.
[2023-03-15 07:17:39] [INFO ] Deduced a trap composed of 37 places in 385 ms of which 1 ms to minimize.
[2023-03-15 07:17:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2009 ms
[2023-03-15 07:17:39] [INFO ] After 2345ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 127 ms.
[2023-03-15 07:17:39] [INFO ] After 3363ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 58 ms.
Support contains 5 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Drop transitions removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 828 transition count 884
Reduce places removed 358 places and 0 transitions.
Iterating post reduction 1 with 358 rules applied. Total rules applied 716 place count 470 transition count 884
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 716 place count 470 transition count 704
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1076 place count 290 transition count 704
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 1134 place count 261 transition count 675
Applied a total of 1134 rules in 34 ms. Remains 261 /828 variables (removed 567) and now considering 675/1242 (removed 567) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 261/828 places, 675/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 675416 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :{}
Probabilistic random walk after 675416 steps, saw 98602 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 07:17:43] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
// Phase 1: matrix 555 rows 261 cols
[2023-03-15 07:17:43] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 07:17:43] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 07:17:43] [INFO ] After 210ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-15 07:17:43] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:17:43] [INFO ] After 58ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 07:17:43] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 07:17:43] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 07:17:43] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 07:17:44] [INFO ] After 79ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 07:17:44] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2023-03-15 07:17:44] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2023-03-15 07:17:44] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 0 ms to minimize.
[2023-03-15 07:17:44] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:17:44] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
[2023-03-15 07:17:44] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2023-03-15 07:17:44] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 0 ms to minimize.
[2023-03-15 07:17:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 923 ms
[2023-03-15 07:17:45] [INFO ] After 1064ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-15 07:17:45] [INFO ] After 1423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 675/675 transitions.
Applied a total of 0 rules in 8 ms. Remains 261 /261 variables (removed 0) and now considering 675/675 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 261/261 places, 675/675 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 675/675 transitions.
Applied a total of 0 rules in 7 ms. Remains 261 /261 variables (removed 0) and now considering 675/675 (removed 0) transitions.
[2023-03-15 07:17:45] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
[2023-03-15 07:17:45] [INFO ] Invariant cache hit.
[2023-03-15 07:17:45] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-15 07:17:45] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
[2023-03-15 07:17:45] [INFO ] Invariant cache hit.
[2023-03-15 07:17:45] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:17:46] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned []
Implicit Place search using SMT with State Equation took 1343 ms to find 0 implicit places.
[2023-03-15 07:17:46] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 07:17:46] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
[2023-03-15 07:17:46] [INFO ] Invariant cache hit.
[2023-03-15 07:17:46] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1889 ms. Remains : 261/261 places, 675/675 transitions.
Graph (trivial) has 491 edges and 261 vertex of which 172 / 261 are part of one of the 29 SCC in 5 ms
Free SCC test removed 143 places
Drop transitions removed 286 transitions
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 433 transitions.
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 27 Pre rules applied. Total rules applied 1 place count 118 transition count 215
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 0 with 54 rules applied. Total rules applied 55 place count 91 transition count 215
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 0 with 2 rules applied. Total rules applied 57 place count 90 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 58 place count 90 transition count 213
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 17 rules applied. Total rules applied 75 place count 79 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 41 edges and 79 vertex of which 24 / 79 are part of one of the 4 SCC in 0 ms
Free SCC test removed 20 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 59 transition count 211
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (trivial) has 88 edges and 55 vertex of which 15 / 55 are part of one of the 5 SCC in 0 ms
Free SCC test removed 10 places
Iterating post reduction 2 with 29 rules applied. Total rules applied 107 place count 45 transition count 187
Drop transitions removed 30 transitions
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 3 with 92 rules applied. Total rules applied 199 place count 45 transition count 95
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 209 place count 45 transition count 85
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 212 place count 45 transition count 82
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 216 place count 42 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 217 place count 41 transition count 81
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 217 place count 41 transition count 80
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 219 place count 40 transition count 80
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 220 place count 40 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 221 place count 39 transition count 79
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 225 place count 39 transition count 91
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 8 with 32 rules applied. Total rules applied 257 place count 35 transition count 63
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 265 place count 35 transition count 55
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 267 place count 35 transition count 55
Applied a total of 267 rules in 57 ms. Remains 35 /261 variables (removed 226) and now considering 55/675 (removed 620) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 55 rows 35 cols
[2023-03-15 07:17:47] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-15 07:17:47] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-15 07:17:47] [INFO ] After 27ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-15 07:17:47] [INFO ] After 44ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-15 07:17:47] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-15 07:17:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-15 07:17:47] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 07:17:47] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-15 07:17:47] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND p1 p2))), (X (AND p1 (NOT p2))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X p1)), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (G (NOT (AND (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (AND p1 p2)), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (AND p0 p2)), (F (NOT p1)), (F (OR (AND p0 (NOT p1)) (AND (NOT p1) (NOT p2)))), (F (AND p0 p1 p2))]
Knowledge based reduction with 11 factoid took 843 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 828 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 18 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:17:48] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2023-03-15 07:17:48] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 07:17:48] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-03-15 07:17:48] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:17:48] [INFO ] Invariant cache hit.
[2023-03-15 07:17:49] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:17:52] [INFO ] Implicit Places using invariants and state equation in 3284 ms returned []
Implicit Place search using SMT with State Equation took 3788 ms to find 0 implicit places.
[2023-03-15 07:17:52] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:17:52] [INFO ] Invariant cache hit.
[2023-03-15 07:17:53] [INFO ] Dead Transitions using invariants and state equation in 1228 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5036 ms. Remains : 828/828 places, 1242/1242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 184 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:17:53] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:17:53] [INFO ] Invariant cache hit.
[2023-03-15 07:17:54] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 07:17:54] [INFO ] After 497ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 07:17:54] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:17:54] [INFO ] After 115ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:17:54] [INFO ] After 870ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:17:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-15 07:17:55] [INFO ] After 495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:17:55] [INFO ] After 119ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:17:56] [INFO ] Deduced a trap composed of 63 places in 451 ms of which 1 ms to minimize.
[2023-03-15 07:17:56] [INFO ] Deduced a trap composed of 11 places in 406 ms of which 4 ms to minimize.
[2023-03-15 07:17:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1030 ms
[2023-03-15 07:17:56] [INFO ] After 1191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-15 07:17:56] [INFO ] After 1974ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Drop transitions removed 359 transitions
Trivial Post-agglo rules discarded 359 transitions
Performed 359 trivial Post agglomeration. Transition count delta: 359
Iterating post reduction 0 with 359 rules applied. Total rules applied 359 place count 828 transition count 883
Reduce places removed 359 places and 0 transitions.
Iterating post reduction 1 with 359 rules applied. Total rules applied 718 place count 469 transition count 883
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 718 place count 469 transition count 703
Deduced a syphon composed of 180 places in 1 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1078 place count 289 transition count 703
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1138 place count 259 transition count 673
Applied a total of 1138 rules in 41 ms. Remains 259 /828 variables (removed 569) and now considering 673/1242 (removed 569) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 259/828 places, 673/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 973609 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :{}
Probabilistic random walk after 973609 steps, saw 142442 distinct states, run finished after 3003 ms. (steps per millisecond=324 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:17:59] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2023-03-15 07:17:59] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 07:17:59] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 07:17:59] [INFO ] After 181ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 07:17:59] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:18:00] [INFO ] After 72ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:18:00] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:18:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 07:18:00] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:18:00] [INFO ] After 51ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:18:00] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 1 ms to minimize.
[2023-03-15 07:18:00] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2023-03-15 07:18:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2023-03-15 07:18:00] [INFO ] After 368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-15 07:18:00] [INFO ] After 679ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 8 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 259/259 places, 673/673 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 8 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
[2023-03-15 07:18:00] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
[2023-03-15 07:18:00] [INFO ] Invariant cache hit.
[2023-03-15 07:18:01] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-15 07:18:01] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
[2023-03-15 07:18:01] [INFO ] Invariant cache hit.
[2023-03-15 07:18:01] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:18:02] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
[2023-03-15 07:18:02] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 07:18:02] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
[2023-03-15 07:18:02] [INFO ] Invariant cache hit.
[2023-03-15 07:18:02] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1768 ms. Remains : 259/259 places, 673/673 transitions.
Graph (trivial) has 508 edges and 259 vertex of which 178 / 259 are part of one of the 30 SCC in 0 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 199
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 199
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 0 with 2 rules applied. Total rules applied 61 place count 81 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 81 transition count 197
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 17 rules applied. Total rules applied 79 place count 70 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 36 edges and 70 vertex of which 30 / 70 are part of one of the 5 SCC in 0 ms
Free SCC test removed 25 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 81 place count 45 transition count 196
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (trivial) has 106 edges and 41 vertex of which 20 / 41 are part of one of the 5 SCC in 1 ms
Free SCC test removed 15 places
Iterating post reduction 2 with 35 rules applied. Total rules applied 116 place count 26 transition count 166
Drop transitions removed 60 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 3 with 123 rules applied. Total rules applied 239 place count 26 transition count 43
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 242 place count 26 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 243 place count 26 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 244 place count 25 transition count 39
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 249 place count 25 transition count 39
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 269 place count 20 transition count 24
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 274 place count 20 transition count 19
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 275 place count 20 transition count 19
Applied a total of 275 rules in 15 ms. Remains 20 /259 variables (removed 239) and now considering 19/673 (removed 654) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 19 rows 20 cols
[2023-03-15 07:18:02] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-15 07:18:02] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-15 07:18:02] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 07:18:02] [INFO ] After 16ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-15 07:18:02] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:18:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-15 07:18:02] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:18:02] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-15 07:18:02] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 231 ms.
Product exploration explored 100000 steps with 0 reset in 314 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Performed 209 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 828 transition count 1242
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 156 Pre rules applied. Total rules applied 209 place count 828 transition count 1341
Deduced a syphon composed of 365 places in 1 ms
Iterating global reduction 1 with 156 rules applied. Total rules applied 365 place count 828 transition count 1341
Discarding 106 places :
Symmetric choice reduction at 1 with 106 rule applications. Total rules 471 place count 722 transition count 1235
Deduced a syphon composed of 259 places in 0 ms
Iterating global reduction 1 with 106 rules applied. Total rules applied 577 place count 722 transition count 1235
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 461 places in 0 ms
Iterating global reduction 1 with 202 rules applied. Total rules applied 779 place count 722 transition count 1235
Discarding 177 places :
Symmetric choice reduction at 1 with 177 rule applications. Total rules 956 place count 545 transition count 1058
Deduced a syphon composed of 284 places in 1 ms
Iterating global reduction 1 with 177 rules applied. Total rules applied 1133 place count 545 transition count 1058
Deduced a syphon composed of 284 places in 0 ms
Applied a total of 1133 rules in 131 ms. Remains 545 /828 variables (removed 283) and now considering 1058/1242 (removed 184) transitions.
[2023-03-15 07:18:04] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 07:18:04] [INFO ] Flow matrix only has 938 transitions (discarded 120 similar events)
// Phase 1: matrix 938 rows 545 cols
[2023-03-15 07:18:04] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 07:18:05] [INFO ] Dead Transitions using invariants and state equation in 956 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 545/828 places, 1058/1242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1117 ms. Remains : 545/828 places, 1058/1242 transitions.
Support contains 3 out of 828 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 16 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:18:05] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2023-03-15 07:18:05] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 07:18:05] [INFO ] Implicit Places using invariants in 533 ms returned []
[2023-03-15 07:18:05] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:18:05] [INFO ] Invariant cache hit.
[2023-03-15 07:18:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:18:08] [INFO ] Implicit Places using invariants and state equation in 3258 ms returned []
Implicit Place search using SMT with State Equation took 3796 ms to find 0 implicit places.
[2023-03-15 07:18:08] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:18:08] [INFO ] Invariant cache hit.
[2023-03-15 07:18:10] [INFO ] Dead Transitions using invariants and state equation in 1385 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5200 ms. Remains : 828/828 places, 1242/1242 transitions.
Treatment of property Peterson-PT-5-LTLFireability-14 finished in 37588 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 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 834 transition count 882
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 474 transition count 882
Performed 179 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 179 Pre rules applied. Total rules applied 720 place count 474 transition count 703
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 1078 place count 295 transition count 703
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 1136 place count 266 transition count 674
Applied a total of 1136 rules in 32 ms. Remains 266 /834 variables (removed 568) and now considering 674/1242 (removed 568) transitions.
[2023-03-15 07:18:10] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 266 cols
[2023-03-15 07:18:10] [INFO ] Computed 23 place invariants in 7 ms
[2023-03-15 07:18:10] [INFO ] Implicit Places using invariants in 363 ms returned [229, 241, 242, 243, 244, 245]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 365 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 260/834 places, 674/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 409 ms. Remains : 260/834 places, 674/1242 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s158 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 298 reset in 224 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 1 ms.
FORMULA Peterson-PT-5-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLFireability-15 finished in 690 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(X(G((p0||(!p1 U (p2||G(!p1))))))))'
Found a Lengthening insensitive property : Peterson-PT-5-LTLFireability-02
Stuttering acceptance computed with spot in 169 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Support contains 270 out of 834 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Iterating post reduction 0 with 175 rules applied. Total rules applied 175 place count 834 transition count 1067
Reduce places removed 175 places and 0 transitions.
Iterating post reduction 1 with 175 rules applied. Total rules applied 350 place count 659 transition count 1067
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 350 place count 659 transition count 1037
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 410 place count 629 transition count 1037
Applied a total of 410 rules in 33 ms. Remains 629 /834 variables (removed 205) and now considering 1037/1242 (removed 205) transitions.
[2023-03-15 07:18:11] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
// Phase 1: matrix 917 rows 629 cols
[2023-03-15 07:18:11] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-15 07:18:11] [INFO ] Implicit Places using invariants in 405 ms returned [593, 605, 606, 607, 608, 609]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 406 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 623/834 places, 1037/1242 transitions.
Applied a total of 0 rules in 10 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 450 ms. Remains : 623/834 places, 1037/1242 transitions.
Running random walk in product with property : Peterson-PT-5-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(OR p0 p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(AND (NOT (OR (AND (EQ s575 1) (EQ s605 1)) (AND (EQ s534 1) (EQ s610 1)) (AND (EQ s574 1) (EQ s599 1)) (AND (EQ s579 1) (EQ s603 1)) (AND (EQ s522 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 557 ms.
Product exploration explored 100000 steps with 0 reset in 598 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 p2 (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 07:18:14] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
// Phase 1: matrix 917 rows 623 cols
[2023-03-15 07:18:14] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 07:18:15] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 07:18:15] [INFO ] After 283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 07:18:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 07:18:19] [INFO ] After 4085ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 07:18:19] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:18:23] [INFO ] After 3817ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 07:18:25] [INFO ] Deduced a trap composed of 22 places in 381 ms of which 1 ms to minimize.
[2023-03-15 07:18:25] [INFO ] Deduced a trap composed of 12 places in 396 ms of which 1 ms to minimize.
[2023-03-15 07:18:25] [INFO ] Deduced a trap composed of 25 places in 377 ms of which 1 ms to minimize.
[2023-03-15 07:18:26] [INFO ] Deduced a trap composed of 24 places in 378 ms of which 1 ms to minimize.
[2023-03-15 07:18:26] [INFO ] Deduced a trap composed of 29 places in 369 ms of which 1 ms to minimize.
[2023-03-15 07:18:27] [INFO ] Deduced a trap composed of 10 places in 333 ms of which 1 ms to minimize.
[2023-03-15 07:18:27] [INFO ] Deduced a trap composed of 21 places in 347 ms of which 1 ms to minimize.
[2023-03-15 07:18:28] [INFO ] Deduced a trap composed of 91 places in 277 ms of which 1 ms to minimize.
[2023-03-15 07:18:28] [INFO ] Deduced a trap composed of 72 places in 264 ms of which 0 ms to minimize.
[2023-03-15 07:18:28] [INFO ] Deduced a trap composed of 107 places in 255 ms of which 1 ms to minimize.
[2023-03-15 07:18:29] [INFO ] Deduced a trap composed of 110 places in 265 ms of which 1 ms to minimize.
[2023-03-15 07:18:29] [INFO ] Deduced a trap composed of 18 places in 382 ms of which 1 ms to minimize.
[2023-03-15 07:18:29] [INFO ] Deduced a trap composed of 10 places in 348 ms of which 0 ms to minimize.
[2023-03-15 07:18:30] [INFO ] Deduced a trap composed of 10 places in 368 ms of which 0 ms to minimize.
[2023-03-15 07:18:31] [INFO ] Deduced a trap composed of 10 places in 343 ms of which 1 ms to minimize.
[2023-03-15 07:18:31] [INFO ] Deduced a trap composed of 82 places in 234 ms of which 1 ms to minimize.
[2023-03-15 07:18:31] [INFO ] Deduced a trap composed of 25 places in 375 ms of which 1 ms to minimize.
[2023-03-15 07:18:32] [INFO ] Deduced a trap composed of 53 places in 340 ms of which 0 ms to minimize.
[2023-03-15 07:18:32] [INFO ] Deduced a trap composed of 25 places in 367 ms of which 1 ms to minimize.
[2023-03-15 07:18:33] [INFO ] Deduced a trap composed of 25 places in 355 ms of which 1 ms to minimize.
[2023-03-15 07:18:33] [INFO ] Deduced a trap composed of 98 places in 283 ms of which 1 ms to minimize.
[2023-03-15 07:18:34] [INFO ] Deduced a trap composed of 104 places in 283 ms of which 0 ms to minimize.
[2023-03-15 07:18:34] [INFO ] Deduced a trap composed of 53 places in 171 ms of which 0 ms to minimize.
[2023-03-15 07:18:34] [INFO ] Deduced a trap composed of 64 places in 265 ms of which 1 ms to minimize.
[2023-03-15 07:18:35] [INFO ] Deduced a trap composed of 13 places in 316 ms of which 1 ms to minimize.
[2023-03-15 07:18:35] [INFO ] Deduced a trap composed of 51 places in 272 ms of which 1 ms to minimize.
[2023-03-15 07:18:36] [INFO ] Deduced a trap composed of 86 places in 286 ms of which 1 ms to minimize.
[2023-03-15 07:18:36] [INFO ] Deduced a trap composed of 84 places in 167 ms of which 0 ms to minimize.
[2023-03-15 07:18:36] [INFO ] Deduced a trap composed of 110 places in 166 ms of which 0 ms to minimize.
[2023-03-15 07:18:36] [INFO ] Deduced a trap composed of 47 places in 266 ms of which 1 ms to minimize.
[2023-03-15 07:18:37] [INFO ] Deduced a trap composed of 38 places in 344 ms of which 1 ms to minimize.
[2023-03-15 07:18:37] [INFO ] Deduced a trap composed of 42 places in 378 ms of which 0 ms to minimize.
[2023-03-15 07:18:38] [INFO ] Deduced a trap composed of 64 places in 338 ms of which 1 ms to minimize.
[2023-03-15 07:18:38] [INFO ] Deduced a trap composed of 84 places in 333 ms of which 1 ms to minimize.
[2023-03-15 07:18:39] [INFO ] Deduced a trap composed of 38 places in 280 ms of which 1 ms to minimize.
[2023-03-15 07:18:39] [INFO ] Deduced a trap composed of 129 places in 188 ms of which 1 ms to minimize.
[2023-03-15 07:18:39] [INFO ] Deduced a trap composed of 67 places in 256 ms of which 1 ms to minimize.
[2023-03-15 07:18:40] [INFO ] Trap strengthening (SAT) tested/added 37/37 trap constraints in 15449 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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-15 07:18:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 07:18:40] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 1 ms.
Support contains 270 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 19 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 623/623 places, 1037/1037 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 212849 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212849 steps, saw 75116 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-15 07:18:43] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 07:18:43] [INFO ] Invariant cache hit.
[2023-03-15 07:18:44] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 07:18:44] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 07:18:44] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 07:18:49] [INFO ] After 4074ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 07:18:49] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:18:52] [INFO ] After 3898ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 07:18:54] [INFO ] Deduced a trap composed of 29 places in 350 ms of which 1 ms to minimize.
[2023-03-15 07:18:55] [INFO ] Deduced a trap composed of 32 places in 336 ms of which 0 ms to minimize.
[2023-03-15 07:18:55] [INFO ] Deduced a trap composed of 10 places in 299 ms of which 1 ms to minimize.
[2023-03-15 07:18:55] [INFO ] Deduced a trap composed of 21 places in 286 ms of which 1 ms to minimize.
[2023-03-15 07:18:56] [INFO ] Deduced a trap composed of 22 places in 288 ms of which 1 ms to minimize.
[2023-03-15 07:18:56] [INFO ] Deduced a trap composed of 10 places in 301 ms of which 0 ms to minimize.
[2023-03-15 07:18:57] [INFO ] Deduced a trap composed of 21 places in 300 ms of which 1 ms to minimize.
[2023-03-15 07:18:57] [INFO ] Deduced a trap composed of 10 places in 296 ms of which 0 ms to minimize.
[2023-03-15 07:18:58] [INFO ] Deduced a trap composed of 40 places in 370 ms of which 1 ms to minimize.
[2023-03-15 07:18:58] [INFO ] Deduced a trap composed of 32 places in 321 ms of which 0 ms to minimize.
[2023-03-15 07:18:58] [INFO ] Deduced a trap composed of 67 places in 193 ms of which 1 ms to minimize.
[2023-03-15 07:18:59] [INFO ] Deduced a trap composed of 101 places in 195 ms of which 1 ms to minimize.
[2023-03-15 07:18:59] [INFO ] Deduced a trap composed of 67 places in 197 ms of which 1 ms to minimize.
[2023-03-15 07:18:59] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5172 ms
[2023-03-15 07:19:01] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 0 ms to minimize.
[2023-03-15 07:19:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2023-03-15 07:19:02] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 1 ms to minimize.
[2023-03-15 07:19:02] [INFO ] Deduced a trap composed of 67 places in 138 ms of which 1 ms to minimize.
[2023-03-15 07:19:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 552 ms
[2023-03-15 07:19:02] [INFO ] After 13740ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5383 ms.
[2023-03-15 07:19:08] [INFO ] After 23471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 37 ms.
Support contains 270 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 10 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 623/623 places, 1037/1037 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 14 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
[2023-03-15 07:19:08] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 07:19:08] [INFO ] Invariant cache hit.
[2023-03-15 07:19:08] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-15 07:19:08] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 07:19:08] [INFO ] Invariant cache hit.
[2023-03-15 07:19:09] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:19:10] [INFO ] Implicit Places using invariants and state equation in 1946 ms returned []
Implicit Place search using SMT with State Equation took 2322 ms to find 0 implicit places.
[2023-03-15 07:19:10] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-15 07:19:10] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 07:19:10] [INFO ] Invariant cache hit.
[2023-03-15 07:19:11] [INFO ] Dead Transitions using invariants and state equation in 1091 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3446 ms. Remains : 623/623 places, 1037/1037 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 623 transition count 917
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 138 place count 611 transition count 911
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 150 place count 605 transition count 905
Free-agglomeration rule applied 125 times.
Iterating global reduction 1 with 125 rules applied. Total rules applied 275 place count 605 transition count 780
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 1 with 125 rules applied. Total rules applied 400 place count 480 transition count 780
Applied a total of 400 rules in 43 ms. Remains 480 /623 variables (removed 143) and now considering 780/1037 (removed 257) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 780 rows 480 cols
[2023-03-15 07:19:11] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-15 07:19:12] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-15 07:19:12] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 07:19:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-15 07:19:16] [INFO ] After 3898ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 07:19:19] [INFO ] After 7466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3484 ms.
[2023-03-15 07:19:23] [INFO ] After 11168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR p0 p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 288 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 174 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Support contains 270 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 5 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
[2023-03-15 07:19:24] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
// Phase 1: matrix 917 rows 623 cols
[2023-03-15 07:19:24] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 07:19:24] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-15 07:19:24] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 07:19:24] [INFO ] Invariant cache hit.
[2023-03-15 07:19:25] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:19:26] [INFO ] Implicit Places using invariants and state equation in 1969 ms returned []
Implicit Place search using SMT with State Equation took 2341 ms to find 0 implicit places.
[2023-03-15 07:19:26] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 07:19:26] [INFO ] Invariant cache hit.
[2023-03-15 07:19:27] [INFO ] Dead Transitions using invariants and state equation in 1073 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3421 ms. Remains : 623/623 places, 1037/1037 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 p1) p2 p0), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (OR p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 245 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 07:19:28] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 07:19:28] [INFO ] Invariant cache hit.
[2023-03-15 07:19:29] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 07:19:29] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 07:19:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 07:19:34] [INFO ] After 4133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 07:19:34] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:19:37] [INFO ] After 3844ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 07:19:39] [INFO ] Deduced a trap composed of 29 places in 349 ms of which 1 ms to minimize.
[2023-03-15 07:19:40] [INFO ] Deduced a trap composed of 32 places in 311 ms of which 0 ms to minimize.
[2023-03-15 07:19:40] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 0 ms to minimize.
[2023-03-15 07:19:40] [INFO ] Deduced a trap composed of 21 places in 287 ms of which 0 ms to minimize.
[2023-03-15 07:19:41] [INFO ] Deduced a trap composed of 22 places in 285 ms of which 1 ms to minimize.
[2023-03-15 07:19:41] [INFO ] Deduced a trap composed of 10 places in 394 ms of which 1 ms to minimize.
[2023-03-15 07:19:42] [INFO ] Deduced a trap composed of 21 places in 340 ms of which 1 ms to minimize.
[2023-03-15 07:19:42] [INFO ] Deduced a trap composed of 10 places in 309 ms of which 1 ms to minimize.
[2023-03-15 07:19:43] [INFO ] Deduced a trap composed of 40 places in 356 ms of which 1 ms to minimize.
[2023-03-15 07:19:43] [INFO ] Deduced a trap composed of 32 places in 327 ms of which 1 ms to minimize.
[2023-03-15 07:19:43] [INFO ] Deduced a trap composed of 67 places in 194 ms of which 1 ms to minimize.
[2023-03-15 07:19:44] [INFO ] Deduced a trap composed of 101 places in 159 ms of which 0 ms to minimize.
[2023-03-15 07:19:44] [INFO ] Deduced a trap composed of 67 places in 199 ms of which 1 ms to minimize.
[2023-03-15 07:19:44] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5246 ms
[2023-03-15 07:19:46] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 1 ms to minimize.
[2023-03-15 07:19:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
[2023-03-15 07:19:47] [INFO ] Deduced a trap composed of 92 places in 154 ms of which 0 ms to minimize.
[2023-03-15 07:19:47] [INFO ] Deduced a trap composed of 67 places in 142 ms of which 1 ms to minimize.
[2023-03-15 07:19:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 581 ms
[2023-03-15 07:19:47] [INFO ] After 13810ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5491 ms.
[2023-03-15 07:19:53] [INFO ] After 23711ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 36 ms.
Support contains 270 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 11 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 623/623 places, 1037/1037 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 251587 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 251587 steps, saw 80447 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-15 07:19:57] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 07:19:57] [INFO ] Invariant cache hit.
[2023-03-15 07:19:57] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 07:19:57] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 07:19:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 07:20:02] [INFO ] After 4088ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 07:20:02] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:20:06] [INFO ] After 3847ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 07:20:07] [INFO ] Deduced a trap composed of 29 places in 345 ms of which 1 ms to minimize.
[2023-03-15 07:20:08] [INFO ] Deduced a trap composed of 32 places in 342 ms of which 0 ms to minimize.
[2023-03-15 07:20:08] [INFO ] Deduced a trap composed of 10 places in 259 ms of which 1 ms to minimize.
[2023-03-15 07:20:09] [INFO ] Deduced a trap composed of 21 places in 293 ms of which 19 ms to minimize.
[2023-03-15 07:20:09] [INFO ] Deduced a trap composed of 22 places in 287 ms of which 1 ms to minimize.
[2023-03-15 07:20:09] [INFO ] Deduced a trap composed of 10 places in 290 ms of which 0 ms to minimize.
[2023-03-15 07:20:10] [INFO ] Deduced a trap composed of 21 places in 285 ms of which 1 ms to minimize.
[2023-03-15 07:20:10] [INFO ] Deduced a trap composed of 10 places in 271 ms of which 0 ms to minimize.
[2023-03-15 07:20:11] [INFO ] Deduced a trap composed of 40 places in 346 ms of which 0 ms to minimize.
[2023-03-15 07:20:11] [INFO ] Deduced a trap composed of 32 places in 309 ms of which 0 ms to minimize.
[2023-03-15 07:20:11] [INFO ] Deduced a trap composed of 67 places in 198 ms of which 0 ms to minimize.
[2023-03-15 07:20:12] [INFO ] Deduced a trap composed of 101 places in 199 ms of which 1 ms to minimize.
[2023-03-15 07:20:12] [INFO ] Deduced a trap composed of 67 places in 156 ms of which 0 ms to minimize.
[2023-03-15 07:20:12] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5069 ms
[2023-03-15 07:20:14] [INFO ] Deduced a trap composed of 44 places in 208 ms of which 0 ms to minimize.
[2023-03-15 07:20:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2023-03-15 07:20:15] [INFO ] Deduced a trap composed of 92 places in 156 ms of which 0 ms to minimize.
[2023-03-15 07:20:15] [INFO ] Deduced a trap composed of 67 places in 146 ms of which 1 ms to minimize.
[2023-03-15 07:20:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 578 ms
[2023-03-15 07:20:15] [INFO ] After 13677ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5345 ms.
[2023-03-15 07:20:21] [INFO ] After 23400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 39 ms.
Support contains 270 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 14 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 623/623 places, 1037/1037 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 14 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
[2023-03-15 07:20:21] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 07:20:21] [INFO ] Invariant cache hit.
[2023-03-15 07:20:21] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-03-15 07:20:21] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 07:20:21] [INFO ] Invariant cache hit.
[2023-03-15 07:20:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:20:23] [INFO ] Implicit Places using invariants and state equation in 1885 ms returned []
Implicit Place search using SMT with State Equation took 2381 ms to find 0 implicit places.
[2023-03-15 07:20:23] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-15 07:20:23] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 07:20:23] [INFO ] Invariant cache hit.
[2023-03-15 07:20:24] [INFO ] Dead Transitions using invariants and state equation in 832 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3254 ms. Remains : 623/623 places, 1037/1037 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 623 transition count 917
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 138 place count 611 transition count 911
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 150 place count 605 transition count 905
Free-agglomeration rule applied 125 times.
Iterating global reduction 1 with 125 rules applied. Total rules applied 275 place count 605 transition count 780
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 1 with 125 rules applied. Total rules applied 400 place count 480 transition count 780
Applied a total of 400 rules in 52 ms. Remains 480 /623 variables (removed 143) and now considering 780/1037 (removed 257) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 780 rows 480 cols
[2023-03-15 07:20:24] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-15 07:20:25] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-15 07:20:25] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 07:20:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-15 07:20:29] [INFO ] After 3802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 07:20:32] [INFO ] After 7283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3413 ms.
[2023-03-15 07:20:36] [INFO ] After 10925ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (OR p0 p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 271 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 190 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 301 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1066 ms.
Product exploration explored 100000 steps with 0 reset in 1160 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 176 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Support contains 270 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 11 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
[2023-03-15 07:20:39] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-15 07:20:39] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
// Phase 1: matrix 917 rows 623 cols
[2023-03-15 07:20:39] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 07:20:40] [INFO ] Dead Transitions using invariants and state equation in 813 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 843 ms. Remains : 623/623 places, 1037/1037 transitions.
Support contains 270 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 4 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
[2023-03-15 07:20:40] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 07:20:40] [INFO ] Invariant cache hit.
[2023-03-15 07:20:40] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-15 07:20:40] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 07:20:40] [INFO ] Invariant cache hit.
[2023-03-15 07:20:41] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:20:42] [INFO ] Implicit Places using invariants and state equation in 1944 ms returned []
Implicit Place search using SMT with State Equation took 2299 ms to find 0 implicit places.
[2023-03-15 07:20:42] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 07:20:42] [INFO ] Invariant cache hit.
[2023-03-15 07:20:43] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3133 ms. Remains : 623/623 places, 1037/1037 transitions.
Treatment of property Peterson-PT-5-LTLFireability-02 finished in 152706 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((X(G(p0))||G(p1)||(p1&&F(!p2))))))'
Found a Lengthening insensitive property : Peterson-PT-5-LTLFireability-14
Stuttering acceptance computed with spot in 277 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p0) p2), (NOT p0)]
Support contains 5 out of 834 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 834 transition count 884
Reduce places removed 358 places and 0 transitions.
Iterating post reduction 1 with 358 rules applied. Total rules applied 716 place count 476 transition count 884
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 716 place count 476 transition count 704
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1076 place count 296 transition count 704
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 1134 place count 267 transition count 675
Applied a total of 1134 rules in 38 ms. Remains 267 /834 variables (removed 567) and now considering 675/1242 (removed 567) transitions.
[2023-03-15 07:20:44] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
// Phase 1: matrix 555 rows 267 cols
[2023-03-15 07:20:44] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-15 07:20:44] [INFO ] Implicit Places using invariants in 429 ms returned [230, 242, 243, 244, 245, 246]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 444 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 261/834 places, 675/1242 transitions.
Applied a total of 0 rules in 6 ms. Remains 261 /261 variables (removed 0) and now considering 675/675 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 488 ms. Remains : 261/834 places, 675/1242 transitions.
Running random walk in product with property : Peterson-PT-5-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 0}, { cond=(AND p2 p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(NEQ s154 1), p2:(AND (EQ s205 1) (EQ s234 1)), p0:(OR (EQ s182 0) (EQ s214 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 224 ms.
Product exploration explored 100000 steps with 0 reset in 292 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND p1 p2))), (X (AND p1 (NOT p2))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X p1)), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p0))))), (X (X (NOT (AND p1 p2 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 9 factoid took 609 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[true, (OR (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-15 07:20:46] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
// Phase 1: matrix 555 rows 261 cols
[2023-03-15 07:20:46] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 07:20:46] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 07:20:46] [INFO ] After 219ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:1
[2023-03-15 07:20:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:20:46] [INFO ] After 60ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-15 07:20:46] [INFO ] After 398ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-15 07:20:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 07:20:47] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-15 07:20:47] [INFO ] After 80ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-03-15 07:20:47] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 0 ms to minimize.
[2023-03-15 07:20:47] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:20:47] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2023-03-15 07:20:47] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2023-03-15 07:20:47] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:20:47] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 1 ms to minimize.
[2023-03-15 07:20:48] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 1 ms to minimize.
[2023-03-15 07:20:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 935 ms
[2023-03-15 07:20:48] [INFO ] After 1072ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-15 07:20:48] [INFO ] After 1443ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 675/675 transitions.
Applied a total of 0 rules in 7 ms. Remains 261 /261 variables (removed 0) and now considering 675/675 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 261/261 places, 675/675 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 728021 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 728021 steps, saw 106765 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 07:20:51] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
[2023-03-15 07:20:51] [INFO ] Invariant cache hit.
[2023-03-15 07:20:51] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 07:20:51] [INFO ] After 208ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-15 07:20:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:20:51] [INFO ] After 56ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 07:20:51] [INFO ] After 370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 07:20:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 07:20:52] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 07:20:52] [INFO ] After 72ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 07:20:52] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2023-03-15 07:20:52] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
[2023-03-15 07:20:52] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2023-03-15 07:20:52] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 0 ms to minimize.
[2023-03-15 07:20:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 532 ms
[2023-03-15 07:20:52] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2023-03-15 07:20:52] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 0 ms to minimize.
[2023-03-15 07:20:53] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2023-03-15 07:20:53] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2023-03-15 07:20:53] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2023-03-15 07:20:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 717 ms
[2023-03-15 07:20:53] [INFO ] After 1364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-15 07:20:53] [INFO ] After 1699ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 675/675 transitions.
Applied a total of 0 rules in 7 ms. Remains 261 /261 variables (removed 0) and now considering 675/675 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 261/261 places, 675/675 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 675/675 transitions.
Applied a total of 0 rules in 7 ms. Remains 261 /261 variables (removed 0) and now considering 675/675 (removed 0) transitions.
[2023-03-15 07:20:53] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
[2023-03-15 07:20:53] [INFO ] Invariant cache hit.
[2023-03-15 07:20:53] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-15 07:20:53] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
[2023-03-15 07:20:53] [INFO ] Invariant cache hit.
[2023-03-15 07:20:54] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:20:54] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
[2023-03-15 07:20:54] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 07:20:54] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
[2023-03-15 07:20:54] [INFO ] Invariant cache hit.
[2023-03-15 07:20:55] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1843 ms. Remains : 261/261 places, 675/675 transitions.
Graph (trivial) has 491 edges and 261 vertex of which 172 / 261 are part of one of the 29 SCC in 0 ms
Free SCC test removed 143 places
Drop transitions removed 286 transitions
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 433 transitions.
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 27 Pre rules applied. Total rules applied 1 place count 118 transition count 215
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 0 with 54 rules applied. Total rules applied 55 place count 91 transition count 215
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 0 with 2 rules applied. Total rules applied 57 place count 90 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 58 place count 90 transition count 213
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 17 rules applied. Total rules applied 75 place count 79 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 41 edges and 79 vertex of which 24 / 79 are part of one of the 4 SCC in 0 ms
Free SCC test removed 20 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 59 transition count 211
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (trivial) has 88 edges and 55 vertex of which 15 / 55 are part of one of the 5 SCC in 0 ms
Free SCC test removed 10 places
Iterating post reduction 2 with 29 rules applied. Total rules applied 107 place count 45 transition count 187
Drop transitions removed 30 transitions
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 3 with 92 rules applied. Total rules applied 199 place count 45 transition count 95
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 209 place count 45 transition count 85
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 212 place count 45 transition count 82
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 216 place count 42 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 217 place count 41 transition count 81
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 217 place count 41 transition count 80
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 219 place count 40 transition count 80
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 220 place count 40 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 221 place count 39 transition count 79
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 225 place count 39 transition count 91
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 8 with 32 rules applied. Total rules applied 257 place count 35 transition count 63
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 265 place count 35 transition count 55
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 267 place count 35 transition count 55
Applied a total of 267 rules in 24 ms. Remains 35 /261 variables (removed 226) and now considering 55/675 (removed 620) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 55 rows 35 cols
[2023-03-15 07:20:55] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-15 07:20:55] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-15 07:20:55] [INFO ] After 31ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-15 07:20:55] [INFO ] After 45ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-15 07:20:55] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-15 07:20:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-15 07:20:55] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 07:20:55] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-15 07:20:55] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND p1 p2))), (X (AND p1 (NOT p2))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X p1)), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (G (NOT (AND (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (AND p1 p2)), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (AND p0 p2)), (F (NOT p1)), (F (OR (AND p0 (NOT p1)) (AND (NOT p1) (NOT p2)))), (F (AND p0 p1 p2))]
Knowledge based reduction with 11 factoid took 869 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 261 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 675/675 transitions.
Applied a total of 0 rules in 3 ms. Remains 261 /261 variables (removed 0) and now considering 675/675 (removed 0) transitions.
[2023-03-15 07:20:56] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
// Phase 1: matrix 555 rows 261 cols
[2023-03-15 07:20:56] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 07:20:56] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-15 07:20:56] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
[2023-03-15 07:20:56] [INFO ] Invariant cache hit.
[2023-03-15 07:20:57] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:20:57] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
[2023-03-15 07:20:57] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
[2023-03-15 07:20:57] [INFO ] Invariant cache hit.
[2023-03-15 07:20:58] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1675 ms. Remains : 261/261 places, 675/675 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 254 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:20:58] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
[2023-03-15 07:20:58] [INFO ] Invariant cache hit.
[2023-03-15 07:20:58] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-15 07:20:58] [INFO ] After 169ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 07:20:58] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:20:59] [INFO ] After 75ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:20:59] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:20:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 07:20:59] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:20:59] [INFO ] After 51ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:20:59] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 0 ms to minimize.
[2023-03-15 07:20:59] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2023-03-15 07:20:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
[2023-03-15 07:20:59] [INFO ] After 377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-15 07:20:59] [INFO ] After 655ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 675/675 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 261 transition count 674
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 674
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 0 with 2 rules applied. Total rules applied 4 place count 259 transition count 673
Applied a total of 4 rules in 14 ms. Remains 259 /261 variables (removed 2) and now considering 673/675 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 259/261 places, 673/675 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1042538 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :{}
Probabilistic random walk after 1042538 steps, saw 152318 distinct states, run finished after 3001 ms. (steps per millisecond=347 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:21:02] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2023-03-15 07:21:02] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 07:21:02] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 07:21:03] [INFO ] After 171ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 07:21:03] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:21:03] [INFO ] After 46ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:21:03] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:21:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 07:21:03] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:21:03] [INFO ] After 51ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:21:03] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 1 ms to minimize.
[2023-03-15 07:21:03] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2023-03-15 07:21:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 320 ms
[2023-03-15 07:21:03] [INFO ] After 389ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-15 07:21:03] [INFO ] After 701ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 7 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 259/259 places, 673/673 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 7 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
[2023-03-15 07:21:03] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
[2023-03-15 07:21:03] [INFO ] Invariant cache hit.
[2023-03-15 07:21:04] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-15 07:21:04] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
[2023-03-15 07:21:04] [INFO ] Invariant cache hit.
[2023-03-15 07:21:04] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:21:05] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1299 ms to find 0 implicit places.
[2023-03-15 07:21:05] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 07:21:05] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
[2023-03-15 07:21:05] [INFO ] Invariant cache hit.
[2023-03-15 07:21:05] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1839 ms. Remains : 259/259 places, 673/673 transitions.
Graph (trivial) has 508 edges and 259 vertex of which 178 / 259 are part of one of the 30 SCC in 1 ms
Free SCC test removed 148 places
Drop transitions removed 296 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 445 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 199
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 199
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 0 with 2 rules applied. Total rules applied 61 place count 81 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 81 transition count 197
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 17 rules applied. Total rules applied 79 place count 70 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 36 edges and 70 vertex of which 30 / 70 are part of one of the 5 SCC in 0 ms
Free SCC test removed 25 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 81 place count 45 transition count 196
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (trivial) has 106 edges and 41 vertex of which 20 / 41 are part of one of the 5 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 2 with 35 rules applied. Total rules applied 116 place count 26 transition count 166
Drop transitions removed 60 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 3 with 123 rules applied. Total rules applied 239 place count 26 transition count 43
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 242 place count 26 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 243 place count 26 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 244 place count 25 transition count 39
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 249 place count 25 transition count 39
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 269 place count 20 transition count 24
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 274 place count 20 transition count 19
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 275 place count 20 transition count 19
Applied a total of 275 rules in 18 ms. Remains 20 /259 variables (removed 239) and now considering 19/673 (removed 654) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 19 rows 20 cols
[2023-03-15 07:21:05] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-15 07:21:05] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-15 07:21:05] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 07:21:05] [INFO ] After 14ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-15 07:21:05] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:21:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-15 07:21:05] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:21:05] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-15 07:21:05] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 194 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 221 ms.
Product exploration explored 100000 steps with 0 reset in 248 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 675/675 transitions.
Applied a total of 0 rules in 7 ms. Remains 261 /261 variables (removed 0) and now considering 675/675 (removed 0) transitions.
[2023-03-15 07:21:07] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 07:21:07] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
// Phase 1: matrix 555 rows 261 cols
[2023-03-15 07:21:07] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 07:21:07] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 521 ms. Remains : 261/261 places, 675/675 transitions.
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 675/675 transitions.
Applied a total of 0 rules in 3 ms. Remains 261 /261 variables (removed 0) and now considering 675/675 (removed 0) transitions.
[2023-03-15 07:21:07] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
[2023-03-15 07:21:07] [INFO ] Invariant cache hit.
[2023-03-15 07:21:07] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-15 07:21:07] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
[2023-03-15 07:21:07] [INFO ] Invariant cache hit.
[2023-03-15 07:21:08] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:21:08] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1309 ms to find 0 implicit places.
[2023-03-15 07:21:08] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
[2023-03-15 07:21:08] [INFO ] Invariant cache hit.
[2023-03-15 07:21:09] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1911 ms. Remains : 261/261 places, 675/675 transitions.
Treatment of property Peterson-PT-5-LTLFireability-14 finished in 25664 ms.
[2023-03-15 07:21:09] [INFO ] Flatten gal took : 77 ms
[2023-03-15 07:21:09] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2023-03-15 07:21:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 834 places, 1242 transitions and 3828 arcs took 8 ms.
Total runtime 517005 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Peterson-PT-5
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability
BK_STOP 1678865312725
--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 Peterson-PT-5-LTLFireability-14
lola: time limit : 1794 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1794 4/32 Peterson-PT-5-LTLFireability-14 235240 m, 47048 m/sec, 869799 t fired, .
Time elapsed: 17 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1794 6/32 Peterson-PT-5-LTLFireability-14 386851 m, 30322 m/sec, 1781380 t fired, .
Time elapsed: 22 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1794 8/32 Peterson-PT-5-LTLFireability-14 536737 m, 29977 m/sec, 2678529 t fired, .
Time elapsed: 27 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1794 10/32 Peterson-PT-5-LTLFireability-14 689597 m, 30572 m/sec, 3571158 t fired, .
Time elapsed: 32 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1794 12/32 Peterson-PT-5-LTLFireability-14 841742 m, 30429 m/sec, 4447630 t fired, .
Time elapsed: 37 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1794 13/32 Peterson-PT-5-LTLFireability-14 977134 m, 27078 m/sec, 5323498 t fired, .
Time elapsed: 42 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1794 14/32 Peterson-PT-5-LTLFireability-14 1045402 m, 13653 m/sec, 6231900 t fired, .
Time elapsed: 47 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1794 16/32 Peterson-PT-5-LTLFireability-14 1270293 m, 44978 m/sec, 7083729 t fired, .
Time elapsed: 52 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1794 17/32 Peterson-PT-5-LTLFireability-14 1415526 m, 29046 m/sec, 7955119 t fired, .
Time elapsed: 57 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1794 18/32 Peterson-PT-5-LTLFireability-14 1554300 m, 27754 m/sec, 8784660 t fired, .
Time elapsed: 62 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/1794 19/32 Peterson-PT-5-LTLFireability-14 1691281 m, 27396 m/sec, 9597290 t fired, .
Time elapsed: 67 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/1794 19/32 Peterson-PT-5-LTLFireability-14 1831549 m, 28053 m/sec, 10400538 t fired, .
Time elapsed: 72 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/1794 20/32 Peterson-PT-5-LTLFireability-14 1972700 m, 28230 m/sec, 11191438 t fired, .
Time elapsed: 77 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/1794 21/32 Peterson-PT-5-LTLFireability-14 2086355 m, 22731 m/sec, 12015812 t fired, .
Time elapsed: 82 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 75/1794 22/32 Peterson-PT-5-LTLFireability-14 2208427 m, 24414 m/sec, 12807916 t fired, .
Time elapsed: 87 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 80/1794 23/32 Peterson-PT-5-LTLFireability-14 2364936 m, 31301 m/sec, 13630817 t fired, .
Time elapsed: 92 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 85/1794 24/32 Peterson-PT-5-LTLFireability-14 2499959 m, 27004 m/sec, 14441787 t fired, .
Time elapsed: 97 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 90/1794 25/32 Peterson-PT-5-LTLFireability-14 2636182 m, 27244 m/sec, 15256718 t fired, .
Time elapsed: 102 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 95/1794 26/32 Peterson-PT-5-LTLFireability-14 2774967 m, 27757 m/sec, 16066748 t fired, .
Time elapsed: 107 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 100/1794 26/32 Peterson-PT-5-LTLFireability-14 2913045 m, 27615 m/sec, 16868167 t fired, .
Time elapsed: 112 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 105/1794 27/32 Peterson-PT-5-LTLFireability-14 3044705 m, 26332 m/sec, 17655140 t fired, .
Time elapsed: 117 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 110/1794 28/32 Peterson-PT-5-LTLFireability-14 3154517 m, 21962 m/sec, 18489116 t fired, .
Time elapsed: 122 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 115/1794 30/32 Peterson-PT-5-LTLFireability-14 3304760 m, 30048 m/sec, 19319403 t fired, .
Time elapsed: 127 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 120/1794 32/32 Peterson-PT-5-LTLFireability-14 3454008 m, 29849 m/sec, 20217431 t fired, .
Time elapsed: 132 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for Peterson-PT-5-LTLFireability-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 137 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 Peterson-PT-5-LTLFireability-02
lola: time limit : 3463 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3463 1/32 Peterson-PT-5-LTLFireability-02 49610 m, 9922 m/sec, 99374 t fired, .
Time elapsed: 142 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3463 2/32 Peterson-PT-5-LTLFireability-02 97728 m, 9623 m/sec, 212328 t fired, .
Time elapsed: 147 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3463 3/32 Peterson-PT-5-LTLFireability-02 143479 m, 9150 m/sec, 361961 t fired, .
Time elapsed: 152 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3463 3/32 Peterson-PT-5-LTLFireability-02 183817 m, 8067 m/sec, 608999 t fired, .
Time elapsed: 157 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3463 4/32 Peterson-PT-5-LTLFireability-02 224318 m, 8100 m/sec, 853458 t fired, .
Time elapsed: 162 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3463 4/32 Peterson-PT-5-LTLFireability-02 264851 m, 8106 m/sec, 1097831 t fired, .
Time elapsed: 167 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3463 5/32 Peterson-PT-5-LTLFireability-02 305197 m, 8069 m/sec, 1340642 t fired, .
Time elapsed: 172 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3463 5/32 Peterson-PT-5-LTLFireability-02 345610 m, 8082 m/sec, 1582488 t fired, .
Time elapsed: 177 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3463 6/32 Peterson-PT-5-LTLFireability-02 385812 m, 8040 m/sec, 1823647 t fired, .
Time elapsed: 182 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3463 6/32 Peterson-PT-5-LTLFireability-02 426170 m, 8071 m/sec, 2065685 t fired, .
Time elapsed: 187 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3463 7/32 Peterson-PT-5-LTLFireability-02 466350 m, 8036 m/sec, 2306310 t fired, .
Time elapsed: 192 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3463 7/32 Peterson-PT-5-LTLFireability-02 506360 m, 8002 m/sec, 2543964 t fired, .
Time elapsed: 197 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3463 8/32 Peterson-PT-5-LTLFireability-02 546306 m, 7989 m/sec, 2781586 t fired, .
Time elapsed: 202 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3463 8/32 Peterson-PT-5-LTLFireability-02 586513 m, 8041 m/sec, 3017960 t fired, .
Time elapsed: 207 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3463 9/32 Peterson-PT-5-LTLFireability-02 627007 m, 8098 m/sec, 3252594 t fired, .
Time elapsed: 212 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3463 10/32 Peterson-PT-5-LTLFireability-02 667179 m, 8034 m/sec, 3487762 t fired, .
Time elapsed: 217 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3463 10/32 Peterson-PT-5-LTLFireability-02 707591 m, 8082 m/sec, 3718314 t fired, .
Time elapsed: 222 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3463 11/32 Peterson-PT-5-LTLFireability-02 747622 m, 8006 m/sec, 3951116 t fired, .
Time elapsed: 227 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/3463 11/32 Peterson-PT-5-LTLFireability-02 787624 m, 8000 m/sec, 4183429 t fired, .
Time elapsed: 232 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 100/3463 12/32 Peterson-PT-5-LTLFireability-02 827367 m, 7948 m/sec, 4418907 t fired, .
Time elapsed: 237 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 105/3463 12/32 Peterson-PT-5-LTLFireability-02 867502 m, 8027 m/sec, 4648287 t fired, .
Time elapsed: 242 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 110/3463 13/32 Peterson-PT-5-LTLFireability-02 907620 m, 8023 m/sec, 4857527 t fired, .
Time elapsed: 247 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 115/3463 13/32 Peterson-PT-5-LTLFireability-02 942788 m, 7033 m/sec, 5166911 t fired, .
Time elapsed: 252 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 120/3463 14/32 Peterson-PT-5-LTLFireability-02 983006 m, 8043 m/sec, 5404023 t fired, .
Time elapsed: 257 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 125/3463 14/32 Peterson-PT-5-LTLFireability-02 1022870 m, 7972 m/sec, 5648230 t fired, .
Time elapsed: 262 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 130/3463 14/32 Peterson-PT-5-LTLFireability-02 1042336 m, 3893 m/sec, 6232941 t fired, .
Time elapsed: 267 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 135/3463 15/32 Peterson-PT-5-LTLFireability-02 1089638 m, 9460 m/sec, 6344496 t fired, .
Time elapsed: 272 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 140/3463 16/32 Peterson-PT-5-LTLFireability-02 1137206 m, 9513 m/sec, 6454910 t fired, .
Time elapsed: 277 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 145/3463 16/32 Peterson-PT-5-LTLFireability-02 1182436 m, 9046 m/sec, 6604222 t fired, .
Time elapsed: 282 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 150/3463 17/32 Peterson-PT-5-LTLFireability-02 1222396 m, 7992 m/sec, 6846183 t fired, .
Time elapsed: 287 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 155/3463 17/32 Peterson-PT-5-LTLFireability-02 1262612 m, 8043 m/sec, 7088091 t fired, .
Time elapsed: 292 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 160/3463 18/32 Peterson-PT-5-LTLFireability-02 1300520 m, 7581 m/sec, 7317041 t fired, .
Time elapsed: 297 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 165/3463 18/32 Peterson-PT-5-LTLFireability-02 1338546 m, 7605 m/sec, 7544914 t fired, .
Time elapsed: 302 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 170/3463 19/32 Peterson-PT-5-LTLFireability-02 1376606 m, 7612 m/sec, 7775196 t fired, .
Time elapsed: 307 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 175/3463 19/32 Peterson-PT-5-LTLFireability-02 1415498 m, 7778 m/sec, 8006160 t fired, .
Time elapsed: 312 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 180/3463 20/32 Peterson-PT-5-LTLFireability-02 1453924 m, 7685 m/sec, 8238791 t fired, .
Time elapsed: 317 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 185/3463 20/32 Peterson-PT-5-LTLFireability-02 1491796 m, 7574 m/sec, 8464788 t fired, .
Time elapsed: 322 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 190/3463 21/32 Peterson-PT-5-LTLFireability-02 1529725 m, 7585 m/sec, 8692205 t fired, .
Time elapsed: 327 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 195/3463 21/32 Peterson-PT-5-LTLFireability-02 1567717 m, 7598 m/sec, 8917383 t fired, .
Time elapsed: 332 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 200/3463 22/32 Peterson-PT-5-LTLFireability-02 1605235 m, 7503 m/sec, 9144082 t fired, .
Time elapsed: 337 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 205/3463 22/32 Peterson-PT-5-LTLFireability-02 1642682 m, 7489 m/sec, 9366149 t fired, .
Time elapsed: 342 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 210/3463 23/32 Peterson-PT-5-LTLFireability-02 1681052 m, 7674 m/sec, 9588172 t fired, .
Time elapsed: 347 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 215/3463 23/32 Peterson-PT-5-LTLFireability-02 1719265 m, 7642 m/sec, 9808815 t fired, .
Time elapsed: 352 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 220/3463 24/32 Peterson-PT-5-LTLFireability-02 1757726 m, 7692 m/sec, 10023911 t fired, .
Time elapsed: 357 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 225/3463 24/32 Peterson-PT-5-LTLFireability-02 1797193 m, 7893 m/sec, 10257222 t fired, .
Time elapsed: 362 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 230/3463 25/32 Peterson-PT-5-LTLFireability-02 1837309 m, 8023 m/sec, 10483853 t fired, .
Time elapsed: 367 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 235/3463 25/32 Peterson-PT-5-LTLFireability-02 1877023 m, 7942 m/sec, 10717894 t fired, .
Time elapsed: 372 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 240/3463 26/32 Peterson-PT-5-LTLFireability-02 1917181 m, 8031 m/sec, 10944082 t fired, .
Time elapsed: 377 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 245/3463 26/32 Peterson-PT-5-LTLFireability-02 1958053 m, 8174 m/sec, 11154136 t fired, .
Time elapsed: 382 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 250/3463 27/32 Peterson-PT-5-LTLFireability-02 1992623 m, 6914 m/sec, 11472391 t fired, .
Time elapsed: 387 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 255/3463 27/32 Peterson-PT-5-LTLFireability-02 2032792 m, 8033 m/sec, 11706918 t fired, .
Time elapsed: 392 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 260/3463 28/32 Peterson-PT-5-LTLFireability-02 2072431 m, 7927 m/sec, 11952012 t fired, .
Time elapsed: 397 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 265/3463 28/32 Peterson-PT-5-LTLFireability-02 2090445 m, 3602 m/sec, 12537935 t fired, .
Time elapsed: 402 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 270/3463 28/32 Peterson-PT-5-LTLFireability-02 2138732 m, 9657 m/sec, 12645026 t fired, .
Time elapsed: 407 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 275/3463 29/32 Peterson-PT-5-LTLFireability-02 2186406 m, 9534 m/sec, 12755974 t fired, .
Time elapsed: 412 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 280/3463 30/32 Peterson-PT-5-LTLFireability-02 2232446 m, 9208 m/sec, 12890569 t fired, .
Time elapsed: 417 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 285/3463 30/32 Peterson-PT-5-LTLFireability-02 2272303 m, 7971 m/sec, 13133870 t fired, .
Time elapsed: 422 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 290/3463 31/32 Peterson-PT-5-LTLFireability-02 2312158 m, 7971 m/sec, 13373838 t fired, .
Time elapsed: 427 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 295/3463 31/32 Peterson-PT-5-LTLFireability-02 2351916 m, 7951 m/sec, 13611889 t fired, .
Time elapsed: 432 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 300/3463 32/32 Peterson-PT-5-LTLFireability-02 2391408 m, 7898 m/sec, 13852345 t fired, .
Time elapsed: 437 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for Peterson-PT-5-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-5-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Peterson-PT-5-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 442 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-5-LTLFireability-02: LTL unknown AGGR
Peterson-PT-5-LTLFireability-14: LTL unknown AGGR
Time elapsed: 442 secs. Pages in use: 32
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="Peterson-PT-5"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is Peterson-PT-5, 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 r263-smll-167863538500628"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-5.tgz
mv Peterson-PT-5 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;