About the Execution of LoLa+red for Peterson-PT-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1084.955 | 1050054.00 | 1179346.00 | 3056.50 | FFFTTFFFFFF?FF?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r263-smll-167863538500644.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Peterson-PT-7, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538500644
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.9M
-rw-r--r-- 1 mcc users 323K Feb 25 22:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Feb 25 22:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 139K Feb 25 22:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 629K Feb 25 22:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 141K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 411K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 318K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 197K Feb 25 23:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 794K Feb 25 23:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 608K Feb 25 23:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.7M Feb 25 23:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-7-LTLFireability-00
FORMULA_NAME Peterson-PT-7-LTLFireability-01
FORMULA_NAME Peterson-PT-7-LTLFireability-02
FORMULA_NAME Peterson-PT-7-LTLFireability-03
FORMULA_NAME Peterson-PT-7-LTLFireability-04
FORMULA_NAME Peterson-PT-7-LTLFireability-05
FORMULA_NAME Peterson-PT-7-LTLFireability-06
FORMULA_NAME Peterson-PT-7-LTLFireability-07
FORMULA_NAME Peterson-PT-7-LTLFireability-08
FORMULA_NAME Peterson-PT-7-LTLFireability-09
FORMULA_NAME Peterson-PT-7-LTLFireability-10
FORMULA_NAME Peterson-PT-7-LTLFireability-11
FORMULA_NAME Peterson-PT-7-LTLFireability-12
FORMULA_NAME Peterson-PT-7-LTLFireability-13
FORMULA_NAME Peterson-PT-7-LTLFireability-14
FORMULA_NAME Peterson-PT-7-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678877610581
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-7
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 10:53:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 10:53:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 10:53:34] [INFO ] Load time of PNML (sax parser for PT used): 314 ms
[2023-03-15 10:53:34] [INFO ] Transformed 1992 places.
[2023-03-15 10:53:34] [INFO ] Transformed 3096 transitions.
[2023-03-15 10:53:34] [INFO ] Found NUPN structural information;
[2023-03-15 10:53:34] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_2_0_5, IsEndLoop_0_3_6, IsEndLoop_0_2_7, EndTurn_4_2, EndTurn_4_1, EndTurn_7_0, EndTurn_6_0, EndTurn_5_0, IsEndLoop_7_6_7, IsEndLoop_6_6_7, IsEndLoop_5_6_7, BeginLoop_1_4_2, BeginLoop_0_4_2, BeginLoop_3_0_4, BeginLoop_3_6_3, BeginLoop_0_6_5, BeginLoop_3_6_5, BeginLoop_4_2_7, BeginLoop_7_1_7, BeginLoop_5_1_7, BeginLoop_6_1_7, BeginLoop_4_1_7, BeginLoop_7_0_7, BeginLoop_6_0_7, BeginLoop_5_0_7, TestAlone_2_4_0, TestAlone_2_5_0, TestAlone_3_6_1, TestAlone_3_0_2, TestAlone_1_5_5, TestAlone_0_5_5, TestAlone_3_5_6, TestAlone_2_5_6, TestIdentity_4_2_1, TestIdentity_4_3_1, TestIdentity_7_2_1, TestIdentity_5_2_1, TestIdentity_6_2_1, TestIdentity_7_6_0, TestIdentity_6_6_0, TestIdentity_5_6_0, TestIdentity_0_2_3, TestIdentity_1_2_3, TestIdentity_1_1_6, TestIdentity_0_2_6, TestIdentity_2_4_4, TestIdentity_1_4_4, TestIdentity_4_5_7, TestIdentity_6_4_7, TestIdentity_5_4_7, TestIdentity_7_4_7, TestIdentity_4_4_7, TestIdentity_6_3_7, TestIdentity_5_3_7, TestIdentity_7_3_7, CS_0, CS_2, AskForSection_2_5, AskForSection_0_5]
[2023-03-15 10:53:34] [INFO ] Parsed PT model containing 1992 places and 3096 transitions and 9584 arcs in 466 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 46 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Peterson-PT-7-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1155 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 148 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-15 10:53:34] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-15 10:53:34] [INFO ] Computed 31 place invariants in 67 ms
[2023-03-15 10:53:36] [INFO ] Implicit Places using invariants in 1360 ms returned []
[2023-03-15 10:53:36] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:53:36] [INFO ] Invariant cache hit.
[2023-03-15 10:53:36] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 2315 ms to find 0 implicit places.
[2023-03-15 10:53:36] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:53:36] [INFO ] Invariant cache hit.
[2023-03-15 10:53:39] [INFO ] Dead Transitions using invariants and state equation in 2973 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5443 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Support contains 1155 out of 1992 places after structural reductions.
[2023-03-15 10:53:40] [INFO ] Flatten gal took : 343 ms
[2023-03-15 10:53:40] [INFO ] Flatten gal took : 201 ms
[2023-03-15 10:53:41] [INFO ] Input system was already deterministic with 3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 747 ms. (steps per millisecond=13 ) properties (out of 27) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-15 10:53:42] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:53:42] [INFO ] Invariant cache hit.
[2023-03-15 10:53:43] [INFO ] [Real]Absence check using 23 positive place invariants in 38 ms returned sat
[2023-03-15 10:53:43] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 10:53:46] [INFO ] After 3860ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-15 10:53:47] [INFO ] [Nat]Absence check using 23 positive place invariants in 28 ms returned sat
[2023-03-15 10:53:47] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 10:53:50] [INFO ] After 2509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-15 10:53:50] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 10:53:51] [INFO ] After 1513ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-15 10:53:54] [INFO ] Deduced a trap composed of 54 places in 2516 ms of which 8 ms to minimize.
[2023-03-15 10:53:56] [INFO ] Deduced a trap composed of 25 places in 2026 ms of which 4 ms to minimize.
[2023-03-15 10:53:59] [INFO ] Deduced a trap composed of 13 places in 2073 ms of which 3 ms to minimize.
[2023-03-15 10:54:01] [INFO ] Deduced a trap composed of 20 places in 2031 ms of which 3 ms to minimize.
[2023-03-15 10:54:03] [INFO ] Deduced a trap composed of 24 places in 2028 ms of which 2 ms to minimize.
[2023-03-15 10:54:05] [INFO ] Deduced a trap composed of 93 places in 1649 ms of which 2 ms to minimize.
[2023-03-15 10:54:07] [INFO ] Deduced a trap composed of 59 places in 1624 ms of which 2 ms to minimize.
[2023-03-15 10:54:08] [INFO ] Deduced a trap composed of 13 places in 1723 ms of which 2 ms to minimize.
[2023-03-15 10:54:10] [INFO ] Deduced a trap composed of 86 places in 1753 ms of which 2 ms to minimize.
[2023-03-15 10:54:12] [INFO ] Deduced a trap composed of 48 places in 1731 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 10:54:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 10:54:12] [INFO ] After 26023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 56 ms.
Support contains 12 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 884 transitions
Trivial Post-agglo rules discarded 884 transitions
Performed 884 trivial Post agglomeration. Transition count delta: 884
Iterating post reduction 0 with 884 rules applied. Total rules applied 884 place count 1992 transition count 2212
Reduce places removed 884 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 888 rules applied. Total rules applied 1772 place count 1108 transition count 2208
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1776 place count 1104 transition count 2208
Performed 444 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 444 Pre rules applied. Total rules applied 1776 place count 1104 transition count 1764
Deduced a syphon composed of 444 places in 3 ms
Reduce places removed 444 places and 0 transitions.
Iterating global reduction 3 with 888 rules applied. Total rules applied 2664 place count 660 transition count 1764
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 4 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 2772 place count 606 transition count 1710
Applied a total of 2772 rules in 399 ms. Remains 606 /1992 variables (removed 1386) and now considering 1710/3096 (removed 1386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 400 ms. Remains : 606/1992 places, 1710/3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) 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 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) 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 7) 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 7) seen :0
Running SMT prover for 7 properties.
[2023-03-15 10:54:13] [INFO ] Flow matrix only has 1374 transitions (discarded 336 similar events)
// Phase 1: matrix 1374 rows 606 cols
[2023-03-15 10:54:13] [INFO ] Computed 31 place invariants in 20 ms
[2023-03-15 10:54:14] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2023-03-15 10:54:14] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-15 10:54:14] [INFO ] After 696ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:2
[2023-03-15 10:54:14] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 10:54:15] [INFO ] After 313ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-15 10:54:15] [INFO ] After 1344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-15 10:54:15] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2023-03-15 10:54:15] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 10:54:16] [INFO ] After 667ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-15 10:54:16] [INFO ] After 376ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-15 10:54:16] [INFO ] Deduced a trap composed of 13 places in 445 ms of which 1 ms to minimize.
[2023-03-15 10:54:17] [INFO ] Deduced a trap composed of 27 places in 399 ms of which 1 ms to minimize.
[2023-03-15 10:54:17] [INFO ] Deduced a trap composed of 20 places in 444 ms of which 1 ms to minimize.
[2023-03-15 10:54:18] [INFO ] Deduced a trap composed of 12 places in 395 ms of which 1 ms to minimize.
[2023-03-15 10:54:18] [INFO ] Deduced a trap composed of 20 places in 423 ms of which 3 ms to minimize.
[2023-03-15 10:54:19] [INFO ] Deduced a trap composed of 20 places in 420 ms of which 1 ms to minimize.
[2023-03-15 10:54:19] [INFO ] Deduced a trap composed of 33 places in 441 ms of which 1 ms to minimize.
[2023-03-15 10:54:20] [INFO ] Deduced a trap composed of 33 places in 393 ms of which 2 ms to minimize.
[2023-03-15 10:54:20] [INFO ] Deduced a trap composed of 14 places in 385 ms of which 1 ms to minimize.
[2023-03-15 10:54:21] [INFO ] Deduced a trap composed of 13 places in 382 ms of which 0 ms to minimize.
[2023-03-15 10:54:21] [INFO ] Deduced a trap composed of 11 places in 446 ms of which 1 ms to minimize.
[2023-03-15 10:54:22] [INFO ] Deduced a trap composed of 13 places in 376 ms of which 2 ms to minimize.
[2023-03-15 10:54:22] [INFO ] Deduced a trap composed of 97 places in 386 ms of which 1 ms to minimize.
[2023-03-15 10:54:22] [INFO ] Deduced a trap composed of 64 places in 375 ms of which 0 ms to minimize.
[2023-03-15 10:54:23] [INFO ] Deduced a trap composed of 34 places in 388 ms of which 0 ms to minimize.
[2023-03-15 10:54:23] [INFO ] Deduced a trap composed of 29 places in 370 ms of which 1 ms to minimize.
[2023-03-15 10:54:24] [INFO ] Deduced a trap composed of 60 places in 341 ms of which 1 ms to minimize.
[2023-03-15 10:54:24] [INFO ] Deduced a trap composed of 41 places in 307 ms of which 1 ms to minimize.
[2023-03-15 10:54:24] [INFO ] Deduced a trap composed of 30 places in 331 ms of which 0 ms to minimize.
[2023-03-15 10:54:24] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 8433 ms
[2023-03-15 10:54:25] [INFO ] Deduced a trap composed of 64 places in 363 ms of which 1 ms to minimize.
[2023-03-15 10:54:25] [INFO ] Deduced a trap composed of 60 places in 303 ms of which 0 ms to minimize.
[2023-03-15 10:54:26] [INFO ] Deduced a trap composed of 44 places in 300 ms of which 1 ms to minimize.
[2023-03-15 10:54:26] [INFO ] Deduced a trap composed of 41 places in 357 ms of which 1 ms to minimize.
[2023-03-15 10:54:26] [INFO ] Deduced a trap composed of 40 places in 355 ms of which 1 ms to minimize.
[2023-03-15 10:54:27] [INFO ] Deduced a trap composed of 45 places in 367 ms of which 4 ms to minimize.
[2023-03-15 10:54:27] [INFO ] Deduced a trap composed of 31 places in 306 ms of which 1 ms to minimize.
[2023-03-15 10:54:28] [INFO ] Deduced a trap composed of 61 places in 277 ms of which 1 ms to minimize.
[2023-03-15 10:54:28] [INFO ] Deduced a trap composed of 70 places in 294 ms of which 1 ms to minimize.
[2023-03-15 10:54:28] [INFO ] Deduced a trap composed of 70 places in 288 ms of which 1 ms to minimize.
[2023-03-15 10:54:29] [INFO ] Deduced a trap composed of 70 places in 257 ms of which 1 ms to minimize.
[2023-03-15 10:54:29] [INFO ] Deduced a trap composed of 77 places in 256 ms of which 1 ms to minimize.
[2023-03-15 10:54:29] [INFO ] Deduced a trap composed of 67 places in 335 ms of which 0 ms to minimize.
[2023-03-15 10:54:30] [INFO ] Deduced a trap composed of 61 places in 330 ms of which 1 ms to minimize.
[2023-03-15 10:54:30] [INFO ] Deduced a trap composed of 56 places in 293 ms of which 0 ms to minimize.
[2023-03-15 10:54:30] [INFO ] Deduced a trap composed of 34 places in 258 ms of which 1 ms to minimize.
[2023-03-15 10:54:31] [INFO ] Deduced a trap composed of 23 places in 328 ms of which 1 ms to minimize.
[2023-03-15 10:54:31] [INFO ] Deduced a trap composed of 45 places in 351 ms of which 1 ms to minimize.
[2023-03-15 10:54:32] [INFO ] Deduced a trap composed of 77 places in 365 ms of which 1 ms to minimize.
[2023-03-15 10:54:32] [INFO ] Deduced a trap composed of 48 places in 369 ms of which 1 ms to minimize.
[2023-03-15 10:54:32] [INFO ] Deduced a trap composed of 52 places in 362 ms of which 1 ms to minimize.
[2023-03-15 10:54:33] [INFO ] Deduced a trap composed of 29 places in 334 ms of which 1 ms to minimize.
[2023-03-15 10:54:33] [INFO ] Deduced a trap composed of 39 places in 331 ms of which 1 ms to minimize.
[2023-03-15 10:54:34] [INFO ] Deduced a trap composed of 22 places in 244 ms of which 0 ms to minimize.
[2023-03-15 10:54:34] [INFO ] Deduced a trap composed of 54 places in 193 ms of which 1 ms to minimize.
[2023-03-15 10:54:34] [INFO ] Deduced a trap composed of 51 places in 209 ms of which 0 ms to minimize.
[2023-03-15 10:54:34] [INFO ] Deduced a trap composed of 59 places in 224 ms of which 1 ms to minimize.
[2023-03-15 10:54:35] [INFO ] Deduced a trap composed of 49 places in 328 ms of which 13 ms to minimize.
[2023-03-15 10:54:35] [INFO ] Deduced a trap composed of 61 places in 303 ms of which 1 ms to minimize.
[2023-03-15 10:54:36] [INFO ] Deduced a trap composed of 45 places in 314 ms of which 1 ms to minimize.
[2023-03-15 10:54:36] [INFO ] Deduced a trap composed of 50 places in 265 ms of which 1 ms to minimize.
[2023-03-15 10:54:36] [INFO ] Deduced a trap composed of 51 places in 269 ms of which 1 ms to minimize.
[2023-03-15 10:54:37] [INFO ] Deduced a trap composed of 57 places in 357 ms of which 0 ms to minimize.
[2023-03-15 10:54:37] [INFO ] Deduced a trap composed of 16 places in 349 ms of which 1 ms to minimize.
[2023-03-15 10:54:37] [INFO ] Deduced a trap composed of 51 places in 290 ms of which 1 ms to minimize.
[2023-03-15 10:54:38] [INFO ] Deduced a trap composed of 31 places in 287 ms of which 1 ms to minimize.
[2023-03-15 10:54:38] [INFO ] Deduced a trap composed of 22 places in 358 ms of which 1 ms to minimize.
[2023-03-15 10:54:39] [INFO ] Deduced a trap composed of 61 places in 292 ms of which 2 ms to minimize.
[2023-03-15 10:54:39] [INFO ] Deduced a trap composed of 22 places in 339 ms of which 13 ms to minimize.
[2023-03-15 10:54:39] [INFO ] Deduced a trap composed of 24 places in 317 ms of which 2 ms to minimize.
[2023-03-15 10:54:40] [INFO ] Deduced a trap composed of 34 places in 261 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 10:54:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 10:54:40] [INFO ] After 25131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 11 out of 606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 1710/1710 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 606 transition count 1709
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 605 transition count 1709
Applied a total of 2 rules in 57 ms. Remains 605 /606 variables (removed 1) and now considering 1709/1710 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 605/606 places, 1709/1710 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) 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 7) 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 7) 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 7) 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 7) seen :0
Interrupted probabilistic random walk after 338292 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 338292 steps, saw 57497 distinct states, run finished after 3005 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-15 10:54:43] [INFO ] Flow matrix only has 1373 transitions (discarded 336 similar events)
// Phase 1: matrix 1373 rows 605 cols
[2023-03-15 10:54:43] [INFO ] Computed 31 place invariants in 6 ms
[2023-03-15 10:54:44] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-15 10:54:44] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 10:54:44] [INFO ] After 1021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-15 10:54:45] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2023-03-15 10:54:45] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-15 10:54:45] [INFO ] After 691ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-15 10:54:45] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 10:54:46] [INFO ] After 447ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-15 10:54:46] [INFO ] Deduced a trap composed of 11 places in 427 ms of which 1 ms to minimize.
[2023-03-15 10:54:47] [INFO ] Deduced a trap composed of 20 places in 429 ms of which 1 ms to minimize.
[2023-03-15 10:54:47] [INFO ] Deduced a trap composed of 20 places in 334 ms of which 1 ms to minimize.
[2023-03-15 10:54:48] [INFO ] Deduced a trap composed of 13 places in 394 ms of which 1 ms to minimize.
[2023-03-15 10:54:48] [INFO ] Deduced a trap composed of 14 places in 401 ms of which 0 ms to minimize.
[2023-03-15 10:54:49] [INFO ] Deduced a trap composed of 34 places in 400 ms of which 1 ms to minimize.
[2023-03-15 10:54:49] [INFO ] Deduced a trap composed of 14 places in 407 ms of which 1 ms to minimize.
[2023-03-15 10:54:50] [INFO ] Deduced a trap composed of 27 places in 404 ms of which 1 ms to minimize.
[2023-03-15 10:54:50] [INFO ] Deduced a trap composed of 11 places in 416 ms of which 1 ms to minimize.
[2023-03-15 10:54:50] [INFO ] Deduced a trap composed of 29 places in 398 ms of which 1 ms to minimize.
[2023-03-15 10:54:51] [INFO ] Deduced a trap composed of 16 places in 413 ms of which 0 ms to minimize.
[2023-03-15 10:54:51] [INFO ] Deduced a trap composed of 29 places in 288 ms of which 0 ms to minimize.
[2023-03-15 10:54:52] [INFO ] Deduced a trap composed of 29 places in 355 ms of which 1 ms to minimize.
[2023-03-15 10:54:52] [INFO ] Deduced a trap composed of 34 places in 362 ms of which 1 ms to minimize.
[2023-03-15 10:54:52] [INFO ] Deduced a trap composed of 33 places in 381 ms of which 0 ms to minimize.
[2023-03-15 10:54:53] [INFO ] Deduced a trap composed of 27 places in 406 ms of which 1 ms to minimize.
[2023-03-15 10:54:53] [INFO ] Deduced a trap composed of 15 places in 406 ms of which 1 ms to minimize.
[2023-03-15 10:54:54] [INFO ] Deduced a trap composed of 16 places in 402 ms of which 0 ms to minimize.
[2023-03-15 10:54:54] [INFO ] Deduced a trap composed of 51 places in 362 ms of which 1 ms to minimize.
[2023-03-15 10:54:55] [INFO ] Deduced a trap composed of 44 places in 359 ms of which 1 ms to minimize.
[2023-03-15 10:54:55] [INFO ] Deduced a trap composed of 43 places in 361 ms of which 1 ms to minimize.
[2023-03-15 10:54:55] [INFO ] Deduced a trap composed of 42 places in 335 ms of which 1 ms to minimize.
[2023-03-15 10:54:56] [INFO ] Deduced a trap composed of 116 places in 326 ms of which 0 ms to minimize.
[2023-03-15 10:54:56] [INFO ] Deduced a trap composed of 33 places in 303 ms of which 0 ms to minimize.
[2023-03-15 10:54:56] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 10340 ms
[2023-03-15 10:54:57] [INFO ] Deduced a trap composed of 42 places in 354 ms of which 1 ms to minimize.
[2023-03-15 10:54:57] [INFO ] Deduced a trap composed of 70 places in 365 ms of which 1 ms to minimize.
[2023-03-15 10:54:58] [INFO ] Deduced a trap composed of 37 places in 393 ms of which 1 ms to minimize.
[2023-03-15 10:54:58] [INFO ] Deduced a trap composed of 73 places in 396 ms of which 1 ms to minimize.
[2023-03-15 10:54:58] [INFO ] Deduced a trap composed of 61 places in 402 ms of which 1 ms to minimize.
[2023-03-15 10:54:59] [INFO ] Deduced a trap composed of 83 places in 397 ms of which 1 ms to minimize.
[2023-03-15 10:54:59] [INFO ] Deduced a trap composed of 45 places in 407 ms of which 1 ms to minimize.
[2023-03-15 10:55:00] [INFO ] Deduced a trap composed of 22 places in 396 ms of which 1 ms to minimize.
[2023-03-15 10:55:00] [INFO ] Deduced a trap composed of 25 places in 332 ms of which 1 ms to minimize.
[2023-03-15 10:55:01] [INFO ] Deduced a trap composed of 22 places in 398 ms of which 1 ms to minimize.
[2023-03-15 10:55:01] [INFO ] Deduced a trap composed of 55 places in 373 ms of which 1 ms to minimize.
[2023-03-15 10:55:02] [INFO ] Deduced a trap composed of 39 places in 398 ms of which 0 ms to minimize.
[2023-03-15 10:55:02] [INFO ] Deduced a trap composed of 53 places in 400 ms of which 0 ms to minimize.
[2023-03-15 10:55:02] [INFO ] Deduced a trap composed of 23 places in 407 ms of which 1 ms to minimize.
[2023-03-15 10:55:03] [INFO ] Deduced a trap composed of 60 places in 332 ms of which 1 ms to minimize.
[2023-03-15 10:55:03] [INFO ] Deduced a trap composed of 13 places in 418 ms of which 1 ms to minimize.
[2023-03-15 10:55:04] [INFO ] Deduced a trap composed of 25 places in 387 ms of which 1 ms to minimize.
[2023-03-15 10:55:04] [INFO ] Deduced a trap composed of 44 places in 357 ms of which 1 ms to minimize.
[2023-03-15 10:55:05] [INFO ] Deduced a trap composed of 49 places in 339 ms of which 1 ms to minimize.
[2023-03-15 10:55:05] [INFO ] Deduced a trap composed of 69 places in 354 ms of which 1 ms to minimize.
[2023-03-15 10:55:05] [INFO ] Deduced a trap composed of 31 places in 315 ms of which 1 ms to minimize.
[2023-03-15 10:55:06] [INFO ] Deduced a trap composed of 34 places in 315 ms of which 0 ms to minimize.
[2023-03-15 10:55:06] [INFO ] Deduced a trap composed of 33 places in 355 ms of which 1 ms to minimize.
[2023-03-15 10:55:07] [INFO ] Deduced a trap composed of 41 places in 399 ms of which 1 ms to minimize.
[2023-03-15 10:55:07] [INFO ] Deduced a trap composed of 22 places in 396 ms of which 1 ms to minimize.
[2023-03-15 10:55:07] [INFO ] Deduced a trap composed of 45 places in 325 ms of which 0 ms to minimize.
[2023-03-15 10:55:08] [INFO ] Deduced a trap composed of 44 places in 328 ms of which 1 ms to minimize.
[2023-03-15 10:55:08] [INFO ] Deduced a trap composed of 70 places in 297 ms of which 0 ms to minimize.
[2023-03-15 10:55:08] [INFO ] Deduced a trap composed of 61 places in 294 ms of which 1 ms to minimize.
[2023-03-15 10:55:09] [INFO ] Deduced a trap composed of 61 places in 343 ms of which 0 ms to minimize.
[2023-03-15 10:55:09] [INFO ] Deduced a trap composed of 70 places in 355 ms of which 1 ms to minimize.
[2023-03-15 10:55:10] [INFO ] Deduced a trap composed of 31 places in 359 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 10:55:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 10:55:10] [INFO ] After 25210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 11 out of 605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 1709/1709 transitions.
Applied a total of 0 rules in 39 ms. Remains 605 /605 variables (removed 0) and now considering 1709/1709 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 605/605 places, 1709/1709 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 1709/1709 transitions.
Applied a total of 0 rules in 34 ms. Remains 605 /605 variables (removed 0) and now considering 1709/1709 (removed 0) transitions.
[2023-03-15 10:55:10] [INFO ] Flow matrix only has 1373 transitions (discarded 336 similar events)
[2023-03-15 10:55:10] [INFO ] Invariant cache hit.
[2023-03-15 10:55:11] [INFO ] Implicit Places using invariants in 778 ms returned [589, 590, 591, 592, 593, 602, 603]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 791 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 598/605 places, 1709/1709 transitions.
Applied a total of 0 rules in 33 ms. Remains 598 /598 variables (removed 0) and now considering 1709/1709 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 859 ms. Remains : 598/605 places, 1709/1709 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-15 10:55:11] [INFO ] Flow matrix only has 1373 transitions (discarded 336 similar events)
// Phase 1: matrix 1373 rows 598 cols
[2023-03-15 10:55:11] [INFO ] Computed 24 place invariants in 8 ms
[2023-03-15 10:55:11] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2023-03-15 10:55:11] [INFO ] [Real]Absence check using 23 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-15 10:55:12] [INFO ] After 912ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-15 10:55:12] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2023-03-15 10:55:12] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-15 10:55:13] [INFO ] After 647ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-15 10:55:13] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 10:55:13] [INFO ] After 347ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-15 10:55:14] [INFO ] Deduced a trap composed of 20 places in 453 ms of which 0 ms to minimize.
[2023-03-15 10:55:14] [INFO ] Deduced a trap composed of 11 places in 381 ms of which 1 ms to minimize.
[2023-03-15 10:55:15] [INFO ] Deduced a trap composed of 34 places in 428 ms of which 1 ms to minimize.
[2023-03-15 10:55:15] [INFO ] Deduced a trap composed of 13 places in 392 ms of which 1 ms to minimize.
[2023-03-15 10:55:16] [INFO ] Deduced a trap composed of 11 places in 409 ms of which 1 ms to minimize.
[2023-03-15 10:55:16] [INFO ] Deduced a trap composed of 11 places in 413 ms of which 0 ms to minimize.
[2023-03-15 10:55:17] [INFO ] Deduced a trap composed of 20 places in 410 ms of which 1 ms to minimize.
[2023-03-15 10:55:17] [INFO ] Deduced a trap composed of 13 places in 400 ms of which 0 ms to minimize.
[2023-03-15 10:55:17] [INFO ] Deduced a trap composed of 11 places in 423 ms of which 1 ms to minimize.
[2023-03-15 10:55:18] [INFO ] Deduced a trap composed of 23 places in 416 ms of which 1 ms to minimize.
[2023-03-15 10:55:18] [INFO ] Deduced a trap composed of 26 places in 386 ms of which 1 ms to minimize.
[2023-03-15 10:55:19] [INFO ] Deduced a trap composed of 29 places in 354 ms of which 0 ms to minimize.
[2023-03-15 10:55:19] [INFO ] Deduced a trap composed of 31 places in 332 ms of which 0 ms to minimize.
[2023-03-15 10:55:20] [INFO ] Deduced a trap composed of 33 places in 348 ms of which 1 ms to minimize.
[2023-03-15 10:55:20] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 6278 ms
[2023-03-15 10:55:20] [INFO ] Deduced a trap composed of 27 places in 407 ms of which 1 ms to minimize.
[2023-03-15 10:55:21] [INFO ] Deduced a trap composed of 12 places in 394 ms of which 1 ms to minimize.
[2023-03-15 10:55:21] [INFO ] Deduced a trap composed of 22 places in 389 ms of which 2 ms to minimize.
[2023-03-15 10:55:21] [INFO ] Deduced a trap composed of 26 places in 383 ms of which 0 ms to minimize.
[2023-03-15 10:55:22] [INFO ] Deduced a trap composed of 22 places in 387 ms of which 1 ms to minimize.
[2023-03-15 10:55:22] [INFO ] Deduced a trap composed of 44 places in 338 ms of which 1 ms to minimize.
[2023-03-15 10:55:23] [INFO ] Deduced a trap composed of 41 places in 322 ms of which 0 ms to minimize.
[2023-03-15 10:55:23] [INFO ] Deduced a trap composed of 50 places in 340 ms of which 1 ms to minimize.
[2023-03-15 10:55:23] [INFO ] Deduced a trap composed of 41 places in 351 ms of which 0 ms to minimize.
[2023-03-15 10:55:24] [INFO ] Deduced a trap composed of 40 places in 342 ms of which 1 ms to minimize.
[2023-03-15 10:55:24] [INFO ] Deduced a trap composed of 30 places in 298 ms of which 0 ms to minimize.
[2023-03-15 10:55:25] [INFO ] Deduced a trap composed of 31 places in 325 ms of which 0 ms to minimize.
[2023-03-15 10:55:25] [INFO ] Deduced a trap composed of 57 places in 299 ms of which 0 ms to minimize.
[2023-03-15 10:55:25] [INFO ] Deduced a trap composed of 61 places in 268 ms of which 1 ms to minimize.
[2023-03-15 10:55:26] [INFO ] Deduced a trap composed of 60 places in 279 ms of which 1 ms to minimize.
[2023-03-15 10:55:26] [INFO ] Deduced a trap composed of 50 places in 275 ms of which 1 ms to minimize.
[2023-03-15 10:55:26] [INFO ] Deduced a trap composed of 67 places in 313 ms of which 0 ms to minimize.
[2023-03-15 10:55:27] [INFO ] Deduced a trap composed of 79 places in 308 ms of which 0 ms to minimize.
[2023-03-15 10:55:27] [INFO ] Deduced a trap composed of 49 places in 303 ms of which 1 ms to minimize.
[2023-03-15 10:55:28] [INFO ] Deduced a trap composed of 30 places in 376 ms of which 0 ms to minimize.
[2023-03-15 10:55:28] [INFO ] Deduced a trap composed of 23 places in 344 ms of which 1 ms to minimize.
[2023-03-15 10:55:28] [INFO ] Deduced a trap composed of 13 places in 300 ms of which 0 ms to minimize.
[2023-03-15 10:55:29] [INFO ] Deduced a trap composed of 61 places in 235 ms of which 1 ms to minimize.
[2023-03-15 10:55:29] [INFO ] Deduced a trap composed of 13 places in 369 ms of which 0 ms to minimize.
[2023-03-15 10:55:30] [INFO ] Deduced a trap composed of 16 places in 379 ms of which 1 ms to minimize.
[2023-03-15 10:55:30] [INFO ] Deduced a trap composed of 13 places in 371 ms of which 1 ms to minimize.
[2023-03-15 10:55:30] [INFO ] Deduced a trap composed of 31 places in 332 ms of which 1 ms to minimize.
[2023-03-15 10:55:31] [INFO ] Deduced a trap composed of 20 places in 342 ms of which 1 ms to minimize.
[2023-03-15 10:55:31] [INFO ] Deduced a trap composed of 45 places in 318 ms of which 0 ms to minimize.
[2023-03-15 10:55:31] [INFO ] Deduced a trap composed of 50 places in 275 ms of which 0 ms to minimize.
[2023-03-15 10:55:32] [INFO ] Deduced a trap composed of 67 places in 237 ms of which 0 ms to minimize.
[2023-03-15 10:55:32] [INFO ] Deduced a trap composed of 29 places in 323 ms of which 1 ms to minimize.
[2023-03-15 10:55:33] [INFO ] Deduced a trap composed of 45 places in 293 ms of which 0 ms to minimize.
[2023-03-15 10:55:33] [INFO ] Deduced a trap composed of 50 places in 284 ms of which 1 ms to minimize.
[2023-03-15 10:55:33] [INFO ] Deduced a trap composed of 61 places in 197 ms of which 1 ms to minimize.
[2023-03-15 10:55:33] [INFO ] Deduced a trap composed of 77 places in 199 ms of which 0 ms to minimize.
[2023-03-15 10:55:34] [INFO ] Deduced a trap composed of 77 places in 178 ms of which 0 ms to minimize.
[2023-03-15 10:55:34] [INFO ] Deduced a trap composed of 77 places in 186 ms of which 0 ms to minimize.
[2023-03-15 10:55:34] [INFO ] Deduced a trap composed of 76 places in 191 ms of which 1 ms to minimize.
[2023-03-15 10:55:34] [INFO ] Deduced a trap composed of 70 places in 178 ms of which 1 ms to minimize.
[2023-03-15 10:55:35] [INFO ] Deduced a trap composed of 77 places in 173 ms of which 1 ms to minimize.
[2023-03-15 10:55:35] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 1 ms to minimize.
[2023-03-15 10:55:35] [INFO ] Deduced a trap composed of 42 places in 267 ms of which 0 ms to minimize.
[2023-03-15 10:55:36] [INFO ] Deduced a trap composed of 30 places in 252 ms of which 0 ms to minimize.
[2023-03-15 10:55:36] [INFO ] Deduced a trap composed of 33 places in 331 ms of which 1 ms to minimize.
[2023-03-15 10:55:36] [INFO ] Deduced a trap composed of 14 places in 304 ms of which 0 ms to minimize.
[2023-03-15 10:55:37] [INFO ] Deduced a trap composed of 44 places in 294 ms of which 0 ms to minimize.
[2023-03-15 10:55:37] [INFO ] Deduced a trap composed of 13 places in 279 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 10:55:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 10:55:37] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 9 out of 598 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 598/598 places, 1709/1709 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 598 transition count 1707
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 596 transition count 1707
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 596 transition count 1705
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 594 transition count 1705
Applied a total of 8 rules in 48 ms. Remains 594 /598 variables (removed 4) and now considering 1705/1709 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 594/598 places, 1705/1709 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(!p0))))'
Support contains 48 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 890 transitions
Trivial Post-agglo rules discarded 890 transitions
Performed 890 trivial Post agglomeration. Transition count delta: 890
Iterating post reduction 0 with 890 rules applied. Total rules applied 890 place count 1992 transition count 2206
Reduce places removed 890 places and 0 transitions.
Iterating post reduction 1 with 890 rules applied. Total rules applied 1780 place count 1102 transition count 2206
Performed 406 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 406 Pre rules applied. Total rules applied 1780 place count 1102 transition count 1800
Deduced a syphon composed of 406 places in 1 ms
Reduce places removed 406 places and 0 transitions.
Iterating global reduction 2 with 812 rules applied. Total rules applied 2592 place count 696 transition count 1800
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 2608 place count 688 transition count 1792
Applied a total of 2608 rules in 213 ms. Remains 688 /1992 variables (removed 1304) and now considering 1792/3096 (removed 1304) transitions.
[2023-03-15 10:55:38] [INFO ] Flow matrix only has 1456 transitions (discarded 336 similar events)
// Phase 1: matrix 1456 rows 688 cols
[2023-03-15 10:55:38] [INFO ] Computed 31 place invariants in 6 ms
[2023-03-15 10:55:38] [INFO ] Implicit Places using invariants in 706 ms returned [672, 673, 674, 675, 676, 685, 686, 687]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 714 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 680/1992 places, 1792/3096 transitions.
Applied a total of 0 rules in 62 ms. Remains 680 /680 variables (removed 0) and now considering 1792/1792 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 991 ms. Remains : 680/1992 places, 1792/3096 transitions.
Stuttering acceptance computed with spot in 353 ms :[false]
Running random walk in product with property : Peterson-PT-7-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s394 1) (EQ s393 1) (EQ s392 1) (EQ s391 1) (EQ s390 1) (EQ s389 1) (EQ s388 1) (EQ s387 1) (EQ s402 1) (EQ s401 1) (EQ s400 1) (EQ s399 1) (EQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 797 ms.
Stack based approach found an accepted trace after 2029 steps with 0 reset with depth 2030 and stack size 1732 in 19 ms.
FORMULA Peterson-PT-7-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-00 finished in 2230 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 16 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 101 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-15 10:55:40] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-15 10:55:40] [INFO ] Computed 31 place invariants in 15 ms
[2023-03-15 10:55:41] [INFO ] Implicit Places using invariants in 1145 ms returned []
[2023-03-15 10:55:41] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:55:41] [INFO ] Invariant cache hit.
[2023-03-15 10:55:42] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 2204 ms to find 0 implicit places.
[2023-03-15 10:55:42] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:55:42] [INFO ] Invariant cache hit.
[2023-03-15 10:55:45] [INFO ] Dead Transitions using invariants and state equation in 2682 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4990 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-01 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 (OR (NEQ s1016 1) (NEQ s1927 1)) (OR (NEQ s896 1) (NEQ s1921 1)) (OR (NEQ s895 1) (NEQ s1922 1)) (OR (NEQ s894 1) (NEQ s1923 1)) (OR (NEQ s893 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 273 steps with 0 reset in 2 ms.
FORMULA Peterson-PT-7-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-01 finished in 5134 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(p0))||G(p1)))'
Support contains 168 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 99 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-15 10:55:45] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:55:45] [INFO ] Invariant cache hit.
[2023-03-15 10:55:46] [INFO ] Implicit Places using invariants in 923 ms returned []
[2023-03-15 10:55:46] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:55:46] [INFO ] Invariant cache hit.
[2023-03-15 10:55:47] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1862 ms to find 0 implicit places.
[2023-03-15 10:55:47] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:55:47] [INFO ] Invariant cache hit.
[2023-03-15 10:55:50] [INFO ] Dead Transitions using invariants and state equation in 3370 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5334 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 3}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(OR (AND (EQ s1492 1) (EQ s1791 1)) (AND (EQ s1289 1) (EQ s1823 1)) (AND (EQ s1283 1) (EQ s1820 1)) (AND (EQ s1287 1) (EQ s1811 1)) (AND (EQ s1333 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-7-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-02 finished in 5640 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((F((F(p1)&&p0))&&X(p2))))'
Support contains 904 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 31 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-15 10:55:50] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:55:50] [INFO ] Invariant cache hit.
[2023-03-15 10:55:52] [INFO ] Implicit Places using invariants in 1167 ms returned []
[2023-03-15 10:55:52] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:55:52] [INFO ] Invariant cache hit.
[2023-03-15 10:55:53] [INFO ] Implicit Places using invariants and state equation in 1384 ms returned []
Implicit Place search using SMT with State Equation took 2553 ms to find 0 implicit places.
[2023-03-15 10:55:53] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:55:53] [INFO ] Invariant cache hit.
[2023-03-15 10:55:57] [INFO ] Dead Transitions using invariants and state equation in 3811 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6397 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1626 0) (EQ s1431 0) (EQ s1886 0) (EQ s1691 0) (EQ s1756 0) (EQ s1610 0) (EQ s1675 0) (EQ s1870 0) (EQ s1480 0) (EQ s1463 0) (EQ s1723 0) (EQ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 5722 ms.
Product exploration explored 100000 steps with 50000 reset in 5896 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 13 factoid took 286 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-7-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-7-LTLFireability-04 finished in 18672 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))'
Support contains 120 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 84 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-15 10:56:09] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:56:09] [INFO ] Invariant cache hit.
[2023-03-15 10:56:10] [INFO ] Implicit Places using invariants in 1045 ms returned []
[2023-03-15 10:56:10] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:56:10] [INFO ] Invariant cache hit.
[2023-03-15 10:56:11] [INFO ] Implicit Places using invariants and state equation in 943 ms returned []
Implicit Place search using SMT with State Equation took 1991 ms to find 0 implicit places.
[2023-03-15 10:56:11] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:56:11] [INFO ] Invariant cache hit.
[2023-03-15 10:56:14] [INFO ] Dead Transitions using invariants and state equation in 3020 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5107 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s487 1) (EQ s486 1) (EQ s485 1) (EQ s483 1) (EQ s482 1) (EQ s481 1) (EQ s492 1) (EQ s488 1)), p0:(OR (AND (EQ s1492 1) (EQ s1791 1)) (AND (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-7-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-06 finished in 5230 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 U p1)&&!p0) U G(p0))&&X(p1)))))'
Support contains 464 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 46 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-15 10:56:14] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:56:14] [INFO ] Invariant cache hit.
[2023-03-15 10:56:16] [INFO ] Implicit Places using invariants in 1314 ms returned []
[2023-03-15 10:56:16] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:56:16] [INFO ] Invariant cache hit.
[2023-03-15 10:56:17] [INFO ] Implicit Places using invariants and state equation in 1168 ms returned []
Implicit Place search using SMT with State Equation took 2484 ms to find 0 implicit places.
[2023-03-15 10:56:17] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:56:17] [INFO ] Invariant cache hit.
[2023-03-15 10:56:18] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3232 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), p0, p0]
Running random walk in product with property : Peterson-PT-7-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (EQ s1020 1) (EQ s1979 1)) (AND (EQ s1006 1) (EQ s1989 1)) (AND (EQ s1013 1) (EQ s1980 1)) (AND (EQ s1007 1) (EQ s1990 1)) (AND (EQ s1008 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4440 reset in 973 ms.
Stack based approach found an accepted trace after 15076 steps with 678 reset with depth 20 and stack size 20 in 107 ms.
FORMULA Peterson-PT-7-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-07 finished in 4579 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(G(p0)) U p1)))'
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1992 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 447 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 447 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1753
Deduced a syphon composed of 447 places in 2 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 2 with 894 rules applied. Total rules applied 2686 place count 649 transition count 1753
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 2794 place count 595 transition count 1699
Applied a total of 2794 rules in 175 ms. Remains 595 /1992 variables (removed 1397) and now considering 1699/3096 (removed 1397) transitions.
[2023-03-15 10:56:19] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 595 cols
[2023-03-15 10:56:19] [INFO ] Computed 31 place invariants in 7 ms
[2023-03-15 10:56:20] [INFO ] Implicit Places using invariants in 877 ms returned [579, 580, 581, 582, 583, 592, 593, 594]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 880 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 587/1992 places, 1699/3096 transitions.
Applied a total of 0 rules in 39 ms. Remains 587 /587 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1099 ms. Remains : 587/1992 places, 1699/3096 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s330 1) (EQ s353 1)), p0:(AND (EQ s516 1) (EQ s552 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 306 ms.
Stack based approach found an accepted trace after 57 steps with 0 reset with depth 58 and stack size 58 in 0 ms.
FORMULA Peterson-PT-7-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-08 finished in 1592 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)||G(p1))))'
Support contains 6 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1992 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 446 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1754
Deduced a syphon composed of 446 places in 1 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 2 with 892 rules applied. Total rules applied 2684 place count 650 transition count 1754
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2796 place count 594 transition count 1698
Applied a total of 2796 rules in 199 ms. Remains 594 /1992 variables (removed 1398) and now considering 1698/3096 (removed 1398) transitions.
[2023-03-15 10:56:21] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
// Phase 1: matrix 1362 rows 594 cols
[2023-03-15 10:56:21] [INFO ] Computed 31 place invariants in 5 ms
[2023-03-15 10:56:21] [INFO ] Implicit Places using invariants in 729 ms returned [578, 579, 580, 581, 582, 591, 592, 593]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 734 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 586/1992 places, 1698/3096 transitions.
Applied a total of 0 rules in 47 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 981 ms. Remains : 586/1992 places, 1698/3096 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s473 1) (EQ s561 1)) (AND (EQ s563 1) (EQ s574 1))), p1:(OR (EQ s458 0) (EQ s573 0))], nbAcceptance=2, 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 564 ms.
Stack based approach found an accepted trace after 1387 steps with 0 reset with depth 1388 and stack size 1220 in 9 ms.
FORMULA Peterson-PT-7-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-09 finished in 1620 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((X((p1||(p2 U p3)))||p0)))'
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 98 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-15 10:56:22] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-15 10:56:22] [INFO ] Computed 31 place invariants in 13 ms
[2023-03-15 10:56:23] [INFO ] Implicit Places using invariants in 1241 ms returned []
[2023-03-15 10:56:23] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:56:23] [INFO ] Invariant cache hit.
[2023-03-15 10:56:25] [INFO ] Implicit Places using invariants and state equation in 1427 ms returned []
Implicit Place search using SMT with State Equation took 2670 ms to find 0 implicit places.
[2023-03-15 10:56:25] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:56:25] [INFO ] Invariant cache hit.
[2023-03-15 10:56:28] [INFO ] Dead Transitions using invariants and state equation in 3411 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6180 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s894 0) (EQ s1923 0) (EQ s1749 0)), p1:(EQ s1749 0), p3:(AND (EQ s1822 1) (EQ s1961 1)), p2:(EQ s1749 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][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 462 ms.
Product exploration explored 100000 steps with 0 reset in 519 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p3) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 425 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-15 10:56:31] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:56:31] [INFO ] Invariant cache hit.
[2023-03-15 10:56:32] [INFO ] [Real]Absence check using 23 positive place invariants in 34 ms returned sat
[2023-03-15 10:56:32] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-15 10:56:32] [INFO ] After 815ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-15 10:56:32] [INFO ] [Nat]Absence check using 23 positive place invariants in 22 ms returned sat
[2023-03-15 10:56:32] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 10:56:34] [INFO ] After 1818ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-15 10:56:34] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 10:56:35] [INFO ] After 790ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-15 10:56:37] [INFO ] Deduced a trap composed of 64 places in 1920 ms of which 2 ms to minimize.
[2023-03-15 10:56:39] [INFO ] Deduced a trap composed of 22 places in 1636 ms of which 1 ms to minimize.
[2023-03-15 10:56:41] [INFO ] Deduced a trap composed of 20 places in 2068 ms of which 3 ms to minimize.
[2023-03-15 10:56:43] [INFO ] Deduced a trap composed of 54 places in 1799 ms of which 2 ms to minimize.
[2023-03-15 10:56:45] [INFO ] Deduced a trap composed of 116 places in 1838 ms of which 1 ms to minimize.
[2023-03-15 10:56:47] [INFO ] Deduced a trap composed of 56 places in 2182 ms of which 3 ms to minimize.
[2023-03-15 10:56:50] [INFO ] Deduced a trap composed of 123 places in 1914 ms of which 2 ms to minimize.
[2023-03-15 10:56:51] [INFO ] Deduced a trap composed of 21 places in 1657 ms of which 2 ms to minimize.
[2023-03-15 10:56:53] [INFO ] Deduced a trap composed of 183 places in 1564 ms of which 2 ms to minimize.
[2023-03-15 10:56:56] [INFO ] Deduced a trap composed of 58 places in 1676 ms of which 1 ms to minimize.
[2023-03-15 10:56:58] [INFO ] Deduced a trap composed of 92 places in 1938 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 10:56:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 10:56:58] [INFO ] After 26092ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 894 transitions
Trivial Post-agglo rules discarded 894 transitions
Performed 894 trivial Post agglomeration. Transition count delta: 894
Iterating post reduction 0 with 894 rules applied. Total rules applied 894 place count 1992 transition count 2202
Reduce places removed 894 places and 0 transitions.
Iterating post reduction 1 with 894 rules applied. Total rules applied 1788 place count 1098 transition count 2202
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 446 Pre rules applied. Total rules applied 1788 place count 1098 transition count 1756
Deduced a syphon composed of 446 places in 2 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 2 with 892 rules applied. Total rules applied 2680 place count 652 transition count 1756
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2792 place count 596 transition count 1700
Applied a total of 2792 rules in 326 ms. Remains 596 /1992 variables (removed 1396) and now considering 1700/3096 (removed 1396) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 327 ms. Remains : 596/1992 places, 1700/3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) 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 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 368388 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 368388 steps, saw 59376 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-15 10:57:01] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 596 cols
[2023-03-15 10:57:01] [INFO ] Computed 31 place invariants in 7 ms
[2023-03-15 10:57:02] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2023-03-15 10:57:02] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 10:57:02] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 10:57:02] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2023-03-15 10:57:02] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 10:57:02] [INFO ] After 521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 10:57:02] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 10:57:03] [INFO ] After 251ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 10:57:03] [INFO ] Deduced a trap composed of 40 places in 584 ms of which 1 ms to minimize.
[2023-03-15 10:57:04] [INFO ] Deduced a trap composed of 39 places in 631 ms of which 2 ms to minimize.
[2023-03-15 10:57:05] [INFO ] Deduced a trap composed of 13 places in 624 ms of which 1 ms to minimize.
[2023-03-15 10:57:05] [INFO ] Deduced a trap composed of 13 places in 628 ms of which 1 ms to minimize.
[2023-03-15 10:57:06] [INFO ] Deduced a trap composed of 13 places in 633 ms of which 1 ms to minimize.
[2023-03-15 10:57:07] [INFO ] Deduced a trap composed of 22 places in 580 ms of which 1 ms to minimize.
[2023-03-15 10:57:07] [INFO ] Deduced a trap composed of 14 places in 534 ms of which 1 ms to minimize.
[2023-03-15 10:57:08] [INFO ] Deduced a trap composed of 31 places in 585 ms of which 1 ms to minimize.
[2023-03-15 10:57:09] [INFO ] Deduced a trap composed of 21 places in 579 ms of which 1 ms to minimize.
[2023-03-15 10:57:09] [INFO ] Deduced a trap composed of 77 places in 580 ms of which 1 ms to minimize.
[2023-03-15 10:57:10] [INFO ] Deduced a trap composed of 66 places in 553 ms of which 1 ms to minimize.
[2023-03-15 10:57:10] [INFO ] Deduced a trap composed of 25 places in 536 ms of which 1 ms to minimize.
[2023-03-15 10:57:11] [INFO ] Deduced a trap composed of 31 places in 559 ms of which 1 ms to minimize.
[2023-03-15 10:57:12] [INFO ] Deduced a trap composed of 31 places in 502 ms of which 1 ms to minimize.
[2023-03-15 10:57:12] [INFO ] Deduced a trap composed of 14 places in 566 ms of which 1 ms to minimize.
[2023-03-15 10:57:13] [INFO ] Deduced a trap composed of 41 places in 505 ms of which 1 ms to minimize.
[2023-03-15 10:57:14] [INFO ] Deduced a trap composed of 23 places in 464 ms of which 1 ms to minimize.
[2023-03-15 10:57:14] [INFO ] Deduced a trap composed of 32 places in 416 ms of which 1 ms to minimize.
[2023-03-15 10:57:15] [INFO ] Deduced a trap composed of 11 places in 404 ms of which 1 ms to minimize.
[2023-03-15 10:57:15] [INFO ] Deduced a trap composed of 40 places in 368 ms of which 1 ms to minimize.
[2023-03-15 10:57:16] [INFO ] Deduced a trap composed of 58 places in 462 ms of which 1 ms to minimize.
[2023-03-15 10:57:16] [INFO ] Deduced a trap composed of 57 places in 366 ms of which 1 ms to minimize.
[2023-03-15 10:57:16] [INFO ] Deduced a trap composed of 58 places in 341 ms of which 0 ms to minimize.
[2023-03-15 10:57:17] [INFO ] Deduced a trap composed of 55 places in 395 ms of which 1 ms to minimize.
[2023-03-15 10:57:17] [INFO ] Deduced a trap composed of 25 places in 357 ms of which 1 ms to minimize.
[2023-03-15 10:57:18] [INFO ] Deduced a trap composed of 31 places in 478 ms of which 1 ms to minimize.
[2023-03-15 10:57:19] [INFO ] Deduced a trap composed of 20 places in 549 ms of which 1 ms to minimize.
[2023-03-15 10:57:19] [INFO ] Deduced a trap composed of 40 places in 536 ms of which 1 ms to minimize.
[2023-03-15 10:57:20] [INFO ] Deduced a trap composed of 58 places in 504 ms of which 1 ms to minimize.
[2023-03-15 10:57:21] [INFO ] Deduced a trap composed of 52 places in 550 ms of which 1 ms to minimize.
[2023-03-15 10:57:21] [INFO ] Deduced a trap composed of 52 places in 482 ms of which 1 ms to minimize.
[2023-03-15 10:57:22] [INFO ] Deduced a trap composed of 49 places in 445 ms of which 4 ms to minimize.
[2023-03-15 10:57:22] [INFO ] Deduced a trap composed of 52 places in 463 ms of which 1 ms to minimize.
[2023-03-15 10:57:23] [INFO ] Deduced a trap composed of 52 places in 442 ms of which 1 ms to minimize.
[2023-03-15 10:57:23] [INFO ] Deduced a trap composed of 49 places in 365 ms of which 1 ms to minimize.
[2023-03-15 10:57:24] [INFO ] Deduced a trap composed of 67 places in 375 ms of which 1 ms to minimize.
[2023-03-15 10:57:24] [INFO ] Deduced a trap composed of 67 places in 372 ms of which 1 ms to minimize.
[2023-03-15 10:57:25] [INFO ] Deduced a trap composed of 55 places in 351 ms of which 1 ms to minimize.
[2023-03-15 10:57:25] [INFO ] Deduced a trap composed of 49 places in 337 ms of which 0 ms to minimize.
[2023-03-15 10:57:25] [INFO ] Deduced a trap composed of 49 places in 361 ms of which 1 ms to minimize.
[2023-03-15 10:57:26] [INFO ] Deduced a trap composed of 45 places in 410 ms of which 1 ms to minimize.
[2023-03-15 10:57:27] [INFO ] Deduced a trap composed of 30 places in 491 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 10:57:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 10:57:27] [INFO ] After 25073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 44 ms. Remains 596 /596 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 596/596 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 43 ms. Remains 596 /596 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-15 10:57:27] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-15 10:57:27] [INFO ] Invariant cache hit.
[2023-03-15 10:57:28] [INFO ] Implicit Places using invariants in 1050 ms returned [580, 581, 582, 583, 584, 593, 594, 595]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1069 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 588/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 48 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1163 ms. Remains : 588/596 places, 1700/1700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 380592 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 380592 steps, saw 60454 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-15 10:57:31] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2023-03-15 10:57:31] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-15 10:57:31] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-15 10:57:32] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 10:57:32] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2023-03-15 10:57:32] [INFO ] After 626ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 10:57:32] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 10:57:33] [INFO ] After 236ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 10:57:33] [INFO ] Deduced a trap composed of 12 places in 614 ms of which 1 ms to minimize.
[2023-03-15 10:57:34] [INFO ] Deduced a trap composed of 22 places in 553 ms of which 1 ms to minimize.
[2023-03-15 10:57:34] [INFO ] Deduced a trap composed of 21 places in 545 ms of which 1 ms to minimize.
[2023-03-15 10:57:35] [INFO ] Deduced a trap composed of 13 places in 490 ms of which 1 ms to minimize.
[2023-03-15 10:57:36] [INFO ] Deduced a trap composed of 13 places in 495 ms of which 1 ms to minimize.
[2023-03-15 10:57:36] [INFO ] Deduced a trap composed of 14 places in 489 ms of which 1 ms to minimize.
[2023-03-15 10:57:37] [INFO ] Deduced a trap composed of 22 places in 462 ms of which 2 ms to minimize.
[2023-03-15 10:57:37] [INFO ] Deduced a trap composed of 12 places in 557 ms of which 2 ms to minimize.
[2023-03-15 10:57:38] [INFO ] Deduced a trap composed of 97 places in 530 ms of which 2 ms to minimize.
[2023-03-15 10:57:38] [INFO ] Deduced a trap composed of 40 places in 378 ms of which 1 ms to minimize.
[2023-03-15 10:57:39] [INFO ] Deduced a trap composed of 21 places in 525 ms of which 1 ms to minimize.
[2023-03-15 10:57:40] [INFO ] Deduced a trap composed of 93 places in 471 ms of which 1 ms to minimize.
[2023-03-15 10:57:40] [INFO ] Deduced a trap composed of 12 places in 560 ms of which 10 ms to minimize.
[2023-03-15 10:57:41] [INFO ] Deduced a trap composed of 35 places in 490 ms of which 2 ms to minimize.
[2023-03-15 10:57:41] [INFO ] Deduced a trap composed of 31 places in 524 ms of which 4 ms to minimize.
[2023-03-15 10:57:42] [INFO ] Deduced a trap composed of 31 places in 566 ms of which 1 ms to minimize.
[2023-03-15 10:57:43] [INFO ] Deduced a trap composed of 70 places in 554 ms of which 1 ms to minimize.
[2023-03-15 10:57:43] [INFO ] Deduced a trap composed of 57 places in 507 ms of which 1 ms to minimize.
[2023-03-15 10:57:44] [INFO ] Deduced a trap composed of 31 places in 548 ms of which 1 ms to minimize.
[2023-03-15 10:57:45] [INFO ] Deduced a trap composed of 40 places in 547 ms of which 1 ms to minimize.
[2023-03-15 10:57:45] [INFO ] Deduced a trap composed of 39 places in 515 ms of which 1 ms to minimize.
[2023-03-15 10:57:46] [INFO ] Deduced a trap composed of 22 places in 494 ms of which 1 ms to minimize.
[2023-03-15 10:57:46] [INFO ] Deduced a trap composed of 13 places in 371 ms of which 0 ms to minimize.
[2023-03-15 10:57:47] [INFO ] Deduced a trap composed of 31 places in 543 ms of which 1 ms to minimize.
[2023-03-15 10:57:47] [INFO ] Deduced a trap composed of 12 places in 383 ms of which 1 ms to minimize.
[2023-03-15 10:57:48] [INFO ] Deduced a trap composed of 14 places in 415 ms of which 1 ms to minimize.
[2023-03-15 10:57:48] [INFO ] Deduced a trap composed of 25 places in 365 ms of which 1 ms to minimize.
[2023-03-15 10:57:49] [INFO ] Deduced a trap composed of 39 places in 455 ms of which 1 ms to minimize.
[2023-03-15 10:57:49] [INFO ] Deduced a trap composed of 41 places in 491 ms of which 1 ms to minimize.
[2023-03-15 10:57:50] [INFO ] Deduced a trap composed of 57 places in 510 ms of which 1 ms to minimize.
[2023-03-15 10:57:50] [INFO ] Deduced a trap composed of 40 places in 526 ms of which 1 ms to minimize.
[2023-03-15 10:57:51] [INFO ] Deduced a trap composed of 55 places in 566 ms of which 1 ms to minimize.
[2023-03-15 10:57:52] [INFO ] Deduced a trap composed of 32 places in 532 ms of which 1 ms to minimize.
[2023-03-15 10:57:52] [INFO ] Deduced a trap composed of 48 places in 568 ms of which 1 ms to minimize.
[2023-03-15 10:57:53] [INFO ] Deduced a trap composed of 14 places in 578 ms of which 1 ms to minimize.
[2023-03-15 10:57:54] [INFO ] Deduced a trap composed of 23 places in 588 ms of which 1 ms to minimize.
[2023-03-15 10:57:54] [INFO ] Deduced a trap composed of 53 places in 468 ms of which 1 ms to minimize.
[2023-03-15 10:57:55] [INFO ] Deduced a trap composed of 31 places in 544 ms of which 1 ms to minimize.
[2023-03-15 10:57:56] [INFO ] Deduced a trap composed of 66 places in 510 ms of which 1 ms to minimize.
[2023-03-15 10:57:56] [INFO ] Deduced a trap composed of 41 places in 528 ms of which 1 ms to minimize.
[2023-03-15 10:57:57] [INFO ] Deduced a trap composed of 48 places in 437 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 10:57:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 10:57:57] [INFO ] After 25216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 42 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 588/588 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 42 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-15 10:57:57] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-15 10:57:57] [INFO ] Invariant cache hit.
[2023-03-15 10:57:58] [INFO ] Implicit Places using invariants in 1057 ms returned []
[2023-03-15 10:57:58] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-15 10:57:58] [INFO ] Invariant cache hit.
[2023-03-15 10:57:59] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 10:58:03] [INFO ] Implicit Places using invariants and state equation in 4914 ms returned []
Implicit Place search using SMT with State Equation took 6002 ms to find 0 implicit places.
[2023-03-15 10:58:03] [INFO ] Redundant transitions in 202 ms returned []
[2023-03-15 10:58:03] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-15 10:58:03] [INFO ] Invariant cache hit.
[2023-03-15 10:58:04] [INFO ] Dead Transitions using invariants and state equation in 1405 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7665 ms. Remains : 588/588 places, 1700/1700 transitions.
Graph (trivial) has 1287 edges and 588 vertex of which 445 / 588 are part of one of the 56 SCC in 6 ms
Free SCC test removed 389 places
Drop transitions removed 778 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1169 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 199 transition count 476
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 144 transition count 476
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 117 place count 141 transition count 471
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 23 rules applied. Total rules applied 140 place count 126 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 63 edges and 126 vertex of which 48 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 42 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 142 place count 84 transition count 470
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (trivial) has 255 edges and 79 vertex of which 35 / 79 are part of one of the 7 SCC in 1 ms
Free SCC test removed 28 places
Iterating post reduction 1 with 54 rules applied. Total rules applied 196 place count 51 transition count 422
Drop transitions removed 140 transitions
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 312 transitions.
Iterating post reduction 2 with 312 rules applied. Total rules applied 508 place count 51 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 510 place count 50 transition count 109
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 514 place count 50 transition count 105
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 515 place count 50 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 516 place count 49 transition count 104
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 518 place count 49 transition count 104
Applied a total of 518 rules in 147 ms. Remains 49 /588 variables (removed 539) and now considering 104/1700 (removed 1596) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 104 rows 49 cols
[2023-03-15 10:58:05] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 10:58:05] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 10:58:05] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 10:58:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-15 10:58:05] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 10:58:05] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-15 10:58:05] [INFO ] After 183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p3) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 7 factoid took 536 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 172 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-15 10:58:06] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-15 10:58:06] [INFO ] Computed 31 place invariants in 22 ms
[2023-03-15 10:58:08] [INFO ] Implicit Places using invariants in 1664 ms returned []
[2023-03-15 10:58:08] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:58:08] [INFO ] Invariant cache hit.
[2023-03-15 10:58:09] [INFO ] Implicit Places using invariants and state equation in 1533 ms returned []
Implicit Place search using SMT with State Equation took 3228 ms to find 0 implicit places.
[2023-03-15 10:58:09] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:58:09] [INFO ] Invariant cache hit.
[2023-03-15 10:58:12] [INFO ] Dead Transitions using invariants and state equation in 3019 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6442 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 371 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 10:58:13] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:58:13] [INFO ] Invariant cache hit.
[2023-03-15 10:58:14] [INFO ] [Real]Absence check using 23 positive place invariants in 22 ms returned sat
[2023-03-15 10:58:14] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 10:58:14] [INFO ] After 661ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 10:58:15] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2023-03-15 10:58:15] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 10:58:17] [INFO ] After 1802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 10:58:17] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 10:58:18] [INFO ] After 873ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 10:58:19] [INFO ] Deduced a trap composed of 13 places in 1778 ms of which 2 ms to minimize.
[2023-03-15 10:58:21] [INFO ] Deduced a trap composed of 13 places in 1831 ms of which 3 ms to minimize.
[2023-03-15 10:58:23] [INFO ] Deduced a trap composed of 123 places in 1783 ms of which 2 ms to minimize.
[2023-03-15 10:58:25] [INFO ] Deduced a trap composed of 58 places in 1633 ms of which 2 ms to minimize.
[2023-03-15 10:58:27] [INFO ] Deduced a trap composed of 54 places in 1895 ms of which 2 ms to minimize.
[2023-03-15 10:58:29] [INFO ] Deduced a trap composed of 54 places in 1470 ms of which 2 ms to minimize.
[2023-03-15 10:58:31] [INFO ] Deduced a trap composed of 89 places in 1721 ms of which 2 ms to minimize.
[2023-03-15 10:58:33] [INFO ] Deduced a trap composed of 92 places in 1624 ms of which 2 ms to minimize.
[2023-03-15 10:58:34] [INFO ] Deduced a trap composed of 88 places in 1636 ms of which 2 ms to minimize.
[2023-03-15 10:58:36] [INFO ] Deduced a trap composed of 122 places in 1828 ms of which 2 ms to minimize.
[2023-03-15 10:58:38] [INFO ] Deduced a trap composed of 47 places in 1846 ms of which 2 ms to minimize.
[2023-03-15 10:58:40] [INFO ] Deduced a trap composed of 119 places in 1434 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 10:58:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 10:58:40] [INFO ] After 25920ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 894 transitions
Trivial Post-agglo rules discarded 894 transitions
Performed 894 trivial Post agglomeration. Transition count delta: 894
Iterating post reduction 0 with 894 rules applied. Total rules applied 894 place count 1992 transition count 2202
Reduce places removed 894 places and 0 transitions.
Iterating post reduction 1 with 894 rules applied. Total rules applied 1788 place count 1098 transition count 2202
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 446 Pre rules applied. Total rules applied 1788 place count 1098 transition count 1756
Deduced a syphon composed of 446 places in 1 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 2 with 892 rules applied. Total rules applied 2680 place count 652 transition count 1756
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2792 place count 596 transition count 1700
Applied a total of 2792 rules in 174 ms. Remains 596 /1992 variables (removed 1396) and now considering 1700/3096 (removed 1396) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 596/1992 places, 1700/3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 415620 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{}
Probabilistic random walk after 415620 steps, saw 63768 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-15 10:58:43] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 596 cols
[2023-03-15 10:58:43] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-15 10:58:44] [INFO ] [Real]Absence check using 23 positive place invariants in 15 ms returned sat
[2023-03-15 10:58:44] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 26 ms returned sat
[2023-03-15 10:58:44] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 10:58:44] [INFO ] [Nat]Absence check using 23 positive place invariants in 16 ms returned sat
[2023-03-15 10:58:44] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-15 10:58:45] [INFO ] After 809ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 10:58:45] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 10:58:45] [INFO ] After 512ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 10:58:46] [INFO ] Deduced a trap composed of 40 places in 684 ms of which 1 ms to minimize.
[2023-03-15 10:58:47] [INFO ] Deduced a trap composed of 39 places in 560 ms of which 1 ms to minimize.
[2023-03-15 10:58:47] [INFO ] Deduced a trap composed of 13 places in 372 ms of which 0 ms to minimize.
[2023-03-15 10:58:48] [INFO ] Deduced a trap composed of 13 places in 394 ms of which 0 ms to minimize.
[2023-03-15 10:58:48] [INFO ] Deduced a trap composed of 13 places in 411 ms of which 1 ms to minimize.
[2023-03-15 10:58:48] [INFO ] Deduced a trap composed of 22 places in 380 ms of which 1 ms to minimize.
[2023-03-15 10:58:49] [INFO ] Deduced a trap composed of 14 places in 511 ms of which 1 ms to minimize.
[2023-03-15 10:58:50] [INFO ] Deduced a trap composed of 31 places in 517 ms of which 0 ms to minimize.
[2023-03-15 10:58:50] [INFO ] Deduced a trap composed of 21 places in 484 ms of which 1 ms to minimize.
[2023-03-15 10:58:51] [INFO ] Deduced a trap composed of 77 places in 488 ms of which 1 ms to minimize.
[2023-03-15 10:58:51] [INFO ] Deduced a trap composed of 66 places in 521 ms of which 1 ms to minimize.
[2023-03-15 10:58:52] [INFO ] Deduced a trap composed of 25 places in 477 ms of which 1 ms to minimize.
[2023-03-15 10:58:53] [INFO ] Deduced a trap composed of 31 places in 489 ms of which 1 ms to minimize.
[2023-03-15 10:58:53] [INFO ] Deduced a trap composed of 31 places in 479 ms of which 1 ms to minimize.
[2023-03-15 10:58:54] [INFO ] Deduced a trap composed of 14 places in 569 ms of which 1 ms to minimize.
[2023-03-15 10:58:54] [INFO ] Deduced a trap composed of 41 places in 559 ms of which 1 ms to minimize.
[2023-03-15 10:58:55] [INFO ] Deduced a trap composed of 23 places in 575 ms of which 1 ms to minimize.
[2023-03-15 10:58:56] [INFO ] Deduced a trap composed of 32 places in 538 ms of which 1 ms to minimize.
[2023-03-15 10:58:56] [INFO ] Deduced a trap composed of 11 places in 495 ms of which 1 ms to minimize.
[2023-03-15 10:58:57] [INFO ] Deduced a trap composed of 40 places in 492 ms of which 1 ms to minimize.
[2023-03-15 10:58:58] [INFO ] Deduced a trap composed of 58 places in 504 ms of which 0 ms to minimize.
[2023-03-15 10:58:58] [INFO ] Deduced a trap composed of 57 places in 510 ms of which 1 ms to minimize.
[2023-03-15 10:58:59] [INFO ] Deduced a trap composed of 58 places in 493 ms of which 1 ms to minimize.
[2023-03-15 10:59:00] [INFO ] Deduced a trap composed of 55 places in 541 ms of which 1 ms to minimize.
[2023-03-15 10:59:00] [INFO ] Deduced a trap composed of 25 places in 483 ms of which 1 ms to minimize.
[2023-03-15 10:59:01] [INFO ] Deduced a trap composed of 31 places in 514 ms of which 1 ms to minimize.
[2023-03-15 10:59:01] [INFO ] Deduced a trap composed of 20 places in 466 ms of which 1 ms to minimize.
[2023-03-15 10:59:02] [INFO ] Deduced a trap composed of 40 places in 422 ms of which 1 ms to minimize.
[2023-03-15 10:59:02] [INFO ] Deduced a trap composed of 58 places in 465 ms of which 1 ms to minimize.
[2023-03-15 10:59:03] [INFO ] Deduced a trap composed of 52 places in 480 ms of which 1 ms to minimize.
[2023-03-15 10:59:04] [INFO ] Deduced a trap composed of 52 places in 495 ms of which 1 ms to minimize.
[2023-03-15 10:59:04] [INFO ] Deduced a trap composed of 49 places in 504 ms of which 1 ms to minimize.
[2023-03-15 10:59:05] [INFO ] Deduced a trap composed of 52 places in 465 ms of which 0 ms to minimize.
[2023-03-15 10:59:05] [INFO ] Deduced a trap composed of 52 places in 448 ms of which 1 ms to minimize.
[2023-03-15 10:59:06] [INFO ] Deduced a trap composed of 49 places in 417 ms of which 0 ms to minimize.
[2023-03-15 10:59:06] [INFO ] Deduced a trap composed of 67 places in 410 ms of which 1 ms to minimize.
[2023-03-15 10:59:07] [INFO ] Deduced a trap composed of 67 places in 456 ms of which 1 ms to minimize.
[2023-03-15 10:59:08] [INFO ] Deduced a trap composed of 55 places in 440 ms of which 1 ms to minimize.
[2023-03-15 10:59:08] [INFO ] Deduced a trap composed of 49 places in 411 ms of which 1 ms to minimize.
[2023-03-15 10:59:09] [INFO ] Deduced a trap composed of 49 places in 468 ms of which 1 ms to minimize.
[2023-03-15 10:59:09] [INFO ] Deduced a trap composed of 45 places in 492 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 10:59:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 10:59:09] [INFO ] After 25484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 63 ms. Remains 596 /596 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 596/596 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 53 ms. Remains 596 /596 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-15 10:59:09] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-15 10:59:09] [INFO ] Invariant cache hit.
[2023-03-15 10:59:10] [INFO ] Implicit Places using invariants in 1111 ms returned [580, 581, 582, 583, 584, 593, 594, 595]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1122 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 588/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 42 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1218 ms. Remains : 588/596 places, 1700/1700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 393615 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 393615 steps, saw 61686 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-15 10:59:14] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2023-03-15 10:59:14] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-15 10:59:14] [INFO ] [Real]Absence check using 23 positive place invariants in 16 ms returned sat
[2023-03-15 10:59:14] [INFO ] After 398ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 10:59:14] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2023-03-15 10:59:15] [INFO ] After 743ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 10:59:15] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 10:59:15] [INFO ] After 316ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 10:59:16] [INFO ] Deduced a trap composed of 12 places in 613 ms of which 1 ms to minimize.
[2023-03-15 10:59:17] [INFO ] Deduced a trap composed of 22 places in 567 ms of which 1 ms to minimize.
[2023-03-15 10:59:17] [INFO ] Deduced a trap composed of 21 places in 393 ms of which 1 ms to minimize.
[2023-03-15 10:59:18] [INFO ] Deduced a trap composed of 13 places in 396 ms of which 1 ms to minimize.
[2023-03-15 10:59:18] [INFO ] Deduced a trap composed of 13 places in 603 ms of which 1 ms to minimize.
[2023-03-15 10:59:19] [INFO ] Deduced a trap composed of 14 places in 564 ms of which 1 ms to minimize.
[2023-03-15 10:59:20] [INFO ] Deduced a trap composed of 22 places in 564 ms of which 1 ms to minimize.
[2023-03-15 10:59:20] [INFO ] Deduced a trap composed of 12 places in 636 ms of which 1 ms to minimize.
[2023-03-15 10:59:21] [INFO ] Deduced a trap composed of 97 places in 584 ms of which 1 ms to minimize.
[2023-03-15 10:59:22] [INFO ] Deduced a trap composed of 40 places in 592 ms of which 1 ms to minimize.
[2023-03-15 10:59:22] [INFO ] Deduced a trap composed of 21 places in 587 ms of which 1 ms to minimize.
[2023-03-15 10:59:23] [INFO ] Deduced a trap composed of 93 places in 525 ms of which 1 ms to minimize.
[2023-03-15 10:59:24] [INFO ] Deduced a trap composed of 12 places in 535 ms of which 1 ms to minimize.
[2023-03-15 10:59:24] [INFO ] Deduced a trap composed of 35 places in 554 ms of which 1 ms to minimize.
[2023-03-15 10:59:25] [INFO ] Deduced a trap composed of 31 places in 508 ms of which 0 ms to minimize.
[2023-03-15 10:59:25] [INFO ] Deduced a trap composed of 31 places in 481 ms of which 0 ms to minimize.
[2023-03-15 10:59:26] [INFO ] Deduced a trap composed of 70 places in 473 ms of which 1 ms to minimize.
[2023-03-15 10:59:26] [INFO ] Deduced a trap composed of 57 places in 476 ms of which 1 ms to minimize.
[2023-03-15 10:59:27] [INFO ] Deduced a trap composed of 31 places in 490 ms of which 1 ms to minimize.
[2023-03-15 10:59:27] [INFO ] Deduced a trap composed of 40 places in 486 ms of which 4 ms to minimize.
[2023-03-15 10:59:28] [INFO ] Deduced a trap composed of 39 places in 491 ms of which 1 ms to minimize.
[2023-03-15 10:59:29] [INFO ] Deduced a trap composed of 22 places in 474 ms of which 1 ms to minimize.
[2023-03-15 10:59:29] [INFO ] Deduced a trap composed of 13 places in 459 ms of which 1 ms to minimize.
[2023-03-15 10:59:30] [INFO ] Deduced a trap composed of 31 places in 409 ms of which 1 ms to minimize.
[2023-03-15 10:59:30] [INFO ] Deduced a trap composed of 12 places in 456 ms of which 1 ms to minimize.
[2023-03-15 10:59:31] [INFO ] Deduced a trap composed of 14 places in 427 ms of which 3 ms to minimize.
[2023-03-15 10:59:31] [INFO ] Deduced a trap composed of 25 places in 408 ms of which 1 ms to minimize.
[2023-03-15 10:59:32] [INFO ] Deduced a trap composed of 39 places in 368 ms of which 1 ms to minimize.
[2023-03-15 10:59:32] [INFO ] Deduced a trap composed of 41 places in 328 ms of which 0 ms to minimize.
[2023-03-15 10:59:32] [INFO ] Deduced a trap composed of 57 places in 369 ms of which 1 ms to minimize.
[2023-03-15 10:59:33] [INFO ] Deduced a trap composed of 40 places in 466 ms of which 1 ms to minimize.
[2023-03-15 10:59:34] [INFO ] Deduced a trap composed of 55 places in 539 ms of which 1 ms to minimize.
[2023-03-15 10:59:34] [INFO ] Deduced a trap composed of 32 places in 537 ms of which 1 ms to minimize.
[2023-03-15 10:59:35] [INFO ] Deduced a trap composed of 48 places in 547 ms of which 1 ms to minimize.
[2023-03-15 10:59:36] [INFO ] Deduced a trap composed of 14 places in 544 ms of which 20 ms to minimize.
[2023-03-15 10:59:36] [INFO ] Deduced a trap composed of 23 places in 520 ms of which 1 ms to minimize.
[2023-03-15 10:59:37] [INFO ] Deduced a trap composed of 53 places in 442 ms of which 1 ms to minimize.
[2023-03-15 10:59:37] [INFO ] Deduced a trap composed of 31 places in 441 ms of which 0 ms to minimize.
[2023-03-15 10:59:38] [INFO ] Deduced a trap composed of 66 places in 370 ms of which 1 ms to minimize.
[2023-03-15 10:59:38] [INFO ] Deduced a trap composed of 41 places in 377 ms of which 1 ms to minimize.
[2023-03-15 10:59:39] [INFO ] Deduced a trap composed of 48 places in 335 ms of which 0 ms to minimize.
[2023-03-15 10:59:39] [INFO ] Deduced a trap composed of 49 places in 343 ms of which 0 ms to minimize.
[2023-03-15 10:59:39] [INFO ] Deduced a trap composed of 58 places in 360 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 10:59:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 10:59:39] [INFO ] After 25374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 38 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 588/588 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 36 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-15 10:59:39] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-15 10:59:39] [INFO ] Invariant cache hit.
[2023-03-15 10:59:40] [INFO ] Implicit Places using invariants in 955 ms returned []
[2023-03-15 10:59:40] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-15 10:59:40] [INFO ] Invariant cache hit.
[2023-03-15 10:59:41] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 10:59:45] [INFO ] Implicit Places using invariants and state equation in 4347 ms returned []
Implicit Place search using SMT with State Equation took 5317 ms to find 0 implicit places.
[2023-03-15 10:59:45] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-15 10:59:45] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-15 10:59:45] [INFO ] Invariant cache hit.
[2023-03-15 10:59:47] [INFO ] Dead Transitions using invariants and state equation in 1715 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7161 ms. Remains : 588/588 places, 1700/1700 transitions.
Graph (trivial) has 1287 edges and 588 vertex of which 445 / 588 are part of one of the 56 SCC in 1 ms
Free SCC test removed 389 places
Drop transitions removed 778 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1169 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 199 transition count 476
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 144 transition count 476
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 117 place count 141 transition count 471
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 23 rules applied. Total rules applied 140 place count 126 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 63 edges and 126 vertex of which 48 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 42 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 142 place count 84 transition count 470
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (trivial) has 255 edges and 79 vertex of which 35 / 79 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Iterating post reduction 1 with 54 rules applied. Total rules applied 196 place count 51 transition count 422
Drop transitions removed 140 transitions
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 312 transitions.
Iterating post reduction 2 with 312 rules applied. Total rules applied 508 place count 51 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 510 place count 50 transition count 109
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 514 place count 50 transition count 105
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 515 place count 50 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 516 place count 49 transition count 104
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 518 place count 49 transition count 104
Applied a total of 518 rules in 29 ms. Remains 49 /588 variables (removed 539) and now considering 104/1700 (removed 1596) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 104 rows 49 cols
[2023-03-15 10:59:47] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-15 10:59:47] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 10:59:47] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 10:59:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 10:59:47] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 10:59:47] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-15 10:59:47] [INFO ] After 286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 4 factoid took 388 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Product exploration explored 100000 steps with 0 reset in 442 ms.
Product exploration explored 100000 steps with 0 reset in 623 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Performed 503 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 503 rules applied. Total rules applied 503 place count 1992 transition count 3096
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 399 Pre rules applied. Total rules applied 503 place count 1992 transition count 3389
Deduced a syphon composed of 902 places in 3 ms
Iterating global reduction 1 with 399 rules applied. Total rules applied 902 place count 1992 transition count 3389
Discarding 203 places :
Symmetric choice reduction at 1 with 203 rule applications. Total rules 1105 place count 1789 transition count 3186
Deduced a syphon composed of 699 places in 2 ms
Iterating global reduction 1 with 203 rules applied. Total rules applied 1308 place count 1789 transition count 3186
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1193 places in 2 ms
Iterating global reduction 1 with 494 rules applied. Total rules applied 1802 place count 1789 transition count 3186
Discarding 445 places :
Symmetric choice reduction at 1 with 445 rule applications. Total rules 2247 place count 1344 transition count 2741
Deduced a syphon composed of 748 places in 1 ms
Iterating global reduction 1 with 445 rules applied. Total rules applied 2692 place count 1344 transition count 2741
Deduced a syphon composed of 748 places in 2 ms
Applied a total of 2692 rules in 1571 ms. Remains 1344 /1992 variables (removed 648) and now considering 2741/3096 (removed 355) transitions.
[2023-03-15 10:59:51] [INFO ] Redundant transitions in 102 ms returned []
[2023-03-15 10:59:51] [INFO ] Flow matrix only has 2405 transitions (discarded 336 similar events)
// Phase 1: matrix 2405 rows 1344 cols
[2023-03-15 10:59:51] [INFO ] Computed 31 place invariants in 20 ms
[2023-03-15 10:59:54] [INFO ] Dead Transitions using invariants and state equation in 2629 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1344/1992 places, 2741/3096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4373 ms. Remains : 1344/1992 places, 2741/3096 transitions.
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 105 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-15 10:59:54] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-15 10:59:54] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-15 10:59:55] [INFO ] Implicit Places using invariants in 1379 ms returned []
[2023-03-15 10:59:55] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:59:55] [INFO ] Invariant cache hit.
[2023-03-15 10:59:56] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 1984 ms to find 0 implicit places.
[2023-03-15 10:59:56] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:59:56] [INFO ] Invariant cache hit.
[2023-03-15 10:59:57] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2710 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Treatment of property Peterson-PT-7-LTLFireability-11 finished in 215050 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)||X(G(p1)))))'
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 140 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-15 10:59:57] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:59:57] [INFO ] Invariant cache hit.
[2023-03-15 10:59:59] [INFO ] Implicit Places using invariants in 1520 ms returned []
[2023-03-15 10:59:59] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 10:59:59] [INFO ] Invariant cache hit.
[2023-03-15 11:00:00] [INFO ] Implicit Places using invariants and state equation in 1547 ms returned []
Implicit Place search using SMT with State Equation took 3073 ms to find 0 implicit places.
[2023-03-15 11:00:00] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 11:00:00] [INFO ] Invariant cache hit.
[2023-03-15 11:00:03] [INFO ] Dead Transitions using invariants and state equation in 2926 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6150 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s1318 1) (EQ s1817 1)), p1:(OR (EQ s1453 1) (EQ s1614 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][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 356 ms.
Stack based approach found an accepted trace after 1318 steps with 0 reset with depth 1319 and stack size 1319 in 7 ms.
FORMULA Peterson-PT-7-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-12 finished in 6696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(p1))||(X(p3)&&p2))))'
Support contains 6 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 160 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-15 11:00:04] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 11:00:04] [INFO ] Invariant cache hit.
[2023-03-15 11:00:06] [INFO ] Implicit Places using invariants in 1451 ms returned []
[2023-03-15 11:00:06] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 11:00:06] [INFO ] Invariant cache hit.
[2023-03-15 11:00:07] [INFO ] Implicit Places using invariants and state equation in 1260 ms returned []
Implicit Place search using SMT with State Equation took 2745 ms to find 0 implicit places.
[2023-03-15 11:00:07] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 11:00:07] [INFO ] Invariant cache hit.
[2023-03-15 11:00:10] [INFO ] Dead Transitions using invariants and state equation in 3189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6116 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), (NOT p1), true]
Running random walk in product with property : Peterson-PT-7-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1579 1) (EQ s1008 1) (EQ s1991 1)), p2:(AND (EQ s1006 1) (EQ s1989 1)), p3:(EQ s39 1), p1:(AND (EQ s1006 1) (EQ s1989 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 1 reset in 0 ms.
FORMULA Peterson-PT-7-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-13 finished in 6504 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(F((p0||G(F(p1))||G(p2))))))'
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 96 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-15 11:00:10] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 11:00:10] [INFO ] Invariant cache hit.
[2023-03-15 11:00:11] [INFO ] Implicit Places using invariants in 586 ms returned []
[2023-03-15 11:00:11] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 11:00:11] [INFO ] Invariant cache hit.
[2023-03-15 11:00:12] [INFO ] Implicit Places using invariants and state equation in 1348 ms returned []
Implicit Place search using SMT with State Equation took 1952 ms to find 0 implicit places.
[2023-03-15 11:00:12] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 11:00:12] [INFO ] Invariant cache hit.
[2023-03-15 11:00:16] [INFO ] Dead Transitions using invariants and state equation in 3294 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5343 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s1020 1) (EQ s1979 1)), p2:(EQ s314 0), p1:(EQ s481 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 423 reset in 336 ms.
Product exploration explored 100000 steps with 389 reset in 381 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 11:00:17] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 11:00:17] [INFO ] Invariant cache hit.
[2023-03-15 11:00:18] [INFO ] After 536ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:00:18] [INFO ] [Nat]Absence check using 23 positive place invariants in 25 ms returned sat
[2023-03-15 11:00:18] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 11:00:20] [INFO ] After 1778ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:00:20] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:00:20] [INFO ] After 228ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:00:22] [INFO ] Deduced a trap composed of 20 places in 1855 ms of which 2 ms to minimize.
[2023-03-15 11:00:24] [INFO ] Deduced a trap composed of 66 places in 1778 ms of which 2 ms to minimize.
[2023-03-15 11:00:26] [INFO ] Deduced a trap composed of 66 places in 1844 ms of which 2 ms to minimize.
[2023-03-15 11:00:28] [INFO ] Deduced a trap composed of 55 places in 1705 ms of which 1 ms to minimize.
[2023-03-15 11:00:30] [INFO ] Deduced a trap composed of 13 places in 1608 ms of which 1 ms to minimize.
[2023-03-15 11:00:32] [INFO ] Deduced a trap composed of 21 places in 1680 ms of which 1 ms to minimize.
[2023-03-15 11:00:33] [INFO ] Deduced a trap composed of 140 places in 1568 ms of which 2 ms to minimize.
[2023-03-15 11:00:36] [INFO ] Deduced a trap composed of 168 places in 1792 ms of which 2 ms to minimize.
[2023-03-15 11:00:37] [INFO ] Deduced a trap composed of 100 places in 1539 ms of which 2 ms to minimize.
[2023-03-15 11:00:39] [INFO ] Deduced a trap composed of 88 places in 1664 ms of which 2 ms to minimize.
[2023-03-15 11:00:41] [INFO ] Deduced a trap composed of 101 places in 1550 ms of which 2 ms to minimize.
[2023-03-15 11:00:43] [INFO ] Deduced a trap composed of 21 places in 1763 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 11:00:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 11:00:43] [INFO ] After 25509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 895 transitions
Trivial Post-agglo rules discarded 895 transitions
Performed 895 trivial Post agglomeration. Transition count delta: 895
Iterating post reduction 0 with 895 rules applied. Total rules applied 895 place count 1992 transition count 2201
Reduce places removed 895 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 896 rules applied. Total rules applied 1791 place count 1097 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 446 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1754
Deduced a syphon composed of 446 places in 1 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 3 with 892 rules applied. Total rules applied 2684 place count 650 transition count 1754
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2794 place count 595 transition count 1699
Applied a total of 2794 rules in 246 ms. Remains 595 /1992 variables (removed 1397) and now considering 1699/3096 (removed 1397) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 261 ms. Remains : 595/1992 places, 1699/3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 590913 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 590913 steps, saw 84228 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 11:00:46] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 595 cols
[2023-03-15 11:00:46] [INFO ] Computed 31 place invariants in 3 ms
[2023-03-15 11:00:47] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:00:47] [INFO ] [Nat]Absence check using 23 positive place invariants in 16 ms returned sat
[2023-03-15 11:00:47] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-15 11:00:47] [INFO ] After 652ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:00:47] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:00:48] [INFO ] After 199ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:00:48] [INFO ] Deduced a trap composed of 24 places in 542 ms of which 1 ms to minimize.
[2023-03-15 11:00:49] [INFO ] Deduced a trap composed of 15 places in 556 ms of which 1 ms to minimize.
[2023-03-15 11:00:50] [INFO ] Deduced a trap composed of 12 places in 612 ms of which 1 ms to minimize.
[2023-03-15 11:00:50] [INFO ] Deduced a trap composed of 31 places in 583 ms of which 0 ms to minimize.
[2023-03-15 11:00:51] [INFO ] Deduced a trap composed of 13 places in 395 ms of which 1 ms to minimize.
[2023-03-15 11:00:51] [INFO ] Deduced a trap composed of 33 places in 390 ms of which 1 ms to minimize.
[2023-03-15 11:00:52] [INFO ] Deduced a trap composed of 30 places in 374 ms of which 1 ms to minimize.
[2023-03-15 11:00:52] [INFO ] Deduced a trap composed of 11 places in 580 ms of which 1 ms to minimize.
[2023-03-15 11:00:53] [INFO ] Deduced a trap composed of 20 places in 500 ms of which 1 ms to minimize.
[2023-03-15 11:00:53] [INFO ] Deduced a trap composed of 20 places in 500 ms of which 1 ms to minimize.
[2023-03-15 11:00:54] [INFO ] Deduced a trap composed of 22 places in 580 ms of which 1 ms to minimize.
[2023-03-15 11:00:55] [INFO ] Deduced a trap composed of 25 places in 597 ms of which 1 ms to minimize.
[2023-03-15 11:00:55] [INFO ] Deduced a trap composed of 24 places in 385 ms of which 1 ms to minimize.
[2023-03-15 11:00:56] [INFO ] Deduced a trap composed of 21 places in 384 ms of which 0 ms to minimize.
[2023-03-15 11:00:56] [INFO ] Deduced a trap composed of 34 places in 521 ms of which 1 ms to minimize.
[2023-03-15 11:00:57] [INFO ] Deduced a trap composed of 22 places in 528 ms of which 1 ms to minimize.
[2023-03-15 11:00:57] [INFO ] Deduced a trap composed of 11 places in 501 ms of which 1 ms to minimize.
[2023-03-15 11:00:58] [INFO ] Deduced a trap composed of 52 places in 550 ms of which 1 ms to minimize.
[2023-03-15 11:00:59] [INFO ] Deduced a trap composed of 61 places in 558 ms of which 1 ms to minimize.
[2023-03-15 11:00:59] [INFO ] Deduced a trap composed of 83 places in 558 ms of which 1 ms to minimize.
[2023-03-15 11:01:00] [INFO ] Deduced a trap composed of 31 places in 558 ms of which 1 ms to minimize.
[2023-03-15 11:01:01] [INFO ] Deduced a trap composed of 43 places in 526 ms of which 1 ms to minimize.
[2023-03-15 11:01:01] [INFO ] Deduced a trap composed of 42 places in 499 ms of which 1 ms to minimize.
[2023-03-15 11:01:02] [INFO ] Deduced a trap composed of 51 places in 484 ms of which 1 ms to minimize.
[2023-03-15 11:01:02] [INFO ] Deduced a trap composed of 42 places in 444 ms of which 0 ms to minimize.
[2023-03-15 11:01:03] [INFO ] Deduced a trap composed of 13 places in 481 ms of which 1 ms to minimize.
[2023-03-15 11:01:04] [INFO ] Deduced a trap composed of 51 places in 499 ms of which 1 ms to minimize.
[2023-03-15 11:01:04] [INFO ] Deduced a trap composed of 12 places in 498 ms of which 1 ms to minimize.
[2023-03-15 11:01:05] [INFO ] Deduced a trap composed of 63 places in 445 ms of which 1 ms to minimize.
[2023-03-15 11:01:05] [INFO ] Deduced a trap composed of 52 places in 461 ms of which 1 ms to minimize.
[2023-03-15 11:01:06] [INFO ] Deduced a trap composed of 51 places in 454 ms of which 0 ms to minimize.
[2023-03-15 11:01:06] [INFO ] Deduced a trap composed of 20 places in 456 ms of which 1 ms to minimize.
[2023-03-15 11:01:07] [INFO ] Deduced a trap composed of 11 places in 579 ms of which 4 ms to minimize.
[2023-03-15 11:01:08] [INFO ] Deduced a trap composed of 24 places in 509 ms of which 1 ms to minimize.
[2023-03-15 11:01:08] [INFO ] Deduced a trap composed of 38 places in 458 ms of which 1 ms to minimize.
[2023-03-15 11:01:09] [INFO ] Deduced a trap composed of 42 places in 435 ms of which 1 ms to minimize.
[2023-03-15 11:01:09] [INFO ] Deduced a trap composed of 51 places in 376 ms of which 1 ms to minimize.
[2023-03-15 11:01:10] [INFO ] Deduced a trap composed of 51 places in 350 ms of which 1 ms to minimize.
[2023-03-15 11:01:10] [INFO ] Deduced a trap composed of 51 places in 335 ms of which 0 ms to minimize.
[2023-03-15 11:01:11] [INFO ] Deduced a trap composed of 20 places in 389 ms of which 1 ms to minimize.
[2023-03-15 11:01:11] [INFO ] Deduced a trap composed of 33 places in 512 ms of which 1 ms to minimize.
[2023-03-15 11:01:12] [INFO ] Deduced a trap composed of 42 places in 522 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 11:01:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 11:01:12] [INFO ] After 25282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1699/1699 transitions.
Applied a total of 0 rules in 48 ms. Remains 595 /595 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 595/595 places, 1699/1699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1699/1699 transitions.
Applied a total of 0 rules in 45 ms. Remains 595 /595 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-15 11:01:12] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-15 11:01:12] [INFO ] Invariant cache hit.
[2023-03-15 11:01:13] [INFO ] Implicit Places using invariants in 1119 ms returned [579, 580, 581, 583, 592, 593, 594]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1130 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 588/595 places, 1699/1699 transitions.
Applied a total of 0 rules in 28 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1204 ms. Remains : 588/595 places, 1699/1699 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 594513 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 594513 steps, saw 84497 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 11:01:16] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 588 cols
[2023-03-15 11:01:16] [INFO ] Computed 24 place invariants in 7 ms
[2023-03-15 11:01:16] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:01:17] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2023-03-15 11:01:17] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-15 11:01:17] [INFO ] After 633ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:01:17] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:01:17] [INFO ] After 213ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:01:18] [INFO ] Deduced a trap composed of 13 places in 557 ms of which 1 ms to minimize.
[2023-03-15 11:01:19] [INFO ] Deduced a trap composed of 12 places in 535 ms of which 1 ms to minimize.
[2023-03-15 11:01:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1292 ms
[2023-03-15 11:01:19] [INFO ] After 1560ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-15 11:01:19] [INFO ] After 2446ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 34 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 588/588 places, 1699/1699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 28 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-15 11:01:19] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-15 11:01:19] [INFO ] Invariant cache hit.
[2023-03-15 11:01:20] [INFO ] Implicit Places using invariants in 853 ms returned []
[2023-03-15 11:01:20] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-15 11:01:20] [INFO ] Invariant cache hit.
[2023-03-15 11:01:21] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:01:25] [INFO ] Implicit Places using invariants and state equation in 4865 ms returned []
Implicit Place search using SMT with State Equation took 5745 ms to find 0 implicit places.
[2023-03-15 11:01:25] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-15 11:01:25] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-15 11:01:25] [INFO ] Invariant cache hit.
[2023-03-15 11:01:26] [INFO ] Dead Transitions using invariants and state equation in 1314 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7164 ms. Remains : 588/588 places, 1699/1699 transitions.
Graph (trivial) has 1280 edges and 588 vertex of which 446 / 588 are part of one of the 56 SCC in 0 ms
Free SCC test removed 390 places
Drop transitions removed 780 transitions
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 1170 transitions.
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 54 Pre rules applied. Total rules applied 1 place count 198 transition count 475
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 144 transition count 475
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 113 place count 142 transition count 472
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 134 place count 128 transition count 465
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 135 place count 128 transition count 464
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 64 edges and 127 vertex of which 49 / 127 are part of one of the 6 SCC in 0 ms
Free SCC test removed 43 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 137 place count 84 transition count 464
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 49 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (trivial) has 260 edges and 79 vertex of which 35 / 79 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Iterating post reduction 2 with 56 rules applied. Total rules applied 193 place count 51 transition count 414
Drop transitions removed 140 transitions
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 308 transitions.
Iterating post reduction 3 with 308 rules applied. Total rules applied 501 place count 51 transition count 106
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 502 place count 51 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 502 place count 51 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 504 place count 50 transition count 104
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 506 place count 50 transition count 104
Applied a total of 506 rules in 21 ms. Remains 50 /588 variables (removed 538) and now considering 104/1699 (removed 1595) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 50 cols
[2023-03-15 11:01:26] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-15 11:01:26] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:01:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 11:01:26] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-15 11:01:26] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:01:26] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-15 11:01:26] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 2 factoid took 270 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 164 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-15 11:01:27] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-15 11:01:27] [INFO ] Computed 31 place invariants in 15 ms
[2023-03-15 11:01:29] [INFO ] Implicit Places using invariants in 1504 ms returned []
[2023-03-15 11:01:29] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 11:01:29] [INFO ] Invariant cache hit.
[2023-03-15 11:01:30] [INFO ] Implicit Places using invariants and state equation in 1277 ms returned []
Implicit Place search using SMT with State Equation took 2810 ms to find 0 implicit places.
[2023-03-15 11:01:30] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 11:01:30] [INFO ] Invariant cache hit.
[2023-03-15 11:01:33] [INFO ] Dead Transitions using invariants and state equation in 2706 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5692 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 287 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 372 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :2
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
Running SMT prover for 1 properties.
[2023-03-15 11:01:33] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 11:01:33] [INFO ] Invariant cache hit.
[2023-03-15 11:01:34] [INFO ] After 648ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:01:35] [INFO ] [Nat]Absence check using 23 positive place invariants in 32 ms returned sat
[2023-03-15 11:01:35] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-15 11:01:37] [INFO ] After 1985ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:01:37] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:01:37] [INFO ] After 235ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:01:39] [INFO ] Deduced a trap composed of 20 places in 2009 ms of which 2 ms to minimize.
[2023-03-15 11:01:41] [INFO ] Deduced a trap composed of 66 places in 1649 ms of which 2 ms to minimize.
[2023-03-15 11:01:43] [INFO ] Deduced a trap composed of 66 places in 1549 ms of which 2 ms to minimize.
[2023-03-15 11:01:45] [INFO ] Deduced a trap composed of 55 places in 2041 ms of which 3 ms to minimize.
[2023-03-15 11:01:47] [INFO ] Deduced a trap composed of 13 places in 1831 ms of which 1 ms to minimize.
[2023-03-15 11:01:49] [INFO ] Deduced a trap composed of 21 places in 1725 ms of which 2 ms to minimize.
[2023-03-15 11:01:51] [INFO ] Deduced a trap composed of 140 places in 1565 ms of which 2 ms to minimize.
[2023-03-15 11:01:53] [INFO ] Deduced a trap composed of 168 places in 2021 ms of which 2 ms to minimize.
[2023-03-15 11:01:55] [INFO ] Deduced a trap composed of 100 places in 1585 ms of which 2 ms to minimize.
[2023-03-15 11:01:56] [INFO ] Deduced a trap composed of 88 places in 1563 ms of which 2 ms to minimize.
[2023-03-15 11:01:58] [INFO ] Deduced a trap composed of 101 places in 1722 ms of which 1 ms to minimize.
[2023-03-15 11:02:00] [INFO ] Deduced a trap composed of 21 places in 1549 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 11:02:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 11:02:00] [INFO ] After 26365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 895 transitions
Trivial Post-agglo rules discarded 895 transitions
Performed 895 trivial Post agglomeration. Transition count delta: 895
Iterating post reduction 0 with 895 rules applied. Total rules applied 895 place count 1992 transition count 2201
Reduce places removed 895 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 896 rules applied. Total rules applied 1791 place count 1097 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 446 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1754
Deduced a syphon composed of 446 places in 1 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 3 with 892 rules applied. Total rules applied 2684 place count 650 transition count 1754
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2794 place count 595 transition count 1699
Applied a total of 2794 rules in 157 ms. Remains 595 /1992 variables (removed 1397) and now considering 1699/3096 (removed 1397) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 595/1992 places, 1699/3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 626625 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 626625 steps, saw 88545 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 11:02:04] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 595 cols
[2023-03-15 11:02:04] [INFO ] Computed 31 place invariants in 3 ms
[2023-03-15 11:02:04] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:02:04] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2023-03-15 11:02:04] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-15 11:02:05] [INFO ] After 560ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:02:05] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:02:05] [INFO ] After 214ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:02:05] [INFO ] Deduced a trap composed of 24 places in 629 ms of which 1 ms to minimize.
[2023-03-15 11:02:06] [INFO ] Deduced a trap composed of 15 places in 605 ms of which 1 ms to minimize.
[2023-03-15 11:02:07] [INFO ] Deduced a trap composed of 12 places in 595 ms of which 1 ms to minimize.
[2023-03-15 11:02:07] [INFO ] Deduced a trap composed of 31 places in 553 ms of which 1 ms to minimize.
[2023-03-15 11:02:08] [INFO ] Deduced a trap composed of 13 places in 557 ms of which 1 ms to minimize.
[2023-03-15 11:02:09] [INFO ] Deduced a trap composed of 33 places in 559 ms of which 1 ms to minimize.
[2023-03-15 11:02:09] [INFO ] Deduced a trap composed of 30 places in 358 ms of which 0 ms to minimize.
[2023-03-15 11:02:10] [INFO ] Deduced a trap composed of 11 places in 378 ms of which 0 ms to minimize.
[2023-03-15 11:02:10] [INFO ] Deduced a trap composed of 20 places in 481 ms of which 1 ms to minimize.
[2023-03-15 11:02:11] [INFO ] Deduced a trap composed of 20 places in 559 ms of which 1 ms to minimize.
[2023-03-15 11:02:11] [INFO ] Deduced a trap composed of 22 places in 592 ms of which 1 ms to minimize.
[2023-03-15 11:02:12] [INFO ] Deduced a trap composed of 25 places in 621 ms of which 1 ms to minimize.
[2023-03-15 11:02:13] [INFO ] Deduced a trap composed of 24 places in 589 ms of which 1 ms to minimize.
[2023-03-15 11:02:13] [INFO ] Deduced a trap composed of 21 places in 550 ms of which 1 ms to minimize.
[2023-03-15 11:02:14] [INFO ] Deduced a trap composed of 34 places in 526 ms of which 1 ms to minimize.
[2023-03-15 11:02:15] [INFO ] Deduced a trap composed of 22 places in 575 ms of which 1 ms to minimize.
[2023-03-15 11:02:15] [INFO ] Deduced a trap composed of 11 places in 559 ms of which 1 ms to minimize.
[2023-03-15 11:02:16] [INFO ] Deduced a trap composed of 52 places in 560 ms of which 1 ms to minimize.
[2023-03-15 11:02:17] [INFO ] Deduced a trap composed of 61 places in 504 ms of which 1 ms to minimize.
[2023-03-15 11:02:17] [INFO ] Deduced a trap composed of 83 places in 479 ms of which 1 ms to minimize.
[2023-03-15 11:02:18] [INFO ] Deduced a trap composed of 31 places in 509 ms of which 1 ms to minimize.
[2023-03-15 11:02:18] [INFO ] Deduced a trap composed of 43 places in 437 ms of which 1 ms to minimize.
[2023-03-15 11:02:19] [INFO ] Deduced a trap composed of 42 places in 473 ms of which 1 ms to minimize.
[2023-03-15 11:02:20] [INFO ] Deduced a trap composed of 51 places in 531 ms of which 1 ms to minimize.
[2023-03-15 11:02:20] [INFO ] Deduced a trap composed of 42 places in 514 ms of which 1 ms to minimize.
[2023-03-15 11:02:21] [INFO ] Deduced a trap composed of 13 places in 505 ms of which 1 ms to minimize.
[2023-03-15 11:02:21] [INFO ] Deduced a trap composed of 51 places in 492 ms of which 1 ms to minimize.
[2023-03-15 11:02:22] [INFO ] Deduced a trap composed of 12 places in 519 ms of which 2 ms to minimize.
[2023-03-15 11:02:23] [INFO ] Deduced a trap composed of 63 places in 477 ms of which 1 ms to minimize.
[2023-03-15 11:02:23] [INFO ] Deduced a trap composed of 52 places in 503 ms of which 1 ms to minimize.
[2023-03-15 11:02:24] [INFO ] Deduced a trap composed of 51 places in 506 ms of which 1 ms to minimize.
[2023-03-15 11:02:24] [INFO ] Deduced a trap composed of 20 places in 513 ms of which 1 ms to minimize.
[2023-03-15 11:02:25] [INFO ] Deduced a trap composed of 11 places in 576 ms of which 1 ms to minimize.
[2023-03-15 11:02:26] [INFO ] Deduced a trap composed of 24 places in 505 ms of which 1 ms to minimize.
[2023-03-15 11:02:26] [INFO ] Deduced a trap composed of 38 places in 515 ms of which 1 ms to minimize.
[2023-03-15 11:02:27] [INFO ] Deduced a trap composed of 42 places in 530 ms of which 1 ms to minimize.
[2023-03-15 11:02:28] [INFO ] Deduced a trap composed of 51 places in 450 ms of which 1 ms to minimize.
[2023-03-15 11:02:28] [INFO ] Deduced a trap composed of 51 places in 450 ms of which 1 ms to minimize.
[2023-03-15 11:02:29] [INFO ] Deduced a trap composed of 51 places in 449 ms of which 1 ms to minimize.
[2023-03-15 11:02:30] [INFO ] Deduced a trap composed of 2 places in 816 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 11:02:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 11:02:30] [INFO ] After 25834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1699/1699 transitions.
Applied a total of 0 rules in 42 ms. Remains 595 /595 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 595/595 places, 1699/1699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1699/1699 transitions.
Applied a total of 0 rules in 40 ms. Remains 595 /595 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-15 11:02:30] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-15 11:02:30] [INFO ] Invariant cache hit.
[2023-03-15 11:02:31] [INFO ] Implicit Places using invariants in 956 ms returned [579, 580, 581, 583, 592, 593, 594]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 968 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 588/595 places, 1699/1699 transitions.
Applied a total of 0 rules in 38 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1047 ms. Remains : 588/595 places, 1699/1699 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) 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 604863 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :{}
Probabilistic random walk after 604863 steps, saw 85760 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 11:02:34] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 588 cols
[2023-03-15 11:02:34] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-15 11:02:34] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:02:34] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-15 11:02:34] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-15 11:02:35] [INFO ] After 611ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:02:35] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:02:35] [INFO ] After 132ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:02:35] [INFO ] Deduced a trap composed of 13 places in 409 ms of which 1 ms to minimize.
[2023-03-15 11:02:36] [INFO ] Deduced a trap composed of 12 places in 541 ms of which 1 ms to minimize.
[2023-03-15 11:02:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1168 ms
[2023-03-15 11:02:36] [INFO ] After 1362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-15 11:02:36] [INFO ] After 2234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 45 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 588/588 places, 1699/1699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 44 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-15 11:02:36] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-15 11:02:36] [INFO ] Invariant cache hit.
[2023-03-15 11:02:37] [INFO ] Implicit Places using invariants in 1046 ms returned []
[2023-03-15 11:02:37] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-15 11:02:37] [INFO ] Invariant cache hit.
[2023-03-15 11:02:38] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:02:43] [INFO ] Implicit Places using invariants and state equation in 5153 ms returned []
Implicit Place search using SMT with State Equation took 6210 ms to find 0 implicit places.
[2023-03-15 11:02:43] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-15 11:02:43] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-15 11:02:43] [INFO ] Invariant cache hit.
[2023-03-15 11:02:44] [INFO ] Dead Transitions using invariants and state equation in 1416 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7731 ms. Remains : 588/588 places, 1699/1699 transitions.
Graph (trivial) has 1280 edges and 588 vertex of which 446 / 588 are part of one of the 56 SCC in 3 ms
Free SCC test removed 390 places
Drop transitions removed 780 transitions
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 1170 transitions.
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 54 Pre rules applied. Total rules applied 1 place count 198 transition count 475
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 144 transition count 475
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 113 place count 142 transition count 472
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 134 place count 128 transition count 465
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 135 place count 128 transition count 464
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 64 edges and 127 vertex of which 49 / 127 are part of one of the 6 SCC in 0 ms
Free SCC test removed 43 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 137 place count 84 transition count 464
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 49 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (trivial) has 260 edges and 79 vertex of which 35 / 79 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Iterating post reduction 2 with 56 rules applied. Total rules applied 193 place count 51 transition count 414
Drop transitions removed 140 transitions
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 308 transitions.
Iterating post reduction 3 with 308 rules applied. Total rules applied 501 place count 51 transition count 106
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 502 place count 51 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 502 place count 51 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 504 place count 50 transition count 104
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 506 place count 50 transition count 104
Applied a total of 506 rules in 20 ms. Remains 50 /588 variables (removed 538) and now considering 104/1699 (removed 1595) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 50 cols
[2023-03-15 11:02:44] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-15 11:02:44] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:02:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 11:02:44] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-15 11:02:44] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:02:44] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-15 11:02:44] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 2 factoid took 277 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 375 reset in 507 ms.
Product exploration explored 100000 steps with 416 reset in 382 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Performed 504 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 504 rules applied. Total rules applied 504 place count 1992 transition count 3096
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 399 Pre rules applied. Total rules applied 504 place count 1992 transition count 3390
Deduced a syphon composed of 903 places in 3 ms
Iterating global reduction 1 with 399 rules applied. Total rules applied 903 place count 1992 transition count 3390
Discarding 203 places :
Symmetric choice reduction at 1 with 203 rule applications. Total rules 1106 place count 1789 transition count 3187
Deduced a syphon composed of 700 places in 3 ms
Iterating global reduction 1 with 203 rules applied. Total rules applied 1309 place count 1789 transition count 3187
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1194 places in 2 ms
Iterating global reduction 1 with 494 rules applied. Total rules applied 1803 place count 1789 transition count 3187
Discarding 446 places :
Symmetric choice reduction at 1 with 446 rule applications. Total rules 2249 place count 1343 transition count 2741
Deduced a syphon composed of 748 places in 2 ms
Iterating global reduction 1 with 446 rules applied. Total rules applied 2695 place count 1343 transition count 2741
Deduced a syphon composed of 748 places in 2 ms
Applied a total of 2695 rules in 700 ms. Remains 1343 /1992 variables (removed 649) and now considering 2741/3096 (removed 355) transitions.
[2023-03-15 11:02:47] [INFO ] Redundant transitions in 129 ms returned []
[2023-03-15 11:02:47] [INFO ] Flow matrix only has 2405 transitions (discarded 336 similar events)
// Phase 1: matrix 2405 rows 1343 cols
[2023-03-15 11:02:47] [INFO ] Computed 31 place invariants in 14 ms
[2023-03-15 11:02:50] [INFO ] Dead Transitions using invariants and state equation in 2416 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1343/1992 places, 2741/3096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3262 ms. Remains : 1343/1992 places, 2741/3096 transitions.
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 98 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-15 11:02:50] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-15 11:02:50] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-15 11:02:51] [INFO ] Implicit Places using invariants in 1341 ms returned []
[2023-03-15 11:02:51] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 11:02:51] [INFO ] Invariant cache hit.
[2023-03-15 11:02:52] [INFO ] Implicit Places using invariants and state equation in 1366 ms returned []
Implicit Place search using SMT with State Equation took 2720 ms to find 0 implicit places.
[2023-03-15 11:02:52] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-15 11:02:52] [INFO ] Invariant cache hit.
[2023-03-15 11:02:56] [INFO ] Dead Transitions using invariants and state equation in 3355 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6186 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Treatment of property Peterson-PT-7-LTLFireability-14 finished in 165577 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 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1992 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 448 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 448 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1752
Deduced a syphon composed of 448 places in 2 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 2688 place count 648 transition count 1752
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2800 place count 592 transition count 1696
Applied a total of 2800 rules in 157 ms. Remains 592 /1992 variables (removed 1400) and now considering 1696/3096 (removed 1400) transitions.
[2023-03-15 11:02:56] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 592 cols
[2023-03-15 11:02:56] [INFO ] Computed 31 place invariants in 3 ms
[2023-03-15 11:02:57] [INFO ] Implicit Places using invariants in 941 ms returned [576, 577, 578, 579, 580, 590, 591]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 955 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 585/1992 places, 1696/3096 transitions.
Applied a total of 0 rules in 37 ms. Remains 585 /585 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1150 ms. Remains : 585/1992 places, 1696/3096 transitions.
Stuttering acceptance computed with spot in 43 ms :[p0]
Running random walk in product with property : Peterson-PT-7-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s453 1) (EQ s584 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 395 ms.
Stack based approach found an accepted trace after 1402 steps with 0 reset with depth 1403 and stack size 1196 in 6 ms.
FORMULA Peterson-PT-7-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-15 finished in 1616 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((X((p1||(p2 U p3)))||p0)))'
Found a Lengthening insensitive property : Peterson-PT-7-LTLFireability-11
Stuttering acceptance computed with spot in 382 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 894 transitions
Trivial Post-agglo rules discarded 894 transitions
Performed 894 trivial Post agglomeration. Transition count delta: 894
Iterating post reduction 0 with 894 rules applied. Total rules applied 894 place count 1992 transition count 2202
Reduce places removed 894 places and 0 transitions.
Iterating post reduction 1 with 894 rules applied. Total rules applied 1788 place count 1098 transition count 2202
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 446 Pre rules applied. Total rules applied 1788 place count 1098 transition count 1756
Deduced a syphon composed of 446 places in 2 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 2 with 892 rules applied. Total rules applied 2680 place count 652 transition count 1756
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2792 place count 596 transition count 1700
Applied a total of 2792 rules in 242 ms. Remains 596 /1992 variables (removed 1396) and now considering 1700/3096 (removed 1396) transitions.
[2023-03-15 11:02:58] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 596 cols
[2023-03-15 11:02:58] [INFO ] Computed 31 place invariants in 4 ms
[2023-03-15 11:02:59] [INFO ] Implicit Places using invariants in 1006 ms returned [580, 581, 582, 583, 584, 593, 594, 595]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1023 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 588/1992 places, 1700/3096 transitions.
Applied a total of 0 rules in 22 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1290 ms. Remains : 588/1992 places, 1700/3096 transitions.
Running random walk in product with property : Peterson-PT-7-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s449 0) (EQ s575 0) (EQ s521 0)), p1:(EQ s521 0), p3:(AND (EQ s555 1) (EQ s576 1)), p2:(EQ s521 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 271 ms.
Product exploration explored 100000 steps with 0 reset in 502 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p3) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 569 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 5) seen :1
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 34 ms. (steps per millisecond=294 ) 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 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-15 11:03:01] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2023-03-15 11:03:01] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-15 11:03:02] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2023-03-15 11:03:02] [INFO ] After 532ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-15 11:03:02] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2023-03-15 11:03:03] [INFO ] After 739ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-15 11:03:03] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:03:03] [INFO ] After 386ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-15 11:03:04] [INFO ] Deduced a trap composed of 48 places in 576 ms of which 1 ms to minimize.
[2023-03-15 11:03:04] [INFO ] Deduced a trap composed of 23 places in 549 ms of which 1 ms to minimize.
[2023-03-15 11:03:05] [INFO ] Deduced a trap composed of 31 places in 519 ms of which 1 ms to minimize.
[2023-03-15 11:03:06] [INFO ] Deduced a trap composed of 31 places in 556 ms of which 1 ms to minimize.
[2023-03-15 11:03:06] [INFO ] Deduced a trap composed of 31 places in 500 ms of which 1 ms to minimize.
[2023-03-15 11:03:07] [INFO ] Deduced a trap composed of 56 places in 549 ms of which 1 ms to minimize.
[2023-03-15 11:03:08] [INFO ] Deduced a trap composed of 22 places in 561 ms of which 1 ms to minimize.
[2023-03-15 11:03:08] [INFO ] Deduced a trap composed of 57 places in 567 ms of which 1 ms to minimize.
[2023-03-15 11:03:09] [INFO ] Deduced a trap composed of 45 places in 512 ms of which 1 ms to minimize.
[2023-03-15 11:03:09] [INFO ] Deduced a trap composed of 56 places in 507 ms of which 1 ms to minimize.
[2023-03-15 11:03:10] [INFO ] Deduced a trap composed of 39 places in 503 ms of which 1 ms to minimize.
[2023-03-15 11:03:11] [INFO ] Deduced a trap composed of 14 places in 507 ms of which 1 ms to minimize.
[2023-03-15 11:03:11] [INFO ] Deduced a trap composed of 13 places in 438 ms of which 1 ms to minimize.
[2023-03-15 11:03:12] [INFO ] Deduced a trap composed of 14 places in 491 ms of which 33 ms to minimize.
[2023-03-15 11:03:12] [INFO ] Deduced a trap composed of 14 places in 467 ms of which 1 ms to minimize.
[2023-03-15 11:03:13] [INFO ] Deduced a trap composed of 13 places in 455 ms of which 1 ms to minimize.
[2023-03-15 11:03:13] [INFO ] Deduced a trap composed of 22 places in 441 ms of which 1 ms to minimize.
[2023-03-15 11:03:14] [INFO ] Deduced a trap composed of 41 places in 406 ms of which 1 ms to minimize.
[2023-03-15 11:03:14] [INFO ] Deduced a trap composed of 31 places in 418 ms of which 1 ms to minimize.
[2023-03-15 11:03:15] [INFO ] Deduced a trap composed of 80 places in 395 ms of which 1 ms to minimize.
[2023-03-15 11:03:15] [INFO ] Deduced a trap composed of 40 places in 379 ms of which 0 ms to minimize.
[2023-03-15 11:03:16] [INFO ] Deduced a trap composed of 24 places in 397 ms of which 1 ms to minimize.
[2023-03-15 11:03:16] [INFO ] Deduced a trap composed of 14 places in 424 ms of which 1 ms to minimize.
[2023-03-15 11:03:17] [INFO ] Deduced a trap composed of 32 places in 433 ms of which 1 ms to minimize.
[2023-03-15 11:03:17] [INFO ] Deduced a trap composed of 41 places in 403 ms of which 1 ms to minimize.
[2023-03-15 11:03:18] [INFO ] Deduced a trap composed of 24 places in 394 ms of which 1 ms to minimize.
[2023-03-15 11:03:18] [INFO ] Deduced a trap composed of 25 places in 370 ms of which 0 ms to minimize.
[2023-03-15 11:03:19] [INFO ] Deduced a trap composed of 12 places in 446 ms of which 1 ms to minimize.
[2023-03-15 11:03:19] [INFO ] Deduced a trap composed of 22 places in 411 ms of which 1 ms to minimize.
[2023-03-15 11:03:20] [INFO ] Deduced a trap composed of 55 places in 365 ms of which 0 ms to minimize.
[2023-03-15 11:03:20] [INFO ] Deduced a trap composed of 30 places in 382 ms of which 1 ms to minimize.
[2023-03-15 11:03:20] [INFO ] Deduced a trap composed of 39 places in 382 ms of which 0 ms to minimize.
[2023-03-15 11:03:21] [INFO ] Deduced a trap composed of 64 places in 360 ms of which 1 ms to minimize.
[2023-03-15 11:03:21] [INFO ] Deduced a trap composed of 65 places in 377 ms of which 1 ms to minimize.
[2023-03-15 11:03:22] [INFO ] Deduced a trap composed of 74 places in 352 ms of which 1 ms to minimize.
[2023-03-15 11:03:22] [INFO ] Deduced a trap composed of 66 places in 372 ms of which 1 ms to minimize.
[2023-03-15 11:03:23] [INFO ] Deduced a trap composed of 65 places in 355 ms of which 1 ms to minimize.
[2023-03-15 11:03:23] [INFO ] Deduced a trap composed of 65 places in 356 ms of which 1 ms to minimize.
[2023-03-15 11:03:24] [INFO ] Deduced a trap composed of 96 places in 417 ms of which 1 ms to minimize.
[2023-03-15 11:03:24] [INFO ] Deduced a trap composed of 21 places in 370 ms of which 1 ms to minimize.
[2023-03-15 11:03:24] [INFO ] Deduced a trap composed of 23 places in 382 ms of which 1 ms to minimize.
[2023-03-15 11:03:25] [INFO ] Deduced a trap composed of 75 places in 355 ms of which 1 ms to minimize.
[2023-03-15 11:03:25] [INFO ] Deduced a trap composed of 58 places in 315 ms of which 1 ms to minimize.
[2023-03-15 11:03:26] [INFO ] Deduced a trap composed of 66 places in 422 ms of which 0 ms to minimize.
[2023-03-15 11:03:26] [INFO ] Deduced a trap composed of 54 places in 413 ms of which 1 ms to minimize.
[2023-03-15 11:03:27] [INFO ] Deduced a trap composed of 45 places in 412 ms of which 1 ms to minimize.
[2023-03-15 11:03:27] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 23642 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 11:03:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 11:03:27] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 36 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 588/588 places, 1700/1700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 444195 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 444195 steps, saw 64067 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-15 11:03:30] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-15 11:03:30] [INFO ] Invariant cache hit.
[2023-03-15 11:03:30] [INFO ] [Real]Absence check using 23 positive place invariants in 17 ms returned sat
[2023-03-15 11:03:31] [INFO ] After 662ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-15 11:03:31] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:03:31] [INFO ] After 150ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 11:03:31] [INFO ] After 1050ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 11:03:32] [INFO ] [Nat]Absence check using 23 positive place invariants in 26 ms returned sat
[2023-03-15 11:03:32] [INFO ] After 487ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 11:03:33] [INFO ] After 319ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 11:03:33] [INFO ] Deduced a trap composed of 31 places in 606 ms of which 1 ms to minimize.
[2023-03-15 11:03:34] [INFO ] Deduced a trap composed of 30 places in 383 ms of which 0 ms to minimize.
[2023-03-15 11:03:34] [INFO ] Deduced a trap composed of 13 places in 579 ms of which 1 ms to minimize.
[2023-03-15 11:03:35] [INFO ] Deduced a trap composed of 14 places in 394 ms of which 1 ms to minimize.
[2023-03-15 11:03:35] [INFO ] Deduced a trap composed of 40 places in 562 ms of which 1 ms to minimize.
[2023-03-15 11:03:36] [INFO ] Deduced a trap composed of 31 places in 526 ms of which 1 ms to minimize.
[2023-03-15 11:03:36] [INFO ] Deduced a trap composed of 20 places in 516 ms of which 1 ms to minimize.
[2023-03-15 11:03:37] [INFO ] Deduced a trap composed of 14 places in 508 ms of which 1 ms to minimize.
[2023-03-15 11:03:38] [INFO ] Deduced a trap composed of 44 places in 494 ms of which 1 ms to minimize.
[2023-03-15 11:03:38] [INFO ] Deduced a trap composed of 22 places in 487 ms of which 0 ms to minimize.
[2023-03-15 11:03:39] [INFO ] Deduced a trap composed of 25 places in 347 ms of which 1 ms to minimize.
[2023-03-15 11:03:39] [INFO ] Deduced a trap composed of 13 places in 419 ms of which 1 ms to minimize.
[2023-03-15 11:03:40] [INFO ] Deduced a trap composed of 22 places in 420 ms of which 0 ms to minimize.
[2023-03-15 11:03:40] [INFO ] Deduced a trap composed of 24 places in 431 ms of which 1 ms to minimize.
[2023-03-15 11:03:41] [INFO ] Deduced a trap composed of 15 places in 480 ms of which 1 ms to minimize.
[2023-03-15 11:03:41] [INFO ] Deduced a trap composed of 22 places in 449 ms of which 1 ms to minimize.
[2023-03-15 11:03:42] [INFO ] Deduced a trap composed of 13 places in 467 ms of which 0 ms to minimize.
[2023-03-15 11:03:42] [INFO ] Deduced a trap composed of 32 places in 409 ms of which 0 ms to minimize.
[2023-03-15 11:03:43] [INFO ] Deduced a trap composed of 41 places in 366 ms of which 1 ms to minimize.
[2023-03-15 11:03:43] [INFO ] Deduced a trap composed of 11 places in 415 ms of which 1 ms to minimize.
[2023-03-15 11:03:44] [INFO ] Deduced a trap composed of 12 places in 461 ms of which 1 ms to minimize.
[2023-03-15 11:03:44] [INFO ] Deduced a trap composed of 40 places in 425 ms of which 1 ms to minimize.
[2023-03-15 11:03:45] [INFO ] Deduced a trap composed of 25 places in 409 ms of which 0 ms to minimize.
[2023-03-15 11:03:45] [INFO ] Deduced a trap composed of 35 places in 457 ms of which 1 ms to minimize.
[2023-03-15 11:03:46] [INFO ] Deduced a trap composed of 23 places in 404 ms of which 1 ms to minimize.
[2023-03-15 11:03:46] [INFO ] Deduced a trap composed of 40 places in 378 ms of which 1 ms to minimize.
[2023-03-15 11:03:47] [INFO ] Deduced a trap composed of 55 places in 476 ms of which 1 ms to minimize.
[2023-03-15 11:03:47] [INFO ] Deduced a trap composed of 19 places in 438 ms of which 1 ms to minimize.
[2023-03-15 11:03:48] [INFO ] Deduced a trap composed of 65 places in 374 ms of which 0 ms to minimize.
[2023-03-15 11:03:48] [INFO ] Deduced a trap composed of 48 places in 383 ms of which 1 ms to minimize.
[2023-03-15 11:03:49] [INFO ] Deduced a trap composed of 58 places in 364 ms of which 0 ms to minimize.
[2023-03-15 11:03:49] [INFO ] Deduced a trap composed of 77 places in 354 ms of which 1 ms to minimize.
[2023-03-15 11:03:49] [INFO ] Deduced a trap composed of 67 places in 380 ms of which 1 ms to minimize.
[2023-03-15 11:03:50] [INFO ] Deduced a trap composed of 58 places in 402 ms of which 1 ms to minimize.
[2023-03-15 11:03:50] [INFO ] Deduced a trap composed of 64 places in 410 ms of which 1 ms to minimize.
[2023-03-15 11:03:51] [INFO ] Deduced a trap composed of 12 places in 477 ms of which 1 ms to minimize.
[2023-03-15 11:03:51] [INFO ] Deduced a trap composed of 58 places in 403 ms of which 1 ms to minimize.
[2023-03-15 11:03:52] [INFO ] Deduced a trap composed of 57 places in 494 ms of which 1 ms to minimize.
[2023-03-15 11:03:53] [INFO ] Deduced a trap composed of 40 places in 441 ms of which 1 ms to minimize.
[2023-03-15 11:03:53] [INFO ] Deduced a trap composed of 22 places in 482 ms of which 1 ms to minimize.
[2023-03-15 11:03:54] [INFO ] Deduced a trap composed of 29 places in 449 ms of which 1 ms to minimize.
[2023-03-15 11:03:54] [INFO ] Deduced a trap composed of 24 places in 450 ms of which 1 ms to minimize.
[2023-03-15 11:03:55] [INFO ] Deduced a trap composed of 30 places in 464 ms of which 1 ms to minimize.
[2023-03-15 11:03:55] [INFO ] Deduced a trap composed of 48 places in 351 ms of which 1 ms to minimize.
[2023-03-15 11:03:56] [INFO ] Deduced a trap composed of 55 places in 338 ms of which 1 ms to minimize.
[2023-03-15 11:03:56] [INFO ] Deduced a trap composed of 55 places in 357 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 11:03:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 11:03:56] [INFO ] After 25181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 36 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 588/588 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 36 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-15 11:03:56] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-15 11:03:56] [INFO ] Invariant cache hit.
[2023-03-15 11:03:57] [INFO ] Implicit Places using invariants in 797 ms returned []
[2023-03-15 11:03:57] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-15 11:03:57] [INFO ] Invariant cache hit.
[2023-03-15 11:03:58] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:04:02] [INFO ] Implicit Places using invariants and state equation in 4413 ms returned []
Implicit Place search using SMT with State Equation took 5253 ms to find 0 implicit places.
[2023-03-15 11:04:02] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-15 11:04:02] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-15 11:04:02] [INFO ] Invariant cache hit.
[2023-03-15 11:04:03] [INFO ] Dead Transitions using invariants and state equation in 1255 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6605 ms. Remains : 588/588 places, 1700/1700 transitions.
Graph (trivial) has 1287 edges and 588 vertex of which 445 / 588 are part of one of the 56 SCC in 0 ms
Free SCC test removed 389 places
Drop transitions removed 778 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1169 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 199 transition count 476
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 144 transition count 476
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 117 place count 141 transition count 471
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 23 rules applied. Total rules applied 140 place count 126 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 63 edges and 126 vertex of which 48 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 42 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 142 place count 84 transition count 470
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (trivial) has 255 edges and 79 vertex of which 35 / 79 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Iterating post reduction 1 with 54 rules applied. Total rules applied 196 place count 51 transition count 422
Drop transitions removed 140 transitions
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 312 transitions.
Iterating post reduction 2 with 312 rules applied. Total rules applied 508 place count 51 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 510 place count 50 transition count 109
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 514 place count 50 transition count 105
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 515 place count 50 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 516 place count 49 transition count 104
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 518 place count 49 transition count 104
Applied a total of 518 rules in 27 ms. Remains 49 /588 variables (removed 539) and now considering 104/1700 (removed 1596) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 104 rows 49 cols
[2023-03-15 11:04:03] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-15 11:04:03] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 11:04:03] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 11:04:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 11:04:03] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 11:04:03] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-15 11:04:03] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p3) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 7 factoid took 364 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 25 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-15 11:04:04] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2023-03-15 11:04:04] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-15 11:04:05] [INFO ] Implicit Places using invariants in 1046 ms returned []
[2023-03-15 11:04:05] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-15 11:04:05] [INFO ] Invariant cache hit.
[2023-03-15 11:04:06] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:04:09] [INFO ] Implicit Places using invariants and state equation in 4283 ms returned []
Implicit Place search using SMT with State Equation took 5358 ms to find 0 implicit places.
[2023-03-15 11:04:09] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-15 11:04:09] [INFO ] Invariant cache hit.
[2023-03-15 11:04:11] [INFO ] Dead Transitions using invariants and state equation in 1407 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6799 ms. Remains : 588/588 places, 1700/1700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 266 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 11:04:11] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-15 11:04:11] [INFO ] Invariant cache hit.
[2023-03-15 11:04:12] [INFO ] [Real]Absence check using 23 positive place invariants in 31 ms returned sat
[2023-03-15 11:04:12] [INFO ] After 439ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-15 11:04:12] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:04:13] [INFO ] After 99ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 11:04:13] [INFO ] After 1087ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 11:04:13] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2023-03-15 11:04:13] [INFO ] After 602ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 11:04:14] [INFO ] After 232ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 11:04:14] [INFO ] Deduced a trap composed of 31 places in 575 ms of which 0 ms to minimize.
[2023-03-15 11:04:15] [INFO ] Deduced a trap composed of 30 places in 386 ms of which 1 ms to minimize.
[2023-03-15 11:04:15] [INFO ] Deduced a trap composed of 13 places in 375 ms of which 1 ms to minimize.
[2023-03-15 11:04:16] [INFO ] Deduced a trap composed of 14 places in 597 ms of which 1 ms to minimize.
[2023-03-15 11:04:16] [INFO ] Deduced a trap composed of 40 places in 516 ms of which 1 ms to minimize.
[2023-03-15 11:04:17] [INFO ] Deduced a trap composed of 31 places in 542 ms of which 1 ms to minimize.
[2023-03-15 11:04:18] [INFO ] Deduced a trap composed of 20 places in 601 ms of which 1 ms to minimize.
[2023-03-15 11:04:18] [INFO ] Deduced a trap composed of 14 places in 570 ms of which 2 ms to minimize.
[2023-03-15 11:04:19] [INFO ] Deduced a trap composed of 44 places in 570 ms of which 1 ms to minimize.
[2023-03-15 11:04:20] [INFO ] Deduced a trap composed of 22 places in 555 ms of which 1 ms to minimize.
[2023-03-15 11:04:20] [INFO ] Deduced a trap composed of 25 places in 552 ms of which 1 ms to minimize.
[2023-03-15 11:04:21] [INFO ] Deduced a trap composed of 13 places in 526 ms of which 1 ms to minimize.
[2023-03-15 11:04:21] [INFO ] Deduced a trap composed of 22 places in 524 ms of which 1 ms to minimize.
[2023-03-15 11:04:22] [INFO ] Deduced a trap composed of 24 places in 513 ms of which 1 ms to minimize.
[2023-03-15 11:04:23] [INFO ] Deduced a trap composed of 15 places in 539 ms of which 1 ms to minimize.
[2023-03-15 11:04:23] [INFO ] Deduced a trap composed of 22 places in 576 ms of which 1 ms to minimize.
[2023-03-15 11:04:24] [INFO ] Deduced a trap composed of 13 places in 523 ms of which 1 ms to minimize.
[2023-03-15 11:04:25] [INFO ] Deduced a trap composed of 32 places in 470 ms of which 1 ms to minimize.
[2023-03-15 11:04:25] [INFO ] Deduced a trap composed of 41 places in 473 ms of which 1 ms to minimize.
[2023-03-15 11:04:26] [INFO ] Deduced a trap composed of 11 places in 508 ms of which 1 ms to minimize.
[2023-03-15 11:04:26] [INFO ] Deduced a trap composed of 12 places in 569 ms of which 1 ms to minimize.
[2023-03-15 11:04:27] [INFO ] Deduced a trap composed of 40 places in 561 ms of which 1 ms to minimize.
[2023-03-15 11:04:28] [INFO ] Deduced a trap composed of 25 places in 535 ms of which 1 ms to minimize.
[2023-03-15 11:04:28] [INFO ] Deduced a trap composed of 35 places in 491 ms of which 1 ms to minimize.
[2023-03-15 11:04:29] [INFO ] Deduced a trap composed of 23 places in 469 ms of which 1 ms to minimize.
[2023-03-15 11:04:29] [INFO ] Deduced a trap composed of 40 places in 457 ms of which 1 ms to minimize.
[2023-03-15 11:04:30] [INFO ] Deduced a trap composed of 55 places in 498 ms of which 1 ms to minimize.
[2023-03-15 11:04:31] [INFO ] Deduced a trap composed of 19 places in 549 ms of which 1 ms to minimize.
[2023-03-15 11:04:31] [INFO ] Deduced a trap composed of 65 places in 415 ms of which 1 ms to minimize.
[2023-03-15 11:04:32] [INFO ] Deduced a trap composed of 48 places in 389 ms of which 1 ms to minimize.
[2023-03-15 11:04:32] [INFO ] Deduced a trap composed of 58 places in 412 ms of which 1 ms to minimize.
[2023-03-15 11:04:33] [INFO ] Deduced a trap composed of 77 places in 409 ms of which 0 ms to minimize.
[2023-03-15 11:04:33] [INFO ] Deduced a trap composed of 67 places in 440 ms of which 1 ms to minimize.
[2023-03-15 11:04:34] [INFO ] Deduced a trap composed of 58 places in 453 ms of which 1 ms to minimize.
[2023-03-15 11:04:34] [INFO ] Deduced a trap composed of 64 places in 459 ms of which 1 ms to minimize.
[2023-03-15 11:04:35] [INFO ] Deduced a trap composed of 12 places in 499 ms of which 1 ms to minimize.
[2023-03-15 11:04:35] [INFO ] Deduced a trap composed of 58 places in 432 ms of which 1 ms to minimize.
[2023-03-15 11:04:36] [INFO ] Deduced a trap composed of 57 places in 613 ms of which 1 ms to minimize.
[2023-03-15 11:04:37] [INFO ] Deduced a trap composed of 40 places in 517 ms of which 1 ms to minimize.
[2023-03-15 11:04:37] [INFO ] Deduced a trap composed of 22 places in 522 ms of which 1 ms to minimize.
[2023-03-15 11:04:38] [INFO ] Deduced a trap composed of 29 places in 557 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 11:04:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 11:04:38] [INFO ] After 25498ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 45 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 588/588 places, 1700/1700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 424323 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 424323 steps, saw 64057 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-15 11:04:41] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-15 11:04:41] [INFO ] Invariant cache hit.
[2023-03-15 11:04:42] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2023-03-15 11:04:42] [INFO ] After 585ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-15 11:04:42] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:04:42] [INFO ] After 162ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 11:04:42] [INFO ] After 958ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 11:04:43] [INFO ] [Nat]Absence check using 23 positive place invariants in 17 ms returned sat
[2023-03-15 11:04:43] [INFO ] After 708ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 11:04:44] [INFO ] After 196ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 11:04:44] [INFO ] Deduced a trap composed of 31 places in 446 ms of which 1 ms to minimize.
[2023-03-15 11:04:45] [INFO ] Deduced a trap composed of 30 places in 512 ms of which 1 ms to minimize.
[2023-03-15 11:04:45] [INFO ] Deduced a trap composed of 13 places in 463 ms of which 5 ms to minimize.
[2023-03-15 11:04:46] [INFO ] Deduced a trap composed of 14 places in 471 ms of which 1 ms to minimize.
[2023-03-15 11:04:46] [INFO ] Deduced a trap composed of 40 places in 435 ms of which 1 ms to minimize.
[2023-03-15 11:04:47] [INFO ] Deduced a trap composed of 31 places in 416 ms of which 1 ms to minimize.
[2023-03-15 11:04:47] [INFO ] Deduced a trap composed of 20 places in 448 ms of which 1 ms to minimize.
[2023-03-15 11:04:48] [INFO ] Deduced a trap composed of 14 places in 442 ms of which 1 ms to minimize.
[2023-03-15 11:04:48] [INFO ] Deduced a trap composed of 44 places in 415 ms of which 1 ms to minimize.
[2023-03-15 11:04:49] [INFO ] Deduced a trap composed of 22 places in 428 ms of which 1 ms to minimize.
[2023-03-15 11:04:49] [INFO ] Deduced a trap composed of 25 places in 398 ms of which 1 ms to minimize.
[2023-03-15 11:04:50] [INFO ] Deduced a trap composed of 13 places in 478 ms of which 1 ms to minimize.
[2023-03-15 11:04:50] [INFO ] Deduced a trap composed of 22 places in 405 ms of which 1 ms to minimize.
[2023-03-15 11:04:51] [INFO ] Deduced a trap composed of 24 places in 415 ms of which 1 ms to minimize.
[2023-03-15 11:04:51] [INFO ] Deduced a trap composed of 15 places in 458 ms of which 0 ms to minimize.
[2023-03-15 11:04:52] [INFO ] Deduced a trap composed of 22 places in 414 ms of which 1 ms to minimize.
[2023-03-15 11:04:52] [INFO ] Deduced a trap composed of 13 places in 449 ms of which 1 ms to minimize.
[2023-03-15 11:04:53] [INFO ] Deduced a trap composed of 32 places in 432 ms of which 1 ms to minimize.
[2023-03-15 11:04:53] [INFO ] Deduced a trap composed of 41 places in 375 ms of which 1 ms to minimize.
[2023-03-15 11:04:54] [INFO ] Deduced a trap composed of 11 places in 440 ms of which 1 ms to minimize.
[2023-03-15 11:04:54] [INFO ] Deduced a trap composed of 12 places in 505 ms of which 1 ms to minimize.
[2023-03-15 11:04:55] [INFO ] Deduced a trap composed of 40 places in 448 ms of which 1 ms to minimize.
[2023-03-15 11:04:55] [INFO ] Deduced a trap composed of 25 places in 411 ms of which 1 ms to minimize.
[2023-03-15 11:04:56] [INFO ] Deduced a trap composed of 35 places in 411 ms of which 1 ms to minimize.
[2023-03-15 11:04:56] [INFO ] Deduced a trap composed of 23 places in 443 ms of which 1 ms to minimize.
[2023-03-15 11:04:57] [INFO ] Deduced a trap composed of 40 places in 431 ms of which 0 ms to minimize.
[2023-03-15 11:04:57] [INFO ] Deduced a trap composed of 55 places in 473 ms of which 1 ms to minimize.
[2023-03-15 11:04:58] [INFO ] Deduced a trap composed of 19 places in 515 ms of which 1 ms to minimize.
[2023-03-15 11:04:58] [INFO ] Deduced a trap composed of 65 places in 401 ms of which 1 ms to minimize.
[2023-03-15 11:04:59] [INFO ] Deduced a trap composed of 48 places in 388 ms of which 0 ms to minimize.
[2023-03-15 11:04:59] [INFO ] Deduced a trap composed of 58 places in 381 ms of which 1 ms to minimize.
[2023-03-15 11:05:00] [INFO ] Deduced a trap composed of 77 places in 369 ms of which 1 ms to minimize.
[2023-03-15 11:05:00] [INFO ] Deduced a trap composed of 67 places in 385 ms of which 1 ms to minimize.
[2023-03-15 11:05:01] [INFO ] Deduced a trap composed of 58 places in 367 ms of which 1 ms to minimize.
[2023-03-15 11:05:01] [INFO ] Deduced a trap composed of 64 places in 382 ms of which 1 ms to minimize.
[2023-03-15 11:05:02] [INFO ] Deduced a trap composed of 12 places in 459 ms of which 1 ms to minimize.
[2023-03-15 11:05:02] [INFO ] Deduced a trap composed of 58 places in 385 ms of which 1 ms to minimize.
[2023-03-15 11:05:03] [INFO ] Deduced a trap composed of 57 places in 504 ms of which 1 ms to minimize.
[2023-03-15 11:05:04] [INFO ] Deduced a trap composed of 40 places in 476 ms of which 1 ms to minimize.
[2023-03-15 11:05:04] [INFO ] Deduced a trap composed of 22 places in 435 ms of which 1 ms to minimize.
[2023-03-15 11:05:04] [INFO ] Deduced a trap composed of 29 places in 411 ms of which 1 ms to minimize.
[2023-03-15 11:05:05] [INFO ] Deduced a trap composed of 24 places in 489 ms of which 1 ms to minimize.
[2023-03-15 11:05:06] [INFO ] Deduced a trap composed of 30 places in 490 ms of which 1 ms to minimize.
[2023-03-15 11:05:06] [INFO ] Deduced a trap composed of 48 places in 351 ms of which 1 ms to minimize.
[2023-03-15 11:05:07] [INFO ] Deduced a trap composed of 55 places in 341 ms of which 1 ms to minimize.
[2023-03-15 11:05:07] [INFO ] Deduced a trap composed of 55 places in 355 ms of which 1 ms to minimize.
[2023-03-15 11:05:08] [INFO ] Deduced a trap composed of 31 places in 351 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 11:05:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 11:05:08] [INFO ] After 25295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 27 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 588/588 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 27 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-15 11:05:08] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-15 11:05:08] [INFO ] Invariant cache hit.
[2023-03-15 11:05:09] [INFO ] Implicit Places using invariants in 1005 ms returned []
[2023-03-15 11:05:09] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-15 11:05:09] [INFO ] Invariant cache hit.
[2023-03-15 11:05:09] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:05:14] [INFO ] Implicit Places using invariants and state equation in 5038 ms returned []
Implicit Place search using SMT with State Equation took 6084 ms to find 0 implicit places.
[2023-03-15 11:05:14] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-15 11:05:14] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-15 11:05:14] [INFO ] Invariant cache hit.
[2023-03-15 11:05:15] [INFO ] Dead Transitions using invariants and state equation in 1254 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7427 ms. Remains : 588/588 places, 1700/1700 transitions.
Graph (trivial) has 1287 edges and 588 vertex of which 445 / 588 are part of one of the 56 SCC in 0 ms
Free SCC test removed 389 places
Drop transitions removed 778 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1169 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 199 transition count 476
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 144 transition count 476
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 117 place count 141 transition count 471
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 23 rules applied. Total rules applied 140 place count 126 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 63 edges and 126 vertex of which 48 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 42 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 142 place count 84 transition count 470
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (trivial) has 255 edges and 79 vertex of which 35 / 79 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Iterating post reduction 1 with 54 rules applied. Total rules applied 196 place count 51 transition count 422
Drop transitions removed 140 transitions
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 312 transitions.
Iterating post reduction 2 with 312 rules applied. Total rules applied 508 place count 51 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 510 place count 50 transition count 109
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 514 place count 50 transition count 105
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 515 place count 50 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 516 place count 49 transition count 104
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 518 place count 49 transition count 104
Applied a total of 518 rules in 17 ms. Remains 49 /588 variables (removed 539) and now considering 104/1700 (removed 1596) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 104 rows 49 cols
[2023-03-15 11:05:15] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 11:05:15] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 11:05:15] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 11:05:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 11:05:15] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 11:05:15] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-15 11:05:15] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 4 factoid took 287 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Product exploration explored 100000 steps with 0 reset in 427 ms.
Product exploration explored 100000 steps with 0 reset in 348 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 47 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-15 11:05:17] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-15 11:05:17] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2023-03-15 11:05:17] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-15 11:05:19] [INFO ] Dead Transitions using invariants and state equation in 1411 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1543 ms. Remains : 588/588 places, 1700/1700 transitions.
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 15 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-15 11:05:19] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-15 11:05:19] [INFO ] Invariant cache hit.
[2023-03-15 11:05:20] [INFO ] Implicit Places using invariants in 758 ms returned []
[2023-03-15 11:05:20] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-15 11:05:20] [INFO ] Invariant cache hit.
[2023-03-15 11:05:20] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:05:24] [INFO ] Implicit Places using invariants and state equation in 4668 ms returned []
Implicit Place search using SMT with State Equation took 5457 ms to find 0 implicit places.
[2023-03-15 11:05:24] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-15 11:05:24] [INFO ] Invariant cache hit.
[2023-03-15 11:05:26] [INFO ] Dead Transitions using invariants and state equation in 1439 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6931 ms. Remains : 588/588 places, 1700/1700 transitions.
Treatment of property Peterson-PT-7-LTLFireability-11 finished in 148202 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(F((p0||G(F(p1))||G(p2))))))'
Found a Shortening insensitive property : Peterson-PT-7-LTLFireability-14
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 895 transitions
Trivial Post-agglo rules discarded 895 transitions
Performed 895 trivial Post agglomeration. Transition count delta: 895
Iterating post reduction 0 with 895 rules applied. Total rules applied 895 place count 1992 transition count 2201
Reduce places removed 895 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 896 rules applied. Total rules applied 1791 place count 1097 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 446 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1754
Deduced a syphon composed of 446 places in 1 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 3 with 892 rules applied. Total rules applied 2684 place count 650 transition count 1754
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2794 place count 595 transition count 1699
Applied a total of 2794 rules in 276 ms. Remains 595 /1992 variables (removed 1397) and now considering 1699/3096 (removed 1397) transitions.
[2023-03-15 11:05:26] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 595 cols
[2023-03-15 11:05:26] [INFO ] Computed 31 place invariants in 4 ms
[2023-03-15 11:05:27] [INFO ] Implicit Places using invariants in 1070 ms returned [579, 580, 581, 583, 592, 593, 594]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1080 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 588/1992 places, 1699/3096 transitions.
Applied a total of 0 rules in 22 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1380 ms. Remains : 588/1992 places, 1699/3096 transitions.
Running random walk in product with property : Peterson-PT-7-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s464 1) (EQ s579 1)), p2:(EQ s275 0), p1:(EQ s370 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 634 reset in 370 ms.
Product exploration explored 100000 steps with 741 reset in 425 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 11:05:29] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 588 cols
[2023-03-15 11:05:29] [INFO ] Computed 24 place invariants in 4 ms
[2023-03-15 11:05:29] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:05:29] [INFO ] [Nat]Absence check using 23 positive place invariants in 18 ms returned sat
[2023-03-15 11:05:29] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-15 11:05:30] [INFO ] After 613ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:05:30] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:05:30] [INFO ] After 132ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:05:30] [INFO ] Deduced a trap composed of 13 places in 381 ms of which 1 ms to minimize.
[2023-03-15 11:05:31] [INFO ] Deduced a trap composed of 12 places in 435 ms of which 1 ms to minimize.
[2023-03-15 11:05:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1000 ms
[2023-03-15 11:05:31] [INFO ] After 1185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-15 11:05:31] [INFO ] After 2146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 35 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 588/588 places, 1699/1699 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) 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
Interrupted probabilistic random walk after 588204 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 588204 steps, saw 83863 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 11:05:34] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-15 11:05:34] [INFO ] Invariant cache hit.
[2023-03-15 11:05:34] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:05:35] [INFO ] [Nat]Absence check using 23 positive place invariants in 16 ms returned sat
[2023-03-15 11:05:35] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-15 11:05:35] [INFO ] After 605ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:05:35] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:05:35] [INFO ] After 153ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:05:36] [INFO ] Deduced a trap composed of 13 places in 452 ms of which 2 ms to minimize.
[2023-03-15 11:05:37] [INFO ] Deduced a trap composed of 12 places in 597 ms of which 1 ms to minimize.
[2023-03-15 11:05:37] [INFO ] Deduced a trap composed of 33 places in 595 ms of which 1 ms to minimize.
[2023-03-15 11:05:38] [INFO ] Deduced a trap composed of 30 places in 373 ms of which 1 ms to minimize.
[2023-03-15 11:05:38] [INFO ] Deduced a trap composed of 31 places in 400 ms of which 1 ms to minimize.
[2023-03-15 11:05:39] [INFO ] Deduced a trap composed of 34 places in 599 ms of which 1 ms to minimize.
[2023-03-15 11:05:39] [INFO ] Deduced a trap composed of 24 places in 563 ms of which 1 ms to minimize.
[2023-03-15 11:05:40] [INFO ] Deduced a trap composed of 22 places in 593 ms of which 1 ms to minimize.
[2023-03-15 11:05:41] [INFO ] Deduced a trap composed of 22 places in 574 ms of which 0 ms to minimize.
[2023-03-15 11:05:41] [INFO ] Deduced a trap composed of 21 places in 368 ms of which 1 ms to minimize.
[2023-03-15 11:05:42] [INFO ] Deduced a trap composed of 12 places in 384 ms of which 1 ms to minimize.
[2023-03-15 11:05:42] [INFO ] Deduced a trap composed of 12 places in 555 ms of which 1 ms to minimize.
[2023-03-15 11:05:43] [INFO ] Deduced a trap composed of 12 places in 522 ms of which 1 ms to minimize.
[2023-03-15 11:05:43] [INFO ] Deduced a trap composed of 79 places in 497 ms of which 1 ms to minimize.
[2023-03-15 11:05:44] [INFO ] Deduced a trap composed of 60 places in 536 ms of which 1 ms to minimize.
[2023-03-15 11:05:45] [INFO ] Deduced a trap composed of 51 places in 576 ms of which 1 ms to minimize.
[2023-03-15 11:05:45] [INFO ] Deduced a trap composed of 26 places in 535 ms of which 1 ms to minimize.
[2023-03-15 11:05:46] [INFO ] Deduced a trap composed of 30 places in 480 ms of which 1 ms to minimize.
[2023-03-15 11:05:47] [INFO ] Deduced a trap composed of 24 places in 625 ms of which 1 ms to minimize.
[2023-03-15 11:05:47] [INFO ] Deduced a trap composed of 16 places in 570 ms of which 1 ms to minimize.
[2023-03-15 11:05:48] [INFO ] Deduced a trap composed of 64 places in 562 ms of which 1 ms to minimize.
[2023-03-15 11:05:49] [INFO ] Deduced a trap composed of 15 places in 544 ms of which 1 ms to minimize.
[2023-03-15 11:05:49] [INFO ] Deduced a trap composed of 75 places in 532 ms of which 1 ms to minimize.
[2023-03-15 11:05:50] [INFO ] Deduced a trap composed of 15 places in 521 ms of which 1 ms to minimize.
[2023-03-15 11:05:50] [INFO ] Deduced a trap composed of 42 places in 532 ms of which 1 ms to minimize.
[2023-03-15 11:05:51] [INFO ] Deduced a trap composed of 31 places in 532 ms of which 1 ms to minimize.
[2023-03-15 11:05:52] [INFO ] Deduced a trap composed of 60 places in 487 ms of which 1 ms to minimize.
[2023-03-15 11:05:52] [INFO ] Deduced a trap composed of 63 places in 448 ms of which 1 ms to minimize.
[2023-03-15 11:05:53] [INFO ] Deduced a trap composed of 51 places in 420 ms of which 1 ms to minimize.
[2023-03-15 11:05:53] [INFO ] Deduced a trap composed of 43 places in 450 ms of which 1 ms to minimize.
[2023-03-15 11:05:54] [INFO ] Deduced a trap composed of 42 places in 451 ms of which 1 ms to minimize.
[2023-03-15 11:05:54] [INFO ] Deduced a trap composed of 42 places in 439 ms of which 1 ms to minimize.
[2023-03-15 11:05:55] [INFO ] Deduced a trap composed of 52 places in 503 ms of which 1 ms to minimize.
[2023-03-15 11:05:55] [INFO ] Deduced a trap composed of 50 places in 486 ms of which 1 ms to minimize.
[2023-03-15 11:05:56] [INFO ] Deduced a trap composed of 63 places in 447 ms of which 1 ms to minimize.
[2023-03-15 11:05:57] [INFO ] Deduced a trap composed of 65 places in 448 ms of which 1 ms to minimize.
[2023-03-15 11:05:57] [INFO ] Deduced a trap composed of 62 places in 444 ms of which 1 ms to minimize.
[2023-03-15 11:05:58] [INFO ] Deduced a trap composed of 41 places in 528 ms of which 1 ms to minimize.
[2023-03-15 11:05:59] [INFO ] Deduced a trap composed of 17 places in 481 ms of which 1 ms to minimize.
[2023-03-15 11:05:59] [INFO ] Deduced a trap composed of 31 places in 441 ms of which 1 ms to minimize.
[2023-03-15 11:06:00] [INFO ] Deduced a trap composed of 22 places in 458 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 11:06:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 11:06:00] [INFO ] After 25252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 37 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 588/588 places, 1699/1699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 37 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-15 11:06:00] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-15 11:06:00] [INFO ] Invariant cache hit.
[2023-03-15 11:06:01] [INFO ] Implicit Places using invariants in 1019 ms returned []
[2023-03-15 11:06:01] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-15 11:06:01] [INFO ] Invariant cache hit.
[2023-03-15 11:06:01] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:06:05] [INFO ] Implicit Places using invariants and state equation in 4694 ms returned []
Implicit Place search using SMT with State Equation took 5728 ms to find 0 implicit places.
[2023-03-15 11:06:05] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-15 11:06:05] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-15 11:06:05] [INFO ] Invariant cache hit.
[2023-03-15 11:06:07] [INFO ] Dead Transitions using invariants and state equation in 1338 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7169 ms. Remains : 588/588 places, 1699/1699 transitions.
Graph (trivial) has 1280 edges and 588 vertex of which 446 / 588 are part of one of the 56 SCC in 1 ms
Free SCC test removed 390 places
Drop transitions removed 780 transitions
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 1170 transitions.
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 54 Pre rules applied. Total rules applied 1 place count 198 transition count 475
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 144 transition count 475
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 113 place count 142 transition count 472
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 134 place count 128 transition count 465
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 135 place count 128 transition count 464
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 64 edges and 127 vertex of which 49 / 127 are part of one of the 6 SCC in 0 ms
Free SCC test removed 43 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 137 place count 84 transition count 464
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 49 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (trivial) has 260 edges and 79 vertex of which 35 / 79 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Iterating post reduction 2 with 56 rules applied. Total rules applied 193 place count 51 transition count 414
Drop transitions removed 140 transitions
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 308 transitions.
Iterating post reduction 3 with 308 rules applied. Total rules applied 501 place count 51 transition count 106
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 502 place count 51 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 502 place count 51 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 504 place count 50 transition count 104
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 506 place count 50 transition count 104
Applied a total of 506 rules in 22 ms. Remains 50 /588 variables (removed 538) and now considering 104/1699 (removed 1595) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 50 cols
[2023-03-15 11:06:07] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-15 11:06:07] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:06:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 11:06:07] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-15 11:06:07] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:06:07] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-15 11:06:07] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 2 factoid took 179 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 25 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-15 11:06:08] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 588 cols
[2023-03-15 11:06:08] [INFO ] Computed 24 place invariants in 4 ms
[2023-03-15 11:06:08] [INFO ] Implicit Places using invariants in 853 ms returned []
[2023-03-15 11:06:09] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-15 11:06:09] [INFO ] Invariant cache hit.
[2023-03-15 11:06:09] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:06:13] [INFO ] Implicit Places using invariants and state equation in 4848 ms returned []
Implicit Place search using SMT with State Equation took 5726 ms to find 0 implicit places.
[2023-03-15 11:06:13] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-15 11:06:13] [INFO ] Invariant cache hit.
[2023-03-15 11:06:15] [INFO ] Dead Transitions using invariants and state equation in 1275 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7040 ms. Remains : 588/588 places, 1699/1699 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :2
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
Running SMT prover for 1 properties.
[2023-03-15 11:06:15] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-15 11:06:15] [INFO ] Invariant cache hit.
[2023-03-15 11:06:15] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:06:16] [INFO ] [Nat]Absence check using 23 positive place invariants in 17 ms returned sat
[2023-03-15 11:06:16] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-15 11:06:16] [INFO ] After 638ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:06:16] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:06:16] [INFO ] After 154ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:06:17] [INFO ] Deduced a trap composed of 13 places in 471 ms of which 1 ms to minimize.
[2023-03-15 11:06:18] [INFO ] Deduced a trap composed of 12 places in 592 ms of which 1 ms to minimize.
[2023-03-15 11:06:18] [INFO ] Deduced a trap composed of 33 places in 587 ms of which 1 ms to minimize.
[2023-03-15 11:06:19] [INFO ] Deduced a trap composed of 30 places in 561 ms of which 1 ms to minimize.
[2023-03-15 11:06:20] [INFO ] Deduced a trap composed of 31 places in 583 ms of which 2 ms to minimize.
[2023-03-15 11:06:20] [INFO ] Deduced a trap composed of 34 places in 586 ms of which 1 ms to minimize.
[2023-03-15 11:06:21] [INFO ] Deduced a trap composed of 24 places in 374 ms of which 1 ms to minimize.
[2023-03-15 11:06:21] [INFO ] Deduced a trap composed of 22 places in 568 ms of which 1 ms to minimize.
[2023-03-15 11:06:22] [INFO ] Deduced a trap composed of 22 places in 524 ms of which 0 ms to minimize.
[2023-03-15 11:06:23] [INFO ] Deduced a trap composed of 21 places in 529 ms of which 0 ms to minimize.
[2023-03-15 11:06:23] [INFO ] Deduced a trap composed of 12 places in 596 ms of which 1 ms to minimize.
[2023-03-15 11:06:24] [INFO ] Deduced a trap composed of 12 places in 607 ms of which 1 ms to minimize.
[2023-03-15 11:06:25] [INFO ] Deduced a trap composed of 12 places in 612 ms of which 1 ms to minimize.
[2023-03-15 11:06:25] [INFO ] Deduced a trap composed of 79 places in 525 ms of which 1 ms to minimize.
[2023-03-15 11:06:26] [INFO ] Deduced a trap composed of 60 places in 478 ms of which 1 ms to minimize.
[2023-03-15 11:06:26] [INFO ] Deduced a trap composed of 51 places in 488 ms of which 1 ms to minimize.
[2023-03-15 11:06:27] [INFO ] Deduced a trap composed of 26 places in 453 ms of which 1 ms to minimize.
[2023-03-15 11:06:27] [INFO ] Deduced a trap composed of 30 places in 385 ms of which 1 ms to minimize.
[2023-03-15 11:06:28] [INFO ] Deduced a trap composed of 24 places in 457 ms of which 1 ms to minimize.
[2023-03-15 11:06:29] [INFO ] Deduced a trap composed of 16 places in 412 ms of which 1 ms to minimize.
[2023-03-15 11:06:29] [INFO ] Deduced a trap composed of 64 places in 402 ms of which 1 ms to minimize.
[2023-03-15 11:06:29] [INFO ] Deduced a trap composed of 15 places in 394 ms of which 1 ms to minimize.
[2023-03-15 11:06:30] [INFO ] Deduced a trap composed of 75 places in 419 ms of which 0 ms to minimize.
[2023-03-15 11:06:30] [INFO ] Deduced a trap composed of 15 places in 440 ms of which 1 ms to minimize.
[2023-03-15 11:06:31] [INFO ] Deduced a trap composed of 42 places in 457 ms of which 1 ms to minimize.
[2023-03-15 11:06:31] [INFO ] Deduced a trap composed of 31 places in 461 ms of which 1 ms to minimize.
[2023-03-15 11:06:32] [INFO ] Deduced a trap composed of 60 places in 408 ms of which 1 ms to minimize.
[2023-03-15 11:06:32] [INFO ] Deduced a trap composed of 63 places in 468 ms of which 1 ms to minimize.
[2023-03-15 11:06:33] [INFO ] Deduced a trap composed of 51 places in 435 ms of which 1 ms to minimize.
[2023-03-15 11:06:33] [INFO ] Deduced a trap composed of 43 places in 426 ms of which 1 ms to minimize.
[2023-03-15 11:06:34] [INFO ] Deduced a trap composed of 42 places in 444 ms of which 1 ms to minimize.
[2023-03-15 11:06:35] [INFO ] Deduced a trap composed of 42 places in 509 ms of which 1 ms to minimize.
[2023-03-15 11:06:35] [INFO ] Deduced a trap composed of 52 places in 442 ms of which 1 ms to minimize.
[2023-03-15 11:06:36] [INFO ] Deduced a trap composed of 50 places in 434 ms of which 1 ms to minimize.
[2023-03-15 11:06:36] [INFO ] Deduced a trap composed of 63 places in 413 ms of which 1 ms to minimize.
[2023-03-15 11:06:37] [INFO ] Deduced a trap composed of 65 places in 434 ms of which 1 ms to minimize.
[2023-03-15 11:06:37] [INFO ] Deduced a trap composed of 62 places in 405 ms of which 1 ms to minimize.
[2023-03-15 11:06:38] [INFO ] Deduced a trap composed of 41 places in 514 ms of which 1 ms to minimize.
[2023-03-15 11:06:39] [INFO ] Deduced a trap composed of 17 places in 481 ms of which 1 ms to minimize.
[2023-03-15 11:06:39] [INFO ] Deduced a trap composed of 31 places in 443 ms of which 1 ms to minimize.
[2023-03-15 11:06:40] [INFO ] Deduced a trap composed of 22 places in 438 ms of which 1 ms to minimize.
[2023-03-15 11:06:40] [INFO ] Deduced a trap composed of 43 places in 416 ms of which 1 ms to minimize.
[2023-03-15 11:06:41] [INFO ] Deduced a trap composed of 52 places in 372 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 11:06:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 11:06:41] [INFO ] After 25387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 40 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 588/588 places, 1699/1699 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) 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 554814 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :{}
Probabilistic random walk after 554814 steps, saw 80114 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 11:06:44] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-15 11:06:44] [INFO ] Invariant cache hit.
[2023-03-15 11:06:44] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:06:44] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2023-03-15 11:06:44] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-15 11:06:45] [INFO ] After 434ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:06:45] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:06:45] [INFO ] After 225ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:06:46] [INFO ] Deduced a trap composed of 13 places in 600 ms of which 1 ms to minimize.
[2023-03-15 11:06:46] [INFO ] Deduced a trap composed of 12 places in 611 ms of which 1 ms to minimize.
[2023-03-15 11:06:47] [INFO ] Deduced a trap composed of 33 places in 378 ms of which 0 ms to minimize.
[2023-03-15 11:06:47] [INFO ] Deduced a trap composed of 30 places in 419 ms of which 1 ms to minimize.
[2023-03-15 11:06:48] [INFO ] Deduced a trap composed of 31 places in 419 ms of which 1 ms to minimize.
[2023-03-15 11:06:48] [INFO ] Deduced a trap composed of 34 places in 467 ms of which 1 ms to minimize.
[2023-03-15 11:06:49] [INFO ] Deduced a trap composed of 24 places in 476 ms of which 0 ms to minimize.
[2023-03-15 11:06:49] [INFO ] Deduced a trap composed of 22 places in 444 ms of which 1 ms to minimize.
[2023-03-15 11:06:50] [INFO ] Deduced a trap composed of 22 places in 421 ms of which 1 ms to minimize.
[2023-03-15 11:06:50] [INFO ] Deduced a trap composed of 21 places in 422 ms of which 1 ms to minimize.
[2023-03-15 11:06:51] [INFO ] Deduced a trap composed of 12 places in 415 ms of which 1 ms to minimize.
[2023-03-15 11:06:51] [INFO ] Deduced a trap composed of 12 places in 482 ms of which 1 ms to minimize.
[2023-03-15 11:06:52] [INFO ] Deduced a trap composed of 12 places in 468 ms of which 1 ms to minimize.
[2023-03-15 11:06:52] [INFO ] Deduced a trap composed of 79 places in 421 ms of which 1 ms to minimize.
[2023-03-15 11:06:53] [INFO ] Deduced a trap composed of 60 places in 325 ms of which 1 ms to minimize.
[2023-03-15 11:06:53] [INFO ] Deduced a trap composed of 51 places in 388 ms of which 0 ms to minimize.
[2023-03-15 11:06:53] [INFO ] Deduced a trap composed of 26 places in 391 ms of which 1 ms to minimize.
[2023-03-15 11:06:54] [INFO ] Deduced a trap composed of 30 places in 376 ms of which 1 ms to minimize.
[2023-03-15 11:06:55] [INFO ] Deduced a trap composed of 24 places in 471 ms of which 0 ms to minimize.
[2023-03-15 11:06:55] [INFO ] Deduced a trap composed of 16 places in 450 ms of which 0 ms to minimize.
[2023-03-15 11:06:56] [INFO ] Deduced a trap composed of 64 places in 457 ms of which 1 ms to minimize.
[2023-03-15 11:06:56] [INFO ] Deduced a trap composed of 15 places in 415 ms of which 1 ms to minimize.
[2023-03-15 11:06:57] [INFO ] Deduced a trap composed of 75 places in 436 ms of which 1 ms to minimize.
[2023-03-15 11:06:57] [INFO ] Deduced a trap composed of 15 places in 416 ms of which 1 ms to minimize.
[2023-03-15 11:06:58] [INFO ] Deduced a trap composed of 42 places in 407 ms of which 1 ms to minimize.
[2023-03-15 11:06:58] [INFO ] Deduced a trap composed of 31 places in 385 ms of which 1 ms to minimize.
[2023-03-15 11:06:58] [INFO ] Deduced a trap composed of 60 places in 343 ms of which 0 ms to minimize.
[2023-03-15 11:06:59] [INFO ] Deduced a trap composed of 63 places in 337 ms of which 0 ms to minimize.
[2023-03-15 11:06:59] [INFO ] Deduced a trap composed of 51 places in 340 ms of which 1 ms to minimize.
[2023-03-15 11:07:00] [INFO ] Deduced a trap composed of 43 places in 369 ms of which 1 ms to minimize.
[2023-03-15 11:07:00] [INFO ] Deduced a trap composed of 42 places in 398 ms of which 1 ms to minimize.
[2023-03-15 11:07:01] [INFO ] Deduced a trap composed of 42 places in 367 ms of which 1 ms to minimize.
[2023-03-15 11:07:01] [INFO ] Deduced a trap composed of 52 places in 348 ms of which 1 ms to minimize.
[2023-03-15 11:07:01] [INFO ] Deduced a trap composed of 50 places in 352 ms of which 1 ms to minimize.
[2023-03-15 11:07:02] [INFO ] Deduced a trap composed of 63 places in 299 ms of which 1 ms to minimize.
[2023-03-15 11:07:02] [INFO ] Deduced a trap composed of 65 places in 319 ms of which 0 ms to minimize.
[2023-03-15 11:07:03] [INFO ] Deduced a trap composed of 62 places in 347 ms of which 1 ms to minimize.
[2023-03-15 11:07:03] [INFO ] Deduced a trap composed of 41 places in 465 ms of which 0 ms to minimize.
[2023-03-15 11:07:04] [INFO ] Deduced a trap composed of 17 places in 439 ms of which 1 ms to minimize.
[2023-03-15 11:07:04] [INFO ] Deduced a trap composed of 31 places in 451 ms of which 1 ms to minimize.
[2023-03-15 11:07:05] [INFO ] Deduced a trap composed of 22 places in 483 ms of which 1 ms to minimize.
[2023-03-15 11:07:06] [INFO ] Deduced a trap composed of 43 places in 483 ms of which 1 ms to minimize.
[2023-03-15 11:07:06] [INFO ] Deduced a trap composed of 52 places in 433 ms of which 1 ms to minimize.
[2023-03-15 11:07:07] [INFO ] Deduced a trap composed of 75 places in 365 ms of which 1 ms to minimize.
[2023-03-15 11:07:07] [INFO ] Deduced a trap composed of 75 places in 350 ms of which 1 ms to minimize.
[2023-03-15 11:07:07] [INFO ] Deduced a trap composed of 75 places in 361 ms of which 1 ms to minimize.
[2023-03-15 11:07:08] [INFO ] Deduced a trap composed of 77 places in 388 ms of which 1 ms to minimize.
[2023-03-15 11:07:08] [INFO ] Deduced a trap composed of 74 places in 379 ms of which 1 ms to minimize.
[2023-03-15 11:07:09] [INFO ] Deduced a trap composed of 75 places in 393 ms of which 1 ms to minimize.
[2023-03-15 11:07:09] [INFO ] Trap strengthening (SAT) tested/added 49/49 trap constraints in 24152 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 11:07:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 11:07:09] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 46 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 588/588 places, 1699/1699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 45 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-15 11:07:09] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-15 11:07:09] [INFO ] Invariant cache hit.
[2023-03-15 11:07:10] [INFO ] Implicit Places using invariants in 827 ms returned []
[2023-03-15 11:07:10] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-15 11:07:10] [INFO ] Invariant cache hit.
[2023-03-15 11:07:11] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:07:15] [INFO ] Implicit Places using invariants and state equation in 4557 ms returned []
Implicit Place search using SMT with State Equation took 5415 ms to find 0 implicit places.
[2023-03-15 11:07:15] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-15 11:07:15] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-15 11:07:15] [INFO ] Invariant cache hit.
[2023-03-15 11:07:16] [INFO ] Dead Transitions using invariants and state equation in 1529 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7030 ms. Remains : 588/588 places, 1699/1699 transitions.
Graph (trivial) has 1280 edges and 588 vertex of which 446 / 588 are part of one of the 56 SCC in 0 ms
Free SCC test removed 390 places
Drop transitions removed 780 transitions
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 1170 transitions.
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 54 Pre rules applied. Total rules applied 1 place count 198 transition count 475
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 144 transition count 475
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 113 place count 142 transition count 472
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 134 place count 128 transition count 465
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 135 place count 128 transition count 464
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 64 edges and 127 vertex of which 49 / 127 are part of one of the 6 SCC in 0 ms
Free SCC test removed 43 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 137 place count 84 transition count 464
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 49 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (trivial) has 260 edges and 79 vertex of which 35 / 79 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Iterating post reduction 2 with 56 rules applied. Total rules applied 193 place count 51 transition count 414
Drop transitions removed 140 transitions
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 308 transitions.
Iterating post reduction 3 with 308 rules applied. Total rules applied 501 place count 51 transition count 106
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 502 place count 51 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 502 place count 51 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 504 place count 50 transition count 104
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 506 place count 50 transition count 104
Applied a total of 506 rules in 16 ms. Remains 50 /588 variables (removed 538) and now considering 104/1699 (removed 1595) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 50 cols
[2023-03-15 11:07:16] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-15 11:07:16] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:07:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 11:07:16] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-15 11:07:16] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:07:16] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-15 11:07:16] [INFO ] After 218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 2 factoid took 357 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 306 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 640 reset in 498 ms.
Product exploration explored 100000 steps with 679 reset in 396 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 27 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-15 11:07:19] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-15 11:07:19] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 588 cols
[2023-03-15 11:07:19] [INFO ] Computed 24 place invariants in 4 ms
[2023-03-15 11:07:20] [INFO ] Dead Transitions using invariants and state equation in 1349 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1439 ms. Remains : 588/588 places, 1699/1699 transitions.
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 19 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-15 11:07:20] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-15 11:07:20] [INFO ] Invariant cache hit.
[2023-03-15 11:07:21] [INFO ] Implicit Places using invariants in 707 ms returned []
[2023-03-15 11:07:21] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-15 11:07:21] [INFO ] Invariant cache hit.
[2023-03-15 11:07:21] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-15 11:07:25] [INFO ] Implicit Places using invariants and state equation in 4380 ms returned []
Implicit Place search using SMT with State Equation took 5126 ms to find 0 implicit places.
[2023-03-15 11:07:25] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-15 11:07:25] [INFO ] Invariant cache hit.
[2023-03-15 11:07:27] [INFO ] Dead Transitions using invariants and state equation in 1294 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6467 ms. Remains : 588/588 places, 1699/1699 transitions.
Treatment of property Peterson-PT-7-LTLFireability-14 finished in 120873 ms.
[2023-03-15 11:07:27] [INFO ] Flatten gal took : 354 ms
[2023-03-15 11:07:27] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-15 11:07:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1992 places, 3096 transitions and 9584 arcs took 56 ms.
Total runtime 834060 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Peterson-PT-7
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability
BK_STOP 1678878660635
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 Peterson-PT-7-LTLFireability-14
lola: time limit : 1798 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 4/1798 2/32 Peterson-PT-7-LTLFireability-14 90927 m, 18185 m/sec, 302420 t fired, .
Time elapsed: 7 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 9/1798 3/32 Peterson-PT-7-LTLFireability-14 134337 m, 8682 m/sec, 703392 t fired, .
Time elapsed: 12 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 14/1798 5/32 Peterson-PT-7-LTLFireability-14 191336 m, 11399 m/sec, 1105430 t fired, .
Time elapsed: 17 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 19/1798 6/32 Peterson-PT-7-LTLFireability-14 239767 m, 9686 m/sec, 1477785 t fired, .
Time elapsed: 22 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 24/1798 6/32 Peterson-PT-7-LTLFireability-14 281412 m, 8329 m/sec, 1881213 t fired, .
Time elapsed: 27 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 29/1798 8/32 Peterson-PT-7-LTLFireability-14 335329 m, 10783 m/sec, 2276926 t fired, .
Time elapsed: 32 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 34/1798 9/32 Peterson-PT-7-LTLFireability-14 391981 m, 11330 m/sec, 2682146 t fired, .
Time elapsed: 37 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 39/1798 10/32 Peterson-PT-7-LTLFireability-14 443508 m, 10305 m/sec, 3082942 t fired, .
Time elapsed: 42 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 44/1798 11/32 Peterson-PT-7-LTLFireability-14 480507 m, 7399 m/sec, 3483118 t fired, .
Time elapsed: 47 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 49/1798 12/32 Peterson-PT-7-LTLFireability-14 535405 m, 10979 m/sec, 3886161 t fired, .
Time elapsed: 52 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 54/1798 13/32 Peterson-PT-7-LTLFireability-14 591452 m, 11209 m/sec, 4265550 t fired, .
Time elapsed: 57 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 59/1798 14/32 Peterson-PT-7-LTLFireability-14 634174 m, 8544 m/sec, 4659455 t fired, .
Time elapsed: 62 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 64/1798 14/32 Peterson-PT-7-LTLFireability-14 678759 m, 8917 m/sec, 5054626 t fired, .
Time elapsed: 67 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 69/1798 16/32 Peterson-PT-7-LTLFireability-14 736057 m, 11459 m/sec, 5457261 t fired, .
Time elapsed: 72 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 74/1798 17/32 Peterson-PT-7-LTLFireability-14 791660 m, 11120 m/sec, 5851326 t fired, .
Time elapsed: 77 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 79/1798 17/32 Peterson-PT-7-LTLFireability-14 828611 m, 7390 m/sec, 6245384 t fired, .
Time elapsed: 82 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 84/1798 19/32 Peterson-PT-7-LTLFireability-14 879368 m, 10151 m/sec, 6643731 t fired, .
Time elapsed: 87 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 89/1798 20/32 Peterson-PT-7-LTLFireability-14 936609 m, 11448 m/sec, 7042155 t fired, .
Time elapsed: 92 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 94/1798 21/32 Peterson-PT-7-LTLFireability-14 986990 m, 10076 m/sec, 7441146 t fired, .
Time elapsed: 97 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 99/1798 22/32 Peterson-PT-7-LTLFireability-14 1024916 m, 7585 m/sec, 7840476 t fired, .
Time elapsed: 102 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 104/1798 23/32 Peterson-PT-7-LTLFireability-14 1079853 m, 10987 m/sec, 8241073 t fired, .
Time elapsed: 107 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 109/1798 24/32 Peterson-PT-7-LTLFireability-14 1122774 m, 8584 m/sec, 8629830 t fired, .
Time elapsed: 112 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 114/1798 25/32 Peterson-PT-7-LTLFireability-14 1187098 m, 12864 m/sec, 9026185 t fired, .
Time elapsed: 117 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 119/1798 26/32 Peterson-PT-7-LTLFireability-14 1237060 m, 9992 m/sec, 9426789 t fired, .
Time elapsed: 122 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 124/1798 27/32 Peterson-PT-7-LTLFireability-14 1285437 m, 9675 m/sec, 9820895 t fired, .
Time elapsed: 127 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 129/1798 28/32 Peterson-PT-7-LTLFireability-14 1332918 m, 9496 m/sec, 10209017 t fired, .
Time elapsed: 132 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 134/1798 29/32 Peterson-PT-7-LTLFireability-14 1384870 m, 10390 m/sec, 10603380 t fired, .
Time elapsed: 137 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 139/1798 30/32 Peterson-PT-7-LTLFireability-14 1434435 m, 9913 m/sec, 11001716 t fired, .
Time elapsed: 142 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 144/1798 31/32 Peterson-PT-7-LTLFireability-14 1471768 m, 7466 m/sec, 11403840 t fired, .
Time elapsed: 147 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 149/1798 32/32 Peterson-PT-7-LTLFireability-14 1522231 m, 10092 m/sec, 11804458 t fired, .
Time elapsed: 152 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for Peterson-PT-7-LTLFireability-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 157 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 Peterson-PT-7-LTLFireability-11
lola: time limit : 3443 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3443 4/32 Peterson-PT-7-LTLFireability-11 173076 m, 34615 m/sec, 352444 t fired, .
Time elapsed: 162 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3443 8/32 Peterson-PT-7-LTLFireability-11 327313 m, 30847 m/sec, 722270 t fired, .
Time elapsed: 167 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3443 11/32 Peterson-PT-7-LTLFireability-11 473884 m, 29314 m/sec, 1089958 t fired, .
Time elapsed: 172 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3443 14/32 Peterson-PT-7-LTLFireability-11 618249 m, 28873 m/sec, 1457239 t fired, .
Time elapsed: 177 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3443 17/32 Peterson-PT-7-LTLFireability-11 758315 m, 28013 m/sec, 1824533 t fired, .
Time elapsed: 182 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3443 20/32 Peterson-PT-7-LTLFireability-11 892146 m, 26766 m/sec, 2175795 t fired, .
Time elapsed: 187 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3443 23/32 Peterson-PT-7-LTLFireability-11 1027446 m, 27060 m/sec, 2542916 t fired, .
Time elapsed: 192 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3443 26/32 Peterson-PT-7-LTLFireability-11 1161288 m, 26768 m/sec, 2908542 t fired, .
Time elapsed: 197 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3443 28/32 Peterson-PT-7-LTLFireability-11 1293044 m, 26351 m/sec, 3273972 t fired, .
Time elapsed: 202 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3443 31/32 Peterson-PT-7-LTLFireability-11 1422867 m, 25964 m/sec, 3638242 t fired, .
Time elapsed: 207 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for Peterson-PT-7-LTLFireability-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-7-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
Peterson-PT-7-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 212 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-7-LTLFireability-11: LTL unknown AGGR
Peterson-PT-7-LTLFireability-14: LTL unknown AGGR
Time elapsed: 212 secs. Pages in use: 32
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-7"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Peterson-PT-7, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-smll-167863538500644"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-7.tgz
mv Peterson-PT-7 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 ;