About the Execution of LTSMin+red for Szymanski-PT-b02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2047.256 | 906532.00 | 988811.00 | 2485.10 | TF?F?F?FFTFTFT?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.r489-tall-167912706800452.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Szymanski-PT-b02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706800452
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 7.6K Feb 26 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 16:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 16:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 16:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 Szymanski-PT-b02-LTLFireability-00
FORMULA_NAME Szymanski-PT-b02-LTLFireability-01
FORMULA_NAME Szymanski-PT-b02-LTLFireability-02
FORMULA_NAME Szymanski-PT-b02-LTLFireability-03
FORMULA_NAME Szymanski-PT-b02-LTLFireability-04
FORMULA_NAME Szymanski-PT-b02-LTLFireability-05
FORMULA_NAME Szymanski-PT-b02-LTLFireability-06
FORMULA_NAME Szymanski-PT-b02-LTLFireability-07
FORMULA_NAME Szymanski-PT-b02-LTLFireability-08
FORMULA_NAME Szymanski-PT-b02-LTLFireability-09
FORMULA_NAME Szymanski-PT-b02-LTLFireability-10
FORMULA_NAME Szymanski-PT-b02-LTLFireability-11
FORMULA_NAME Szymanski-PT-b02-LTLFireability-12
FORMULA_NAME Szymanski-PT-b02-LTLFireability-13
FORMULA_NAME Szymanski-PT-b02-LTLFireability-14
FORMULA_NAME Szymanski-PT-b02-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679246584937
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b02
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 17:23:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 17:23:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:23:06] [INFO ] Load time of PNML (sax parser for PT used): 307 ms
[2023-03-19 17:23:06] [INFO ] Transformed 568 places.
[2023-03-19 17:23:06] [INFO ] Transformed 8320 transitions.
[2023-03-19 17:23:06] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 488 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 260 places in 18 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b02-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 8064
Applied a total of 2 rules in 133 ms. Remains 306 /308 variables (removed 2) and now considering 8064/8064 (removed 0) transitions.
[2023-03-19 17:23:07] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2023-03-19 17:23:07] [INFO ] Computed 1 place invariants in 67 ms
[2023-03-19 17:23:07] [INFO ] Implicit Places using invariants in 630 ms returned []
[2023-03-19 17:23:07] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 17:23:07] [INFO ] Invariant cache hit.
[2023-03-19 17:23:08] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:23:13] [INFO ] Implicit Places using invariants and state equation in 5254 ms returned []
Implicit Place search using SMT with State Equation took 5910 ms to find 0 implicit places.
[2023-03-19 17:23:13] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 17:23:13] [INFO ] Invariant cache hit.
[2023-03-19 17:23:15] [INFO ] Dead Transitions using invariants and state equation in 2138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 306/308 places, 8064/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8187 ms. Remains : 306/308 places, 8064/8064 transitions.
Support contains 54 out of 306 places after structural reductions.
[2023-03-19 17:23:16] [INFO ] Flatten gal took : 491 ms
[2023-03-19 17:23:16] [INFO ] Flatten gal took : 282 ms
[2023-03-19 17:23:16] [INFO ] Input system was already deterministic with 8064 transitions.
Support contains 52 out of 306 places (down from 54) after GAL structural reductions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 29) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2023-03-19 17:23:17] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 17:23:17] [INFO ] Invariant cache hit.
[2023-03-19 17:23:18] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 17:23:43] [INFO ] After 24620ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9 real:14
[2023-03-19 17:23:43] [INFO ] State equation strengthened by 147 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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-19 17:23:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 17:23:43] [INFO ] After 25043ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 24 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 46 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 449 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 451 ms. Remains : 306/306 places, 8064/8064 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 89853 steps, run timeout after 3015 ms. (steps per millisecond=29 ) properties seen :{7=1}
Probabilistic random walk after 89853 steps, saw 34144 distinct states, run finished after 3016 ms. (steps per millisecond=29 ) properties seen :1
Running SMT prover for 22 properties.
[2023-03-19 17:23:46] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 17:23:46] [INFO ] Invariant cache hit.
[2023-03-19 17:23:47] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 17:24:11] [INFO ] After 24553ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:16
[2023-03-19 17:24:11] [INFO ] State equation strengthened by 147 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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-19 17:24:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 17:24:11] [INFO ] After 25025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 43 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 306 transition count 8011
Applied a total of 53 rules in 222 ms. Remains 306 /306 variables (removed 0) and now considering 8011/8064 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 306/306 places, 8011/8064 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 101155 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101155 steps, saw 36815 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 21 properties.
[2023-03-19 17:24:15] [INFO ] Flow matrix only has 2680 transitions (discarded 5331 similar events)
// Phase 1: matrix 2680 rows 306 cols
[2023-03-19 17:24:15] [INFO ] Computed 1 place invariants in 39 ms
[2023-03-19 17:24:15] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 17:24:40] [INFO ] After 24778ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:15
[2023-03-19 17:24:40] [INFO ] State equation strengthened by 147 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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-19 17:24:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 17:24:40] [INFO ] After 25029ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 41 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8011/8011 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 306 transition count 8010
Applied a total of 1 rules in 214 ms. Remains 306 /306 variables (removed 0) and now considering 8010/8011 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 306/306 places, 8010/8011 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 91143 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91143 steps, saw 34474 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 21 properties.
[2023-03-19 17:24:44] [INFO ] Flow matrix only has 2679 transitions (discarded 5331 similar events)
// Phase 1: matrix 2679 rows 306 cols
[2023-03-19 17:24:44] [INFO ] Computed 1 place invariants in 27 ms
[2023-03-19 17:24:44] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:24:58] [INFO ] After 13254ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:19
[2023-03-19 17:24:58] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:24:59] [INFO ] After 1221ms SMT Verify possible using 147 Read/Feed constraints in real domain returned unsat :1 sat :0 real:20
[2023-03-19 17:24:59] [INFO ] After 14732ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:20
[2023-03-19 17:24:59] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:25:23] [INFO ] After 23707ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :20
[2023-03-19 17:25:24] [INFO ] After 1050ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :19
[2023-03-19 17:25:24] [INFO ] After 1051ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :19
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-19 17:25:24] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :19
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 274 ms.
Support contains 37 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8010/8010 transitions.
Applied a total of 0 rules in 287 ms. Remains 306 /306 variables (removed 0) and now considering 8010/8010 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 306/306 places, 8010/8010 transitions.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 12 stabilizing places and 2432 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 418 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 17:25:25] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 17:25:25] [INFO ] Computed 1 place invariants in 39 ms
[2023-03-19 17:25:26] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-19 17:25:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:25:26] [INFO ] Invariant cache hit.
[2023-03-19 17:25:26] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:25:33] [INFO ] Implicit Places using invariants and state equation in 7648 ms returned []
Implicit Place search using SMT with State Equation took 8106 ms to find 0 implicit places.
[2023-03-19 17:25:34] [INFO ] Redundant transitions in 1043 ms returned []
[2023-03-19 17:25:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:25:34] [INFO ] Invariant cache hit.
[2023-03-19 17:25:36] [INFO ] Dead Transitions using invariants and state equation in 2065 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11650 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s100 1) (GEQ s295 1)), p1:(AND (GEQ s88 1) (GEQ s287 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 140 steps with 0 reset in 7 ms.
FORMULA Szymanski-PT-b02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b02-LTLFireability-01 finished in 11964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 272 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 17:25:37] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:25:37] [INFO ] Invariant cache hit.
[2023-03-19 17:25:37] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-19 17:25:37] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:25:37] [INFO ] Invariant cache hit.
[2023-03-19 17:25:38] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:25:44] [INFO ] Implicit Places using invariants and state equation in 7000 ms returned []
Implicit Place search using SMT with State Equation took 7421 ms to find 0 implicit places.
[2023-03-19 17:25:45] [INFO ] Redundant transitions in 697 ms returned []
[2023-03-19 17:25:45] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:25:45] [INFO ] Invariant cache hit.
[2023-03-19 17:25:47] [INFO ] Dead Transitions using invariants and state equation in 2058 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10463 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (OR (LT s27 1) (LT s295 1)) (OR (LT s47 1) (LT s290 1))), p0:(AND (GEQ s29 1) (GEQ s261 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 584 ms.
Product exploration explored 100000 steps with 0 reset in 561 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 131086 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131086 steps, saw 46489 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 17:25:52] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:25:52] [INFO ] Invariant cache hit.
[2023-03-19 17:25:52] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:25:52] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:25:52] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:25:58] [INFO ] After 6041ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:25:58] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:26:16] [INFO ] After 18101ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-19 17:26:16] [INFO ] After 24272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 32 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 0 with 123 rules applied. Total rules applied 123 place count 305 transition count 7813
Applied a total of 123 rules in 214 ms. Remains 305 /305 variables (removed 0) and now considering 7813/7936 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 305/305 places, 7813/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) 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
Interrupted probabilistic random walk after 137999 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137999 steps, saw 47651 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 17:26:19] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
// Phase 1: matrix 2609 rows 305 cols
[2023-03-19 17:26:19] [INFO ] Computed 1 place invariants in 17 ms
[2023-03-19 17:26:20] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 17:26:20] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:26:20] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:26:23] [INFO ] After 3558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:26:23] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:26:41] [INFO ] After 18095ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-19 17:26:41] [INFO ] After 21741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7813/7813 transitions.
Applied a total of 0 rules in 193 ms. Remains 305 /305 variables (removed 0) and now considering 7813/7813 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 305/305 places, 7813/7813 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7813/7813 transitions.
Applied a total of 0 rules in 187 ms. Remains 305 /305 variables (removed 0) and now considering 7813/7813 (removed 0) transitions.
[2023-03-19 17:26:42] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
[2023-03-19 17:26:42] [INFO ] Invariant cache hit.
[2023-03-19 17:26:42] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-19 17:26:42] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
[2023-03-19 17:26:42] [INFO ] Invariant cache hit.
[2023-03-19 17:26:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:26:50] [INFO ] Implicit Places using invariants and state equation in 7518 ms returned []
Implicit Place search using SMT with State Equation took 7929 ms to find 0 implicit places.
[2023-03-19 17:26:51] [INFO ] Redundant transitions in 932 ms returned []
[2023-03-19 17:26:51] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
[2023-03-19 17:26:51] [INFO ] Invariant cache hit.
[2023-03-19 17:26:53] [INFO ] Dead Transitions using invariants and state equation in 1940 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11000 ms. Remains : 305/305 places, 7813/7813 transitions.
Graph (trivial) has 4624 edges and 305 vertex of which 36 / 305 are part of one of the 2 SCC in 8 ms
Free SCC test removed 34 places
Drop transitions removed 3880 transitions
Ensure Unique test removed 1562 transitions
Reduce isomorphic transitions removed 5442 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 271 transition count 1955
Applied a total of 417 rules in 210 ms. Remains 271 /305 variables (removed 34) and now considering 1955/7813 (removed 5858) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1955 rows 271 cols
[2023-03-19 17:26:53] [INFO ] Computed 1 place invariants in 17 ms
[2023-03-19 17:26:53] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 32 ms returned sat
[2023-03-19 17:26:53] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:26:53] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:26:54] [INFO ] After 648ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:26:54] [INFO ] State equation strengthened by 504 read => feed constraints.
[2023-03-19 17:26:55] [INFO ] After 1693ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 17:27:06] [INFO ] After 12060ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11243 ms.
[2023-03-19 17:27:17] [INFO ] After 24013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 204 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 207 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 17:27:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 17:27:18] [INFO ] Computed 1 place invariants in 22 ms
[2023-03-19 17:27:18] [INFO ] Implicit Places using invariants in 442 ms returned []
[2023-03-19 17:27:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:27:18] [INFO ] Invariant cache hit.
[2023-03-19 17:27:19] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:27:25] [INFO ] Implicit Places using invariants and state equation in 7179 ms returned []
Implicit Place search using SMT with State Equation took 7633 ms to find 0 implicit places.
[2023-03-19 17:27:26] [INFO ] Redundant transitions in 965 ms returned []
[2023-03-19 17:27:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:27:26] [INFO ] Invariant cache hit.
[2023-03-19 17:27:28] [INFO ] Dead Transitions using invariants and state equation in 1924 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10754 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 119725 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119725 steps, saw 43659 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 17:27:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:27:32] [INFO ] Invariant cache hit.
[2023-03-19 17:27:32] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 17:27:32] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:27:32] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:27:38] [INFO ] After 5928ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:27:38] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:27:56] [INFO ] After 18115ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-19 17:27:56] [INFO ] After 24113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 28 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 0 with 123 rules applied. Total rules applied 123 place count 305 transition count 7813
Applied a total of 123 rules in 196 ms. Remains 305 /305 variables (removed 0) and now considering 7813/7936 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 305/305 places, 7813/7936 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 122807 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122807 steps, saw 43061 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 17:27:59] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
// Phase 1: matrix 2609 rows 305 cols
[2023-03-19 17:27:59] [INFO ] Computed 1 place invariants in 20 ms
[2023-03-19 17:27:59] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:27:59] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:27:59] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 17:28:03] [INFO ] After 3462ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:28:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:28:17] [INFO ] After 14505ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:28:22] [INFO ] Deduced a trap composed of 70 places in 392 ms of which 1 ms to minimize.
[2023-03-19 17:28:22] [INFO ] Deduced a trap composed of 103 places in 335 ms of which 0 ms to minimize.
[2023-03-19 17:28:23] [INFO ] Deduced a trap composed of 103 places in 341 ms of which 2 ms to minimize.
[2023-03-19 17:28:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1508 ms
[2023-03-19 17:28:23] [INFO ] After 20160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1319 ms.
[2023-03-19 17:28:24] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 11 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7813/7813 transitions.
Applied a total of 0 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7813/7813 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 305/305 places, 7813/7813 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7813/7813 transitions.
Applied a total of 0 rules in 192 ms. Remains 305 /305 variables (removed 0) and now considering 7813/7813 (removed 0) transitions.
[2023-03-19 17:28:25] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
[2023-03-19 17:28:25] [INFO ] Invariant cache hit.
[2023-03-19 17:28:25] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-19 17:28:25] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
[2023-03-19 17:28:25] [INFO ] Invariant cache hit.
[2023-03-19 17:28:26] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:28:32] [INFO ] Implicit Places using invariants and state equation in 6970 ms returned []
Implicit Place search using SMT with State Equation took 7383 ms to find 0 implicit places.
[2023-03-19 17:28:33] [INFO ] Redundant transitions in 944 ms returned []
[2023-03-19 17:28:33] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
[2023-03-19 17:28:33] [INFO ] Invariant cache hit.
[2023-03-19 17:28:35] [INFO ] Dead Transitions using invariants and state equation in 1925 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10459 ms. Remains : 305/305 places, 7813/7813 transitions.
Graph (trivial) has 4624 edges and 305 vertex of which 36 / 305 are part of one of the 2 SCC in 0 ms
Free SCC test removed 34 places
Drop transitions removed 3880 transitions
Ensure Unique test removed 1562 transitions
Reduce isomorphic transitions removed 5442 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 271 transition count 1955
Applied a total of 417 rules in 127 ms. Remains 271 /305 variables (removed 34) and now considering 1955/7813 (removed 5858) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1955 rows 271 cols
[2023-03-19 17:28:35] [INFO ] Computed 1 place invariants in 17 ms
[2023-03-19 17:28:35] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:28:35] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:28:35] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:28:36] [INFO ] After 656ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:28:36] [INFO ] State equation strengthened by 504 read => feed constraints.
[2023-03-19 17:28:38] [INFO ] After 1738ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 17:28:48] [INFO ] After 12274ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16385 ms.
[2023-03-19 17:29:05] [INFO ] After 29386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 181 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 501 ms.
Product exploration explored 100000 steps with 0 reset in 499 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 189 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 17:29:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 17:29:06] [INFO ] Computed 1 place invariants in 23 ms
[2023-03-19 17:29:07] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-03-19 17:29:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:29:07] [INFO ] Invariant cache hit.
[2023-03-19 17:29:07] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:29:12] [INFO ] Implicit Places using invariants and state equation in 5747 ms returned []
Implicit Place search using SMT with State Equation took 6180 ms to find 0 implicit places.
[2023-03-19 17:29:13] [INFO ] Redundant transitions in 868 ms returned []
[2023-03-19 17:29:13] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:29:13] [INFO ] Invariant cache hit.
[2023-03-19 17:29:15] [INFO ] Dead Transitions using invariants and state equation in 1949 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9205 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b02-LTLFireability-02 finished in 218932 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((X(p1)&&p0)))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 51 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 17:29:16] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:29:16] [INFO ] Invariant cache hit.
[2023-03-19 17:29:16] [INFO ] Implicit Places using invariants in 549 ms returned []
[2023-03-19 17:29:16] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:29:16] [INFO ] Invariant cache hit.
[2023-03-19 17:29:17] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:29:23] [INFO ] Implicit Places using invariants and state equation in 7100 ms returned []
Implicit Place search using SMT with State Equation took 7651 ms to find 0 implicit places.
[2023-03-19 17:29:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:29:23] [INFO ] Invariant cache hit.
[2023-03-19 17:29:25] [INFO ] Dead Transitions using invariants and state equation in 1937 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9641 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s39 1) (GEQ s270 1)), p1:(OR (LT s25 1) (LT s302 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 471 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 0 ms.
FORMULA Szymanski-PT-b02-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Szymanski-PT-b02-LTLFireability-03 finished in 10215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 52 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 17:29:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:29:26] [INFO ] Invariant cache hit.
[2023-03-19 17:29:26] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-19 17:29:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:29:26] [INFO ] Invariant cache hit.
[2023-03-19 17:29:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:29:34] [INFO ] Implicit Places using invariants and state equation in 7776 ms returned []
Implicit Place search using SMT with State Equation took 8196 ms to find 0 implicit places.
[2023-03-19 17:29:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:29:34] [INFO ] Invariant cache hit.
[2023-03-19 17:29:36] [INFO ] Dead Transitions using invariants and state equation in 1915 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10165 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s58 1) (GEQ s274 1)), p0:(OR (LT s16 1) (LT s275 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 431 ms.
Product exploration explored 100000 steps with 0 reset in 523 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 316 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) 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 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 121198 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121198 steps, saw 44053 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 17:29:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:29:41] [INFO ] Invariant cache hit.
[2023-03-19 17:29:41] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 17:29:42] [INFO ] After 1614ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-19 17:29:42] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 17:29:49] [INFO ] After 6273ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-19 17:29:49] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:30:07] [INFO ] After 18648ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2023-03-19 17:30:07] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 305 transition count 7811
Applied a total of 125 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7936 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 305/305 places, 7811/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 133527 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133527 steps, saw 46345 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-19 17:30:11] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2023-03-19 17:30:11] [INFO ] Computed 1 place invariants in 18 ms
[2023-03-19 17:30:11] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 17:30:12] [INFO ] After 1735ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:30:13] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 17:30:16] [INFO ] After 3448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:30:16] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:30:38] [INFO ] After 21489ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:30:38] [INFO ] After 21495ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-19 17:30:38] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7811 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 305/305 places, 7811/7811 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7811 (removed 0) transitions.
[2023-03-19 17:30:38] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
[2023-03-19 17:30:38] [INFO ] Invariant cache hit.
[2023-03-19 17:30:38] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-19 17:30:38] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
[2023-03-19 17:30:38] [INFO ] Invariant cache hit.
[2023-03-19 17:30:39] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:30:46] [INFO ] Implicit Places using invariants and state equation in 7593 ms returned []
Implicit Place search using SMT with State Equation took 8020 ms to find 0 implicit places.
[2023-03-19 17:30:47] [INFO ] Redundant transitions in 926 ms returned []
[2023-03-19 17:30:47] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
[2023-03-19 17:30:47] [INFO ] Invariant cache hit.
[2023-03-19 17:30:49] [INFO ] Dead Transitions using invariants and state equation in 1902 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11043 ms. Remains : 305/305 places, 7811/7811 transitions.
Graph (trivial) has 4872 edges and 305 vertex of which 35 / 305 are part of one of the 2 SCC in 0 ms
Free SCC test removed 33 places
Drop transitions removed 3744 transitions
Ensure Unique test removed 1697 transitions
Reduce isomorphic transitions removed 5441 transitions.
Drop transitions removed 320 transitions
Redundant transition composition rules discarded 320 transitions
Iterating global reduction 0 with 320 rules applied. Total rules applied 321 place count 272 transition count 2050
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 322 place count 272 transition count 2049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 323 place count 271 transition count 2049
Drop transitions removed 112 transitions
Redundant transition composition rules discarded 112 transitions
Iterating global reduction 1 with 112 rules applied. Total rules applied 435 place count 271 transition count 1937
Applied a total of 435 rules in 223 ms. Remains 271 /305 variables (removed 34) and now considering 1937/7811 (removed 5874) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1937 rows 271 cols
[2023-03-19 17:30:49] [INFO ] Computed 1 place invariants in 16 ms
[2023-03-19 17:30:49] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:30:50] [INFO ] After 665ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:30:50] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:30:50] [INFO ] After 713ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:30:50] [INFO ] State equation strengthened by 480 read => feed constraints.
[2023-03-19 17:30:53] [INFO ] After 2282ms SMT Verify possible using 480 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 17:30:56] [INFO ] After 5777ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5794 ms.
[2023-03-19 17:31:02] [INFO ] After 12357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 390 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 39 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 17:31:03] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 17:31:03] [INFO ] Computed 1 place invariants in 17 ms
[2023-03-19 17:31:03] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-19 17:31:03] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:31:03] [INFO ] Invariant cache hit.
[2023-03-19 17:31:04] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:31:10] [INFO ] Implicit Places using invariants and state equation in 7312 ms returned []
Implicit Place search using SMT with State Equation took 7751 ms to find 0 implicit places.
[2023-03-19 17:31:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:31:10] [INFO ] Invariant cache hit.
[2023-03-19 17:31:12] [INFO ] Dead Transitions using invariants and state equation in 1959 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9751 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 152796 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152796 steps, saw 52181 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 17:31:16] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:31:16] [INFO ] Invariant cache hit.
[2023-03-19 17:31:16] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:31:17] [INFO ] After 1501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:31:17] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:31:20] [INFO ] After 2603ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:31:20] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:31:25] [INFO ] After 5363ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:31:34] [INFO ] After 14386ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-19 17:31:34] [INFO ] After 17050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 305 transition count 7810
Applied a total of 126 rules in 196 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7936 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10001 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 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 156250 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 156250 steps, saw 52932 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 17:31:38] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2023-03-19 17:31:38] [INFO ] Computed 1 place invariants in 19 ms
[2023-03-19 17:31:38] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:31:40] [INFO ] After 2266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:31:40] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:31:41] [INFO ] After 1209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:31:41] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:31:44] [INFO ] After 3127ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:31:46] [INFO ] Deduced a trap composed of 138 places in 347 ms of which 1 ms to minimize.
[2023-03-19 17:31:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 492 ms
[2023-03-19 17:31:46] [INFO ] After 5282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 688 ms.
[2023-03-19 17:31:47] [INFO ] After 7247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 184 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2023-03-19 17:31:47] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 17:31:47] [INFO ] Invariant cache hit.
[2023-03-19 17:31:48] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-19 17:31:48] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 17:31:48] [INFO ] Invariant cache hit.
[2023-03-19 17:31:48] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:31:55] [INFO ] Implicit Places using invariants and state equation in 7555 ms returned []
Implicit Place search using SMT with State Equation took 7977 ms to find 0 implicit places.
[2023-03-19 17:31:56] [INFO ] Redundant transitions in 951 ms returned []
[2023-03-19 17:31:56] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 17:31:56] [INFO ] Invariant cache hit.
[2023-03-19 17:31:58] [INFO ] Dead Transitions using invariants and state equation in 1935 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11052 ms. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 5008 edges and 305 vertex of which 37 / 305 are part of one of the 2 SCC in 1 ms
Free SCC test removed 35 places
Drop transitions removed 4008 transitions
Ensure Unique test removed 1436 transitions
Reduce isomorphic transitions removed 5444 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 270 transition count 1950
Applied a total of 417 rules in 125 ms. Remains 270 /305 variables (removed 35) and now considering 1950/7810 (removed 5860) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1950 rows 270 cols
[2023-03-19 17:31:58] [INFO ] Computed 1 place invariants in 15 ms
[2023-03-19 17:31:59] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:31:59] [INFO ] After 666ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:31:59] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:32:00] [INFO ] After 524ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:32:00] [INFO ] State equation strengthened by 504 read => feed constraints.
[2023-03-19 17:32:00] [INFO ] After 651ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:32:00] [INFO ] After 754ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-19 17:32:01] [INFO ] After 1392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 487 ms.
Product exploration explored 100000 steps with 0 reset in 484 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 224 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 17:32:03] [INFO ] Redundant transitions in 888 ms returned []
[2023-03-19 17:32:03] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 17:32:03] [INFO ] Computed 1 place invariants in 17 ms
[2023-03-19 17:32:05] [INFO ] Dead Transitions using invariants and state equation in 2002 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3124 ms. Remains : 305/305 places, 7936/7936 transitions.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 35 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 17:32:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:32:05] [INFO ] Invariant cache hit.
[2023-03-19 17:32:06] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-19 17:32:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:32:06] [INFO ] Invariant cache hit.
[2023-03-19 17:32:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:32:13] [INFO ] Implicit Places using invariants and state equation in 7127 ms returned []
Implicit Place search using SMT with State Equation took 7549 ms to find 0 implicit places.
[2023-03-19 17:32:13] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:32:13] [INFO ] Invariant cache hit.
[2023-03-19 17:32:15] [INFO ] Dead Transitions using invariants and state equation in 1955 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9540 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b02-LTLFireability-04 finished in 169310 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)||G(F(p1))))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 54 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 17:32:15] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:32:15] [INFO ] Invariant cache hit.
[2023-03-19 17:32:16] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-19 17:32:16] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:32:16] [INFO ] Invariant cache hit.
[2023-03-19 17:32:16] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:32:23] [INFO ] Implicit Places using invariants and state equation in 7003 ms returned []
Implicit Place search using SMT with State Equation took 7431 ms to find 0 implicit places.
[2023-03-19 17:32:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:32:23] [INFO ] Invariant cache hit.
[2023-03-19 17:32:25] [INFO ] Dead Transitions using invariants and state equation in 2024 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9510 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s58 1) (GEQ s300 1)), p1:(AND (GEQ s120 1) (GEQ s256 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 406 ms.
Stack based approach found an accepted trace after 58 steps with 0 reset with depth 59 and stack size 59 in 1 ms.
FORMULA Szymanski-PT-b02-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Szymanski-PT-b02-LTLFireability-05 finished in 10137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 224 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 17:32:25] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:32:25] [INFO ] Invariant cache hit.
[2023-03-19 17:32:26] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-19 17:32:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:32:26] [INFO ] Invariant cache hit.
[2023-03-19 17:32:26] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:32:34] [INFO ] Implicit Places using invariants and state equation in 8489 ms returned []
Implicit Place search using SMT with State Equation took 8906 ms to find 0 implicit places.
[2023-03-19 17:32:35] [INFO ] Redundant transitions in 879 ms returned []
[2023-03-19 17:32:35] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:32:35] [INFO ] Invariant cache hit.
[2023-03-19 17:32:37] [INFO ] Dead Transitions using invariants and state equation in 1919 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11934 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s87 1) (LT s274 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 421 ms.
Product exploration explored 100000 steps with 0 reset in 451 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 3443 steps, including 1 resets, run visited all 1 properties in 11 ms. (steps per millisecond=313 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 196 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 17:32:39] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:32:39] [INFO ] Invariant cache hit.
[2023-03-19 17:32:39] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-19 17:32:39] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:32:39] [INFO ] Invariant cache hit.
[2023-03-19 17:32:40] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:32:47] [INFO ] Implicit Places using invariants and state equation in 8301 ms returned []
Implicit Place search using SMT with State Equation took 8741 ms to find 0 implicit places.
[2023-03-19 17:32:48] [INFO ] Redundant transitions in 917 ms returned []
[2023-03-19 17:32:48] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:32:48] [INFO ] Invariant cache hit.
[2023-03-19 17:32:50] [INFO ] Dead Transitions using invariants and state equation in 1954 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11812 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Finished Best-First random walk after 3684 steps, including 1 resets, run visited all 1 properties in 7 ms. (steps per millisecond=526 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 438 ms.
Product exploration explored 100000 steps with 0 reset in 468 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 192 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 17:32:52] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:32:52] [INFO ] Invariant cache hit.
[2023-03-19 17:32:52] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-03-19 17:32:52] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:32:52] [INFO ] Invariant cache hit.
[2023-03-19 17:32:53] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:32:59] [INFO ] Implicit Places using invariants and state equation in 6650 ms returned []
Implicit Place search using SMT with State Equation took 7081 ms to find 0 implicit places.
[2023-03-19 17:33:00] [INFO ] Redundant transitions in 858 ms returned []
[2023-03-19 17:33:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:33:00] [INFO ] Invariant cache hit.
[2023-03-19 17:33:02] [INFO ] Dead Transitions using invariants and state equation in 1995 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10137 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b02-LTLFireability-06 finished in 36938 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((F(p0)&&(p1||X(p2))))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 33 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2023-03-19 17:33:02] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2023-03-19 17:33:02] [INFO ] Computed 1 place invariants in 21 ms
[2023-03-19 17:33:03] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-19 17:33:03] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 17:33:03] [INFO ] Invariant cache hit.
[2023-03-19 17:33:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:33:08] [INFO ] Implicit Places using invariants and state equation in 5413 ms returned []
Implicit Place search using SMT with State Equation took 5855 ms to find 0 implicit places.
[2023-03-19 17:33:08] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 17:33:08] [INFO ] Invariant cache hit.
[2023-03-19 17:33:10] [INFO ] Dead Transitions using invariants and state equation in 1978 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7868 ms. Remains : 306/306 places, 8064/8064 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), true]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s305 1)), p1:(AND (GEQ s101 1) (GEQ s259 1)), p2:(AND (GEQ s15 1) (GEQ s302 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b02-LTLFireability-07 finished in 8064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1)&&F(p2))))'
Support contains 5 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 48 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 17:33:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 17:33:10] [INFO ] Computed 1 place invariants in 21 ms
[2023-03-19 17:33:11] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-19 17:33:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:33:11] [INFO ] Invariant cache hit.
[2023-03-19 17:33:11] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:33:18] [INFO ] Implicit Places using invariants and state equation in 7004 ms returned []
Implicit Place search using SMT with State Equation took 7445 ms to find 0 implicit places.
[2023-03-19 17:33:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:33:18] [INFO ] Invariant cache hit.
[2023-03-19 17:33:20] [INFO ] Dead Transitions using invariants and state equation in 1951 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9446 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 311 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0} source=5 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=5 dest: 2}, { cond=(NOT p1), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(AND (GEQ s84 1) (GEQ s287 1)), p2:(AND (GEQ s101 1) (GEQ s267 1)), p0:(AND (GEQ s60 1) (GEQ s267 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b02-LTLFireability-08 finished in 9783 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 U p1))||X((!(p2 U p3)||F(!p2)))))'
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 51 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 17:33:20] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:33:20] [INFO ] Invariant cache hit.
[2023-03-19 17:33:20] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-19 17:33:20] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:33:20] [INFO ] Invariant cache hit.
[2023-03-19 17:33:21] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:33:28] [INFO ] Implicit Places using invariants and state equation in 7090 ms returned []
Implicit Place search using SMT with State Equation took 7503 ms to find 0 implicit places.
[2023-03-19 17:33:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:33:28] [INFO ] Invariant cache hit.
[2023-03-19 17:33:29] [INFO ] Dead Transitions using invariants and state equation in 1935 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9490 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 202 ms :[p2, (AND p1 p2 p3), (AND p2 p3), (AND p1 p2 p3), (AND p1 p2)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p3), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 p2 p3), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (GEQ s17 1) (GEQ s257 1)), p3:(AND (GEQ s111 1) (GEQ s303 1)), p1:(AND (GEQ s114 1) (GEQ s276 1)), p0:(AND (GEQ s3 1) (GEQ s261 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 738 ms.
Product exploration explored 100000 steps with 50000 reset in 709 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND p1 p2 p3))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p1 p2 p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p2)))
Knowledge based reduction with 14 factoid took 281 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Szymanski-PT-b02-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-b02-LTLFireability-09 finished in 11462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 52 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 17:33:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:33:31] [INFO ] Invariant cache hit.
[2023-03-19 17:33:32] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-19 17:33:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:33:32] [INFO ] Invariant cache hit.
[2023-03-19 17:33:32] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:33:39] [INFO ] Implicit Places using invariants and state equation in 7532 ms returned []
Implicit Place search using SMT with State Equation took 7961 ms to find 0 implicit places.
[2023-03-19 17:33:39] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:33:39] [INFO ] Invariant cache hit.
[2023-03-19 17:33:41] [INFO ] Dead Transitions using invariants and state equation in 1938 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9953 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s93 1) (GEQ s297 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b02-LTLFireability-10 finished in 10054 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)&&!p0) U X(p0)))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 49 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 17:33:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:33:42] [INFO ] Invariant cache hit.
[2023-03-19 17:33:42] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-19 17:33:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:33:42] [INFO ] Invariant cache hit.
[2023-03-19 17:33:42] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:33:49] [INFO ] Implicit Places using invariants and state equation in 7155 ms returned []
Implicit Place search using SMT with State Equation took 7572 ms to find 0 implicit places.
[2023-03-19 17:33:49] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:33:49] [INFO ] Invariant cache hit.
[2023-03-19 17:33:51] [INFO ] Dead Transitions using invariants and state equation in 1954 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9576 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 79 ms :[p0, p0, true]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s118 1) (GEQ s280 1)), p1:(AND (GEQ s22 1) (GEQ s296 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 607 ms.
Product exploration explored 100000 steps with 50000 reset in 629 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 6 factoid took 132 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Szymanski-PT-b02-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-b02-LTLFireability-11 finished in 11064 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))))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 54 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 17:33:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:33:53] [INFO ] Invariant cache hit.
[2023-03-19 17:33:53] [INFO ] Implicit Places using invariants in 442 ms returned []
[2023-03-19 17:33:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:33:53] [INFO ] Invariant cache hit.
[2023-03-19 17:33:54] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:34:01] [INFO ] Implicit Places using invariants and state equation in 7811 ms returned []
Implicit Place search using SMT with State Equation took 8266 ms to find 0 implicit places.
[2023-03-19 17:34:01] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:34:01] [INFO ] Invariant cache hit.
[2023-03-19 17:34:03] [INFO ] Dead Transitions using invariants and state equation in 1921 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10243 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s52 1) (LT s270 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 412 ms.
Product exploration explored 100000 steps with 0 reset in 406 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16727 steps, run visited all 1 properties in 328 ms. (steps per millisecond=50 )
Probabilistic random walk after 16727 steps, saw 6455 distinct states, run finished after 329 ms. (steps per millisecond=50 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 27 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 17:34:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:34:05] [INFO ] Invariant cache hit.
[2023-03-19 17:34:05] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-19 17:34:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:34:05] [INFO ] Invariant cache hit.
[2023-03-19 17:34:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:34:12] [INFO ] Implicit Places using invariants and state equation in 6396 ms returned []
Implicit Place search using SMT with State Equation took 6824 ms to find 0 implicit places.
[2023-03-19 17:34:12] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:34:12] [INFO ] Invariant cache hit.
[2023-03-19 17:34:14] [INFO ] Dead Transitions using invariants and state equation in 1961 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8813 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Finished Best-First random walk after 6897 steps, including 2 resets, run visited all 1 properties in 11 ms. (steps per millisecond=627 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 407 ms.
Product exploration explored 100000 steps with 0 reset in 410 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 177 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 17:34:16] [INFO ] Redundant transitions in 792 ms returned []
[2023-03-19 17:34:16] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:34:16] [INFO ] Invariant cache hit.
[2023-03-19 17:34:18] [INFO ] Dead Transitions using invariants and state equation in 1941 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2920 ms. Remains : 305/305 places, 7936/7936 transitions.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 27 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 17:34:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:34:18] [INFO ] Invariant cache hit.
[2023-03-19 17:34:19] [INFO ] Implicit Places using invariants in 433 ms returned []
[2023-03-19 17:34:19] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:34:19] [INFO ] Invariant cache hit.
[2023-03-19 17:34:19] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:34:26] [INFO ] Implicit Places using invariants and state equation in 6833 ms returned []
Implicit Place search using SMT with State Equation took 7270 ms to find 0 implicit places.
[2023-03-19 17:34:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:34:26] [INFO ] Invariant cache hit.
[2023-03-19 17:34:27] [INFO ] Dead Transitions using invariants and state equation in 1919 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9216 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b02-LTLFireability-14 finished in 35100 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 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 204 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 17:34:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:34:28] [INFO ] Invariant cache hit.
[2023-03-19 17:34:28] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-19 17:34:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:34:28] [INFO ] Invariant cache hit.
[2023-03-19 17:34:29] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:34:36] [INFO ] Implicit Places using invariants and state equation in 7259 ms returned []
Implicit Place search using SMT with State Equation took 7687 ms to find 0 implicit places.
[2023-03-19 17:34:36] [INFO ] Redundant transitions in 864 ms returned []
[2023-03-19 17:34:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:34:36] [INFO ] Invariant cache hit.
[2023-03-19 17:34:38] [INFO ] Dead Transitions using invariants and state equation in 2006 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10769 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-15 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:(OR (LT s50 1) (LT s298 1)), p1:(AND (GEQ s43 1) (GEQ s294 1))], 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 0 reset in 451 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 1 ms.
FORMULA Szymanski-PT-b02-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Szymanski-PT-b02-LTLFireability-15 finished in 11345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Found a Lengthening insensitive property : Szymanski-PT-b02-LTLFireability-04
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 79 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 17:34:39] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:34:39] [INFO ] Invariant cache hit.
[2023-03-19 17:34:40] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-19 17:34:40] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:34:40] [INFO ] Invariant cache hit.
[2023-03-19 17:34:40] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:34:47] [INFO ] Implicit Places using invariants and state equation in 6913 ms returned []
Implicit Place search using SMT with State Equation took 7330 ms to find 0 implicit places.
[2023-03-19 17:34:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:34:47] [INFO ] Invariant cache hit.
[2023-03-19 17:34:49] [INFO ] Dead Transitions using invariants and state equation in 1929 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9341 ms. Remains : 305/306 places, 7936/8064 transitions.
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s58 1) (GEQ s274 1)), p0:(OR (LT s16 1) (LT s275 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 419 ms.
Product exploration explored 100000 steps with 0 reset in 420 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 291 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 120962 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 120962 steps, saw 44026 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 17:34:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:34:53] [INFO ] Invariant cache hit.
[2023-03-19 17:34:53] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 17:34:55] [INFO ] After 1594ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-19 17:34:55] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 17:35:01] [INFO ] After 6010ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-19 17:35:01] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:35:20] [INFO ] After 18914ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2023-03-19 17:35:20] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 305 transition count 7811
Applied a total of 125 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7936 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 305/305 places, 7811/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 128795 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128795 steps, saw 45120 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-19 17:35:23] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2023-03-19 17:35:23] [INFO ] Computed 1 place invariants in 16 ms
[2023-03-19 17:35:23] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 17:35:25] [INFO ] After 1648ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:35:25] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:35:28] [INFO ] After 3264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:35:28] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:35:47] [INFO ] After 19169ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 17:35:50] [INFO ] After 21668ms 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-19 17:35:50] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Applied a total of 0 rules in 179 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7811 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 305/305 places, 7811/7811 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Applied a total of 0 rules in 178 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7811 (removed 0) transitions.
[2023-03-19 17:35:50] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
[2023-03-19 17:35:50] [INFO ] Invariant cache hit.
[2023-03-19 17:35:51] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-19 17:35:51] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
[2023-03-19 17:35:51] [INFO ] Invariant cache hit.
[2023-03-19 17:35:51] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:35:58] [INFO ] Implicit Places using invariants and state equation in 7207 ms returned []
Implicit Place search using SMT with State Equation took 7619 ms to find 0 implicit places.
[2023-03-19 17:35:59] [INFO ] Redundant transitions in 860 ms returned []
[2023-03-19 17:35:59] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
[2023-03-19 17:35:59] [INFO ] Invariant cache hit.
[2023-03-19 17:36:01] [INFO ] Dead Transitions using invariants and state equation in 1887 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10551 ms. Remains : 305/305 places, 7811/7811 transitions.
Graph (trivial) has 4872 edges and 305 vertex of which 35 / 305 are part of one of the 2 SCC in 0 ms
Free SCC test removed 33 places
Drop transitions removed 3744 transitions
Ensure Unique test removed 1697 transitions
Reduce isomorphic transitions removed 5441 transitions.
Drop transitions removed 320 transitions
Redundant transition composition rules discarded 320 transitions
Iterating global reduction 0 with 320 rules applied. Total rules applied 321 place count 272 transition count 2050
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 322 place count 272 transition count 2049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 323 place count 271 transition count 2049
Drop transitions removed 112 transitions
Redundant transition composition rules discarded 112 transitions
Iterating global reduction 1 with 112 rules applied. Total rules applied 435 place count 271 transition count 1937
Applied a total of 435 rules in 224 ms. Remains 271 /305 variables (removed 34) and now considering 1937/7811 (removed 5874) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1937 rows 271 cols
[2023-03-19 17:36:01] [INFO ] Computed 1 place invariants in 16 ms
[2023-03-19 17:36:01] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:36:02] [INFO ] After 643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:36:02] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:36:02] [INFO ] After 736ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:36:02] [INFO ] State equation strengthened by 480 read => feed constraints.
[2023-03-19 17:36:05] [INFO ] After 2357ms SMT Verify possible using 480 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 17:36:08] [INFO ] After 5915ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5566 ms.
[2023-03-19 17:36:14] [INFO ] After 12295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 340 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 29 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 17:36:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 17:36:14] [INFO ] Computed 1 place invariants in 21 ms
[2023-03-19 17:36:15] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-19 17:36:15] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:36:15] [INFO ] Invariant cache hit.
[2023-03-19 17:36:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:36:22] [INFO ] Implicit Places using invariants and state equation in 6833 ms returned []
Implicit Place search using SMT with State Equation took 7260 ms to find 0 implicit places.
[2023-03-19 17:36:22] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:36:22] [INFO ] Invariant cache hit.
[2023-03-19 17:36:24] [INFO ] Dead Transitions using invariants and state equation in 1970 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9261 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 156841 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 156841 steps, saw 53433 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 17:36:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:36:27] [INFO ] Invariant cache hit.
[2023-03-19 17:36:27] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 17:36:28] [INFO ] After 1444ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:36:28] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:36:31] [INFO ] After 2429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:36:31] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:36:36] [INFO ] After 5225ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:36:45] [INFO ] After 14247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-19 17:36:45] [INFO ] After 16738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 305 transition count 7810
Applied a total of 126 rules in 209 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7936 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10001 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 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 157004 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 157004 steps, saw 53121 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 17:36:48] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2023-03-19 17:36:48] [INFO ] Computed 1 place invariants in 15 ms
[2023-03-19 17:36:48] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 17:36:51] [INFO ] After 2280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:36:51] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:36:52] [INFO ] After 1206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:36:52] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:36:55] [INFO ] After 3156ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:36:57] [INFO ] Deduced a trap composed of 138 places in 346 ms of which 0 ms to minimize.
[2023-03-19 17:36:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 476 ms
[2023-03-19 17:36:57] [INFO ] After 5289ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 687 ms.
[2023-03-19 17:36:58] [INFO ] After 7244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 183 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 182 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2023-03-19 17:36:58] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 17:36:58] [INFO ] Invariant cache hit.
[2023-03-19 17:36:59] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-19 17:36:59] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 17:36:59] [INFO ] Invariant cache hit.
[2023-03-19 17:36:59] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:37:06] [INFO ] Implicit Places using invariants and state equation in 7086 ms returned []
Implicit Place search using SMT with State Equation took 7496 ms to find 0 implicit places.
[2023-03-19 17:37:07] [INFO ] Redundant transitions in 867 ms returned []
[2023-03-19 17:37:07] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 17:37:07] [INFO ] Invariant cache hit.
[2023-03-19 17:37:09] [INFO ] Dead Transitions using invariants and state equation in 1947 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10503 ms. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 5008 edges and 305 vertex of which 37 / 305 are part of one of the 2 SCC in 1 ms
Free SCC test removed 35 places
Drop transitions removed 4008 transitions
Ensure Unique test removed 1436 transitions
Reduce isomorphic transitions removed 5444 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 270 transition count 1950
Applied a total of 417 rules in 128 ms. Remains 270 /305 variables (removed 35) and now considering 1950/7810 (removed 5860) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1950 rows 270 cols
[2023-03-19 17:37:09] [INFO ] Computed 1 place invariants in 21 ms
[2023-03-19 17:37:09] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 17:37:09] [INFO ] After 670ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:37:09] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 17:37:10] [INFO ] After 547ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:37:10] [INFO ] State equation strengthened by 504 read => feed constraints.
[2023-03-19 17:37:11] [INFO ] After 645ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:37:11] [INFO ] After 749ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-19 17:37:11] [INFO ] After 1400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 429 ms.
Product exploration explored 100000 steps with 0 reset in 421 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 183 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 17:37:13] [INFO ] Redundant transitions in 793 ms returned []
[2023-03-19 17:37:13] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 17:37:13] [INFO ] Computed 1 place invariants in 21 ms
[2023-03-19 17:37:15] [INFO ] Dead Transitions using invariants and state equation in 1968 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2949 ms. Remains : 305/305 places, 7936/7936 transitions.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 28 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 17:37:15] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:37:15] [INFO ] Invariant cache hit.
[2023-03-19 17:37:16] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-03-19 17:37:16] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:37:16] [INFO ] Invariant cache hit.
[2023-03-19 17:37:16] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:37:23] [INFO ] Implicit Places using invariants and state equation in 6818 ms returned []
Implicit Place search using SMT with State Equation took 7249 ms to find 0 implicit places.
[2023-03-19 17:37:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:37:23] [INFO ] Invariant cache hit.
[2023-03-19 17:37:24] [INFO ] Dead Transitions using invariants and state equation in 1927 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9206 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b02-LTLFireability-04 finished in 165593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : Szymanski-PT-b02-LTLFireability-14
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 75 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 17:37:25] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:37:25] [INFO ] Invariant cache hit.
[2023-03-19 17:37:25] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-03-19 17:37:25] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:37:25] [INFO ] Invariant cache hit.
[2023-03-19 17:37:26] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:37:33] [INFO ] Implicit Places using invariants and state equation in 7069 ms returned []
Implicit Place search using SMT with State Equation took 7509 ms to find 0 implicit places.
[2023-03-19 17:37:33] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:37:33] [INFO ] Invariant cache hit.
[2023-03-19 17:37:34] [INFO ] Dead Transitions using invariants and state equation in 1918 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9504 ms. Remains : 305/306 places, 7936/8064 transitions.
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s52 1) (LT s270 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 405 ms.
Product exploration explored 100000 steps with 0 reset in 411 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
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 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16727 steps, run visited all 1 properties in 340 ms. (steps per millisecond=49 )
Probabilistic random walk after 16727 steps, saw 6455 distinct states, run finished after 340 ms. (steps per millisecond=49 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 30 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 17:37:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:37:36] [INFO ] Invariant cache hit.
[2023-03-19 17:37:37] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-19 17:37:37] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:37:37] [INFO ] Invariant cache hit.
[2023-03-19 17:37:37] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:37:45] [INFO ] Implicit Places using invariants and state equation in 8218 ms returned []
Implicit Place search using SMT with State Equation took 8643 ms to find 0 implicit places.
[2023-03-19 17:37:45] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:37:45] [INFO ] Invariant cache hit.
[2023-03-19 17:37:47] [INFO ] Dead Transitions using invariants and state equation in 1976 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10650 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10001 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 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16727 steps, run visited all 1 properties in 351 ms. (steps per millisecond=47 )
Probabilistic random walk after 16727 steps, saw 6455 distinct states, run finished after 351 ms. (steps per millisecond=47 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 415 ms.
Product exploration explored 100000 steps with 0 reset in 420 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 183 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 17:37:50] [INFO ] Redundant transitions in 794 ms returned []
[2023-03-19 17:37:50] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:37:50] [INFO ] Invariant cache hit.
[2023-03-19 17:37:52] [INFO ] Dead Transitions using invariants and state equation in 1969 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2958 ms. Remains : 305/305 places, 7936/7936 transitions.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 27 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 17:37:52] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:37:52] [INFO ] Invariant cache hit.
[2023-03-19 17:37:53] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-19 17:37:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:37:53] [INFO ] Invariant cache hit.
[2023-03-19 17:37:53] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 17:38:00] [INFO ] Implicit Places using invariants and state equation in 7254 ms returned []
Implicit Place search using SMT with State Equation took 7681 ms to find 0 implicit places.
[2023-03-19 17:38:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 17:38:00] [INFO ] Invariant cache hit.
[2023-03-19 17:38:02] [INFO ] Dead Transitions using invariants and state equation in 1964 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9672 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b02-LTLFireability-14 finished in 37211 ms.
[2023-03-19 17:38:02] [INFO ] Flatten gal took : 264 ms
[2023-03-19 17:38:02] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 17:38:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 306 places, 8064 transitions and 32128 arcs took 48 ms.
Total runtime 896363 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2123/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2123/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2123/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2123/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Szymanski-PT-b02-LTLFireability-02
Could not compute solution for formula : Szymanski-PT-b02-LTLFireability-04
Could not compute solution for formula : Szymanski-PT-b02-LTLFireability-06
Could not compute solution for formula : Szymanski-PT-b02-LTLFireability-14
BK_STOP 1679247491469
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Szymanski-PT-b02-LTLFireability-02
ltl formula formula --ltl=/tmp/2123/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 8064 transitions and 32128 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.410 real 0.290 user 0.330 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2123/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2123/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2123/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2123/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name Szymanski-PT-b02-LTLFireability-04
ltl formula formula --ltl=/tmp/2123/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 8064 transitions and 32128 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2123/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2123/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.520 real 0.250 user 0.280 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2123/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2123/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name Szymanski-PT-b02-LTLFireability-06
ltl formula formula --ltl=/tmp/2123/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 8064 transitions and 32128 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2123/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2123/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.490 real 0.260 user 0.300 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2123/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2123/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name Szymanski-PT-b02-LTLFireability-14
ltl formula formula --ltl=/tmp/2123/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 8064 transitions and 32128 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.540 real 0.250 user 0.360 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2123/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2123/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2123/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2123/ltl_3_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
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="Szymanski-PT-b02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Szymanski-PT-b02, 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 r489-tall-167912706800452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b02.tgz
mv Szymanski-PT-b02 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 ;