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.r329-tall-167889201600091.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is RERS17pb114-PT-3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889201600091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 73M
-rw-r--r-- 1 mcc users 7.9K Feb 26 04:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 04:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 04:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 04:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 04:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 04:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 04:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 73M 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 RERS17pb114-PT-3-LTLCardinality-00
FORMULA_NAME RERS17pb114-PT-3-LTLCardinality-01
FORMULA_NAME RERS17pb114-PT-3-LTLCardinality-02
FORMULA_NAME RERS17pb114-PT-3-LTLCardinality-03
FORMULA_NAME RERS17pb114-PT-3-LTLCardinality-04
FORMULA_NAME RERS17pb114-PT-3-LTLCardinality-05
FORMULA_NAME RERS17pb114-PT-3-LTLCardinality-06
FORMULA_NAME RERS17pb114-PT-3-LTLCardinality-07
FORMULA_NAME RERS17pb114-PT-3-LTLCardinality-08
FORMULA_NAME RERS17pb114-PT-3-LTLCardinality-09
FORMULA_NAME RERS17pb114-PT-3-LTLCardinality-10
FORMULA_NAME RERS17pb114-PT-3-LTLCardinality-11
FORMULA_NAME RERS17pb114-PT-3-LTLCardinality-12
FORMULA_NAME RERS17pb114-PT-3-LTLCardinality-13
FORMULA_NAME RERS17pb114-PT-3-LTLCardinality-14
FORMULA_NAME RERS17pb114-PT-3-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679016413025

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb114-PT-3
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 01:26:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 01:26:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 01:26:56] [INFO ] Load time of PNML (sax parser for PT used): 1864 ms
[2023-03-17 01:26:56] [INFO ] Transformed 1446 places.
[2023-03-17 01:26:57] [INFO ] Transformed 151085 transitions.
[2023-03-17 01:26:57] [INFO ] Parsed PT model containing 1446 places and 151085 transitions and 604252 arcs in 2399 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA RERS17pb114-PT-3-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS17pb114-PT-3-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 1446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1446/1446 places, 151085/151085 transitions.
Ensure Unique test removed 17 places
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1429 transition count 151085
Applied a total of 17 rules in 1061 ms. Remains 1429 /1446 variables (removed 17) and now considering 151085/151085 (removed 0) transitions.
[2023-03-17 01:26:59] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1429 cols
[2023-03-17 01:26:59] [INFO ] Computed 18 place invariants in 451 ms
[2023-03-17 01:27:08] [INFO ] Implicit Places using invariants in 9543 ms returned []
Implicit Place search using SMT only with invariants took 9570 ms to find 0 implicit places.
[2023-03-17 01:27:08] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-17 01:27:08] [INFO ] Invariant cache hit.
[2023-03-17 01:27:39] [INFO ] Performed 89791/151085 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:27:58] [INFO ] Dead Transitions using invariants and state equation in 49411 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1429/1446 places, 151085/151085 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60059 ms. Remains : 1429/1446 places, 151085/151085 transitions.
Support contains 46 out of 1429 places after structural reductions.
[2023-03-17 01:28:02] [INFO ] Flatten gal took : 3261 ms
[2023-03-17 01:28:05] [INFO ] Flatten gal took : 3096 ms
[2023-03-17 01:28:12] [INFO ] Input system was already deterministic with 151085 transitions.
Support contains 44 out of 1429 places (down from 46) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1801 ms. (steps per millisecond=5 ) properties (out of 31) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-17 01:28:17] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-17 01:28:17] [INFO ] Invariant cache hit.
[2023-03-17 01:28:17] [INFO ] After 526ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-17 01:28:18] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-17 01:28:42] [INFO ] After 24219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-17 01:28:44] [INFO ] State equation strengthened by 2342 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-17 01:28:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:28:44] [INFO ] After 27063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 21 out of 1429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Drop transitions removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 1429 transition count 150573
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 513 place count 1428 transition count 150572
Applied a total of 513 rules in 3294 ms. Remains 1428 /1429 variables (removed 1) and now considering 150572/151085 (removed 513) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3303 ms. Remains : 1428/1429 places, 150572/151085 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1474 ms. (steps per millisecond=6 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-17 01:28:51] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-17 01:28:51] [INFO ] Computed 18 place invariants in 274 ms
[2023-03-17 01:28:52] [INFO ] After 449ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-17 01:28:52] [INFO ] [Nat]Absence check using 18 positive place invariants in 19 ms returned sat
[2023-03-17 01:29:17] [INFO ] After 24592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-17 01:29:18] [INFO ] State equation strengthened by 773 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-17 01:29:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:29:18] [INFO ] After 25963ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 19 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1194 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1195 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 960 ms. (steps per millisecond=10 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-17 01:29:21] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 01:29:21] [INFO ] Invariant cache hit.
[2023-03-17 01:29:21] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-17 01:29:22] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-17 01:29:46] [INFO ] After 24559ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-17 01:29:47] [INFO ] State equation strengthened by 773 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-17 01:29:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:29:47] [INFO ] After 25674ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 13 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1226 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1226 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1232 ms. (steps per millisecond=8 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 3352 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3352 steps, saw 2975 distinct states, run finished after 3005 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-17 01:29:54] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 01:29:54] [INFO ] Invariant cache hit.
[2023-03-17 01:29:54] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-17 01:29:54] [INFO ] [Nat]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-17 01:30:19] [INFO ] After 24659ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-17 01:30:20] [INFO ] State equation strengthened by 773 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-17 01:30:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:30:20] [INFO ] After 25737ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 13 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1234 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1234 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1242 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-17 01:30:22] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 01:30:22] [INFO ] Invariant cache hit.
[2023-03-17 01:30:30] [INFO ] Implicit Places using invariants in 7687 ms returned []
Implicit Place search using SMT only with invariants took 7688 ms to find 0 implicit places.
[2023-03-17 01:30:30] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 01:30:30] [INFO ] Invariant cache hit.
[2023-03-17 01:31:00] [INFO ] Performed 96183/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:31:16] [INFO ] Dead Transitions using invariants and state equation in 46606 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55549 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p0)))))'
Support contains 2 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1196 ms. Remains 1428 /1429 variables (removed 1) and now considering 151084/151085 (removed 1) transitions.
[2023-03-17 01:31:19] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
// Phase 1: matrix 84690 rows 1428 cols
[2023-03-17 01:31:19] [INFO ] Computed 18 place invariants in 278 ms
[2023-03-17 01:31:27] [INFO ] Implicit Places using invariants in 8230 ms returned []
Implicit Place search using SMT only with invariants took 8231 ms to find 0 implicit places.
[2023-03-17 01:31:27] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
[2023-03-17 01:31:27] [INFO ] Invariant cache hit.
[2023-03-17 01:31:57] [INFO ] Performed 97957/151084 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:32:14] [INFO ] Dead Transitions using invariants and state equation in 47033 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56465 ms. Remains : 1428/1429 places, 151084/151085 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0)]
Running random walk in product with property : RERS17pb114-PT-3-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s630 s245)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 193 steps with 0 reset in 39 ms.
FORMULA RERS17pb114-PT-3-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS17pb114-PT-3-LTLCardinality-00 finished in 57131 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||(p1 U (G(p2) U p3)))))'
Support contains 5 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Applied a total of 0 rules in 607 ms. Remains 1429 /1429 variables (removed 0) and now considering 151085/151085 (removed 0) transitions.
[2023-03-17 01:32:15] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1429 cols
[2023-03-17 01:32:15] [INFO ] Computed 18 place invariants in 251 ms
[2023-03-17 01:32:23] [INFO ] Implicit Places using invariants in 8041 ms returned []
Implicit Place search using SMT only with invariants took 8042 ms to find 0 implicit places.
[2023-03-17 01:32:23] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-17 01:32:23] [INFO ] Invariant cache hit.
[2023-03-17 01:32:53] [INFO ] Performed 97995/151085 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:33:10] [INFO ] Dead Transitions using invariants and state equation in 46866 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55519 ms. Remains : 1429/1429 places, 151085/151085 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p2), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (AND (NOT p0) (NOT p3)), (NOT p3)]
Running random walk in product with property : RERS17pb114-PT-3-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=1 dest: 5}], [{ cond=(AND p3 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p3) p1), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(OR (LEQ 3 s809) (LEQ 1 s1126)), p0:(GT 1 s1126), p3:(LEQ s841 s542), p1:(LEQ 1 s237)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 49280 steps with 24640 reset in 10002 ms.
Product exploration timeout after 49390 steps with 24695 reset in 10002 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p3 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND (NOT p3) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p3) p1)))
Knowledge based reduction with 11 factoid took 186 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS17pb114-PT-3-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS17pb114-PT-3-LTLCardinality-01 finished in 76767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Applied a total of 0 rules in 543 ms. Remains 1429 /1429 variables (removed 0) and now considering 151085/151085 (removed 0) transitions.
[2023-03-17 01:33:32] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-17 01:33:32] [INFO ] Invariant cache hit.
[2023-03-17 01:33:40] [INFO ] Implicit Places using invariants in 8064 ms returned []
Implicit Place search using SMT only with invariants took 8065 ms to find 0 implicit places.
[2023-03-17 01:33:40] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-17 01:33:40] [INFO ] Invariant cache hit.
[2023-03-17 01:34:10] [INFO ] Performed 98753/151085 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:34:26] [INFO ] Dead Transitions using invariants and state equation in 46042 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54655 ms. Remains : 1429/1429 places, 151085/151085 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RERS17pb114-PT-3-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s256 s384)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 53750 steps with 26875 reset in 10002 ms.
Product exploration timeout after 54250 steps with 27125 reset in 10001 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS17pb114-PT-3-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS17pb114-PT-3-LTLCardinality-02 finished in 75505 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(F(p0))||(p1&&F(p0)))) U G(p2)))'
Support contains 5 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1187 ms. Remains 1428 /1429 variables (removed 1) and now considering 151084/151085 (removed 1) transitions.
[2023-03-17 01:34:48] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
// Phase 1: matrix 84690 rows 1428 cols
[2023-03-17 01:34:48] [INFO ] Computed 18 place invariants in 256 ms
[2023-03-17 01:34:56] [INFO ] Implicit Places using invariants in 7811 ms returned []
Implicit Place search using SMT only with invariants took 7813 ms to find 0 implicit places.
[2023-03-17 01:34:56] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
[2023-03-17 01:34:56] [INFO ] Invariant cache hit.
[2023-03-17 01:35:26] [INFO ] Performed 98708/151084 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:35:42] [INFO ] Dead Transitions using invariants and state equation in 46025 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55030 ms. Remains : 1428/1429 places, 151084/151085 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p2), (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : RERS17pb114-PT-3-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GT s489 s114), p1:(GT s601 s488), p0:(GT 2 s1108)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 7 ms.
FORMULA RERS17pb114-PT-3-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS17pb114-PT-3-LTLCardinality-03 finished in 55539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1126 ms. Remains 1428 /1429 variables (removed 1) and now considering 151084/151085 (removed 1) transitions.
[2023-03-17 01:35:43] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
[2023-03-17 01:35:43] [INFO ] Invariant cache hit.
[2023-03-17 01:35:51] [INFO ] Implicit Places using invariants in 7622 ms returned []
Implicit Place search using SMT only with invariants took 7623 ms to find 0 implicit places.
[2023-03-17 01:35:51] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
[2023-03-17 01:35:51] [INFO ] Invariant cache hit.
[2023-03-17 01:36:21] [INFO ] Performed 96666/151084 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:36:38] [INFO ] Dead Transitions using invariants and state equation in 47262 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56015 ms. Remains : 1428/1429 places, 151084/151085 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RERS17pb114-PT-3-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s176 s151)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 7 ms.
FORMULA RERS17pb114-PT-3-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS17pb114-PT-3-LTLCardinality-04 finished in 56487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 3 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Applied a total of 0 rules in 592 ms. Remains 1429 /1429 variables (removed 0) and now considering 151085/151085 (removed 0) transitions.
[2023-03-17 01:36:39] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1429 cols
[2023-03-17 01:36:40] [INFO ] Computed 18 place invariants in 280 ms
[2023-03-17 01:36:47] [INFO ] Implicit Places using invariants in 7829 ms returned []
Implicit Place search using SMT only with invariants took 7830 ms to find 0 implicit places.
[2023-03-17 01:36:47] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-17 01:36:47] [INFO ] Invariant cache hit.
[2023-03-17 01:37:17] [INFO ] Performed 97050/151085 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:37:34] [INFO ] Dead Transitions using invariants and state equation in 47262 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55688 ms. Remains : 1429/1429 places, 151085/151085 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RERS17pb114-PT-3-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ 3 s1233), p0:(GT s136 s1280)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 4 ms.
FORMULA RERS17pb114-PT-3-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS17pb114-PT-3-LTLCardinality-05 finished in 56186 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||G(p1))))'
Support contains 3 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Applied a total of 0 rules in 549 ms. Remains 1429 /1429 variables (removed 0) and now considering 151085/151085 (removed 0) transitions.
[2023-03-17 01:37:36] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-17 01:37:36] [INFO ] Invariant cache hit.
[2023-03-17 01:37:43] [INFO ] Implicit Places using invariants in 7938 ms returned []
Implicit Place search using SMT only with invariants took 7943 ms to find 0 implicit places.
[2023-03-17 01:37:44] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-17 01:37:44] [INFO ] Invariant cache hit.
[2023-03-17 01:38:14] [INFO ] Performed 98809/151085 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:38:30] [INFO ] Dead Transitions using invariants and state equation in 46162 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54657 ms. Remains : 1429/1429 places, 151085/151085 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RERS17pb114-PT-3-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (GT 3 s873) (GT s1043 s507)), p0:(GT 3 s873)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 54070 steps with 27035 reset in 10001 ms.
Product exploration timeout after 53080 steps with 26540 reset in 10002 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 5 factoid took 120 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS17pb114-PT-3-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS17pb114-PT-3-LTLCardinality-06 finished in 75632 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(p1)))||G(p2)))'
Support contains 5 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Applied a total of 0 rules in 597 ms. Remains 1429 /1429 variables (removed 0) and now considering 151085/151085 (removed 0) transitions.
[2023-03-17 01:38:51] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-17 01:38:51] [INFO ] Invariant cache hit.
[2023-03-17 01:38:59] [INFO ] Implicit Places using invariants in 8131 ms returned []
Implicit Place search using SMT only with invariants took 8132 ms to find 0 implicit places.
[2023-03-17 01:38:59] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-17 01:38:59] [INFO ] Invariant cache hit.
[2023-03-17 01:39:30] [INFO ] Performed 99232/151085 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:39:45] [INFO ] Dead Transitions using invariants and state equation in 46008 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54743 ms. Remains : 1429/1429 places, 151085/151085 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : RERS17pb114-PT-3-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=3, aps=[p1:(LEQ s471 s281), p0:(LEQ s519 s426), p2:(GT 2 s917)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 8402 ms.
Product exploration timeout after 88560 steps with 0 reset in 10001 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 p2 p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2) p1))), (X p1), (X (AND p0 p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), true, (X (X (AND p0 p2))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 1256 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1537 ms. (steps per millisecond=6 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-17 01:40:09] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-17 01:40:09] [INFO ] Invariant cache hit.
[2023-03-17 01:40:09] [INFO ] [Real]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-17 01:40:10] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 01:40:10] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-17 01:40:35] [INFO ] After 24741ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 01:40:36] [INFO ] State equation strengthened by 2342 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-17 01:40:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:40:36] [INFO ] After 26456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Drop transitions removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 1429 transition count 150573
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 513 place count 1428 transition count 150572
Applied a total of 513 rules in 2575 ms. Remains 1428 /1429 variables (removed 1) and now considering 150572/151085 (removed 513) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2578 ms. Remains : 1428/1429 places, 150572/151085 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 918 ms. (steps per millisecond=10 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 4114 steps, run timeout after 3007 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4114 steps, saw 3658 distinct states, run finished after 3007 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-17 01:40:43] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-17 01:40:44] [INFO ] Computed 18 place invariants in 263 ms
[2023-03-17 01:40:44] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-17 01:40:44] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 01:40:44] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-17 01:41:09] [INFO ] After 24635ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 01:41:10] [INFO ] State equation strengthened by 773 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-17 01:41:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:41:10] [INFO ] After 25648ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1131 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1131 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1146 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-17 01:41:12] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 01:41:12] [INFO ] Invariant cache hit.
[2023-03-17 01:41:20] [INFO ] Implicit Places using invariants in 7873 ms returned []
Implicit Place search using SMT only with invariants took 7874 ms to find 0 implicit places.
[2023-03-17 01:41:20] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 01:41:20] [INFO ] Invariant cache hit.
[2023-03-17 01:41:50] [INFO ] Performed 97102/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:42:06] [INFO ] Dead Transitions using invariants and state equation in 46590 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55624 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 p2 p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2) p1))), (X p1), (X (AND p0 p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), true, (X (X (AND p0 p2))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND p2 p0))), (F (AND p2 (NOT p1))), (F (AND p2 (NOT p0))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND p2 (NOT p0) p1)), (F (NOT (AND p2 p0 p1)))]
Knowledge based reduction with 31 factoid took 1345 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 347 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 5 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Applied a total of 0 rules in 601 ms. Remains 1429 /1429 variables (removed 0) and now considering 151085/151085 (removed 0) transitions.
[2023-03-17 01:42:09] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1429 cols
[2023-03-17 01:42:10] [INFO ] Computed 18 place invariants in 241 ms
[2023-03-17 01:42:17] [INFO ] Implicit Places using invariants in 8097 ms returned []
Implicit Place search using SMT only with invariants took 8099 ms to find 0 implicit places.
[2023-03-17 01:42:17] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-17 01:42:17] [INFO ] Invariant cache hit.
[2023-03-17 01:42:48] [INFO ] Performed 98044/151085 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:43:04] [INFO ] Dead Transitions using invariants and state equation in 47001 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55706 ms. Remains : 1429/1429 places, 151085/151085 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p0 p1)), (X p0), (X (AND p2 p0)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X p1), (X (AND p0 p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p0 p1))), (X (X p0)), true, (X (X p2)), (X (X (AND p2 p0))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 1129 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1158 ms. (steps per millisecond=8 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 3747 steps, run timeout after 3005 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3747 steps, saw 2987 distinct states, run finished after 3005 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-17 01:43:11] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-17 01:43:12] [INFO ] Invariant cache hit.
[2023-03-17 01:43:12] [INFO ] After 501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-17 01:43:12] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-17 01:43:37] [INFO ] After 24500ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-17 01:43:39] [INFO ] State equation strengthened by 2342 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-17 01:43:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:43:39] [INFO ] After 26588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Drop transitions removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 1429 transition count 150573
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 513 place count 1428 transition count 150572
Applied a total of 513 rules in 3385 ms. Remains 1428 /1429 variables (removed 1) and now considering 150572/151085 (removed 513) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3391 ms. Remains : 1428/1429 places, 150572/151085 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1056 ms. (steps per millisecond=9 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-17 01:43:44] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-17 01:43:45] [INFO ] Computed 18 place invariants in 251 ms
[2023-03-17 01:43:45] [INFO ] After 327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-17 01:43:45] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-17 01:44:10] [INFO ] After 24503ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-17 01:44:11] [INFO ] State equation strengthened by 773 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-17 01:44:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:44:11] [INFO ] After 25776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1311 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1311 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1433 ms. (steps per millisecond=6 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-17 01:44:14] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 01:44:14] [INFO ] Invariant cache hit.
[2023-03-17 01:44:15] [INFO ] [Real]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-17 01:44:15] [INFO ] After 292ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 01:44:15] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-17 01:44:40] [INFO ] After 24886ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 01:44:41] [INFO ] State equation strengthened by 773 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-17 01:44:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:44:41] [INFO ] After 26155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1207 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1207 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 891 ms. (steps per millisecond=11 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 4146 steps, run timeout after 3004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4146 steps, saw 3688 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-17 01:44:47] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 01:44:47] [INFO ] Invariant cache hit.
[2023-03-17 01:44:47] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-17 01:44:47] [INFO ] After 315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 01:44:48] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-17 01:45:13] [INFO ] After 24799ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 01:45:13] [INFO ] State equation strengthened by 773 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-17 01:45:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:45:13] [INFO ] After 26116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1056 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1056 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1061 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-17 01:45:16] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 01:45:16] [INFO ] Invariant cache hit.
[2023-03-17 01:45:23] [INFO ] Implicit Places using invariants in 7628 ms returned []
Implicit Place search using SMT only with invariants took 7629 ms to find 0 implicit places.
[2023-03-17 01:45:23] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 01:45:23] [INFO ] Invariant cache hit.
[2023-03-17 01:45:53] [INFO ] Performed 91740/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:46:12] [INFO ] Dead Transitions using invariants and state equation in 48515 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57219 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p0 p1)), (X p0), (X (AND p2 p0)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X p1), (X (AND p0 p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p0 p1))), (X (X p0)), true, (X (X p2)), (X (X (AND p2 p0))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (AND (NOT p1) p2)), (F (AND (NOT p0) p2)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0))), (F (NOT p0)), (F (AND p1 (NOT p0) p2)), (F (NOT (AND p1 p0 p2)))]
Knowledge based reduction with 31 factoid took 1489 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 8760 ms.
Product exploration explored 100000 steps with 0 reset in 8616 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 5 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Applied a total of 0 rules in 1315 ms. Remains 1429 /1429 variables (removed 0) and now considering 151085/151085 (removed 0) transitions.
[2023-03-17 01:46:33] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1429 cols
[2023-03-17 01:46:33] [INFO ] Computed 18 place invariants in 254 ms
[2023-03-17 01:47:04] [INFO ] Performed 98909/151085 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:47:20] [INFO ] Dead Transitions using invariants and state equation in 46882 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48202 ms. Remains : 1429/1429 places, 151085/151085 transitions.
Support contains 5 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Applied a total of 0 rules in 544 ms. Remains 1429 /1429 variables (removed 0) and now considering 151085/151085 (removed 0) transitions.
[2023-03-17 01:47:21] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-17 01:47:21] [INFO ] Invariant cache hit.
[2023-03-17 01:47:29] [INFO ] Implicit Places using invariants in 7954 ms returned []
Implicit Place search using SMT only with invariants took 7955 ms to find 0 implicit places.
[2023-03-17 01:47:29] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-17 01:47:29] [INFO ] Invariant cache hit.
[2023-03-17 01:47:59] [INFO ] Performed 98630/151085 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:48:15] [INFO ] Dead Transitions using invariants and state equation in 46212 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54716 ms. Remains : 1429/1429 places, 151085/151085 transitions.
Treatment of property RERS17pb114-PT-3-LTLCardinality-09 finished in 570378 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||(p2&&X(X(p2))))))'
Support contains 4 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Applied a total of 0 rules in 661 ms. Remains 1429 /1429 variables (removed 0) and now considering 151085/151085 (removed 0) transitions.
[2023-03-17 01:48:22] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-17 01:48:22] [INFO ] Invariant cache hit.
[2023-03-17 01:48:30] [INFO ] Implicit Places using invariants in 8242 ms returned []
Implicit Place search using SMT only with invariants took 8244 ms to find 0 implicit places.
[2023-03-17 01:48:30] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-17 01:48:30] [INFO ] Invariant cache hit.
[2023-03-17 01:49:00] [INFO ] Performed 91708/151085 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:49:19] [INFO ] Dead Transitions using invariants and state equation in 49409 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58318 ms. Remains : 1429/1429 places, 151085/151085 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : RERS17pb114-PT-3-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=3 dest: 5}, { cond=(NOT p0), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=4 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}]], initial=1, aps=[p1:(LEQ 2 s787), p2:(LEQ s255 s1192), p0:(GT 3 s308)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 58860 steps with 19620 reset in 10004 ms.
Product exploration timeout after 61620 steps with 20540 reset in 10003 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (AND (NOT p1) p2 p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X p0), true, (X (X p2)), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 10 factoid took 214 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS17pb114-PT-3-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS17pb114-PT-3-LTLCardinality-10 finished in 79563 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))))'
Support contains 1 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Applied a total of 0 rules in 547 ms. Remains 1429 /1429 variables (removed 0) and now considering 151085/151085 (removed 0) transitions.
[2023-03-17 01:49:41] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-17 01:49:41] [INFO ] Invariant cache hit.
[2023-03-17 01:49:49] [INFO ] Implicit Places using invariants in 7800 ms returned []
Implicit Place search using SMT only with invariants took 7801 ms to find 0 implicit places.
[2023-03-17 01:49:49] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-17 01:49:49] [INFO ] Invariant cache hit.
[2023-03-17 01:50:19] [INFO ] Performed 100064/151085 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:50:34] [INFO ] Dead Transitions using invariants and state equation in 45520 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53871 ms. Remains : 1429/1429 places, 151085/151085 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RERS17pb114-PT-3-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 1 s104)], 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]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 4 ms.
FORMULA RERS17pb114-PT-3-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS17pb114-PT-3-LTLCardinality-11 finished in 54347 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((F(p0)&&p1))&&F((!(p0 U p2)||p3)))))'
Support contains 5 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1035 ms. Remains 1428 /1429 variables (removed 1) and now considering 151084/151085 (removed 1) transitions.
[2023-03-17 01:50:36] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
// Phase 1: matrix 84690 rows 1428 cols
[2023-03-17 01:50:36] [INFO ] Computed 18 place invariants in 239 ms
[2023-03-17 01:50:44] [INFO ] Implicit Places using invariants in 7828 ms returned []
Implicit Place search using SMT only with invariants took 7829 ms to find 0 implicit places.
[2023-03-17 01:50:44] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
[2023-03-17 01:50:44] [INFO ] Invariant cache hit.
[2023-03-17 01:51:14] [INFO ] Performed 100174/151084 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:51:29] [INFO ] Dead Transitions using invariants and state equation in 45605 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54474 ms. Remains : 1428/1429 places, 151084/151085 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p0) (AND p2 (NOT p3))), (NOT p0), (OR (NOT p1) (NOT p0)), (AND p2 (NOT p3))]
Running random walk in product with property : RERS17pb114-PT-3-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(OR (AND p1 p0 (NOT p3)) (AND p1 (NOT p3) p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 3 s830), p0:(LEQ 1 s548), p3:(LEQ 3 s416), p2:(LEQ s448 s420)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 7 ms.
FORMULA RERS17pb114-PT-3-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS17pb114-PT-3-LTLCardinality-12 finished in 55038 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1035 ms. Remains 1428 /1429 variables (removed 1) and now considering 151084/151085 (removed 1) transitions.
[2023-03-17 01:51:31] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
[2023-03-17 01:51:31] [INFO ] Invariant cache hit.
[2023-03-17 01:51:39] [INFO ] Implicit Places using invariants in 7813 ms returned []
Implicit Place search using SMT only with invariants took 7813 ms to find 0 implicit places.
[2023-03-17 01:51:39] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
[2023-03-17 01:51:39] [INFO ] Invariant cache hit.
[2023-03-17 01:52:09] [INFO ] Performed 98257/151084 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:52:25] [INFO ] Dead Transitions using invariants and state equation in 46302 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55156 ms. Remains : 1428/1429 places, 151084/151085 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RERS17pb114-PT-3-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s482 s107)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 7 ms.
FORMULA RERS17pb114-PT-3-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS17pb114-PT-3-LTLCardinality-13 finished in 55643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1044 ms. Remains 1428 /1429 variables (removed 1) and now considering 151084/151085 (removed 1) transitions.
[2023-03-17 01:52:27] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
[2023-03-17 01:52:27] [INFO ] Invariant cache hit.
[2023-03-17 01:52:34] [INFO ] Implicit Places using invariants in 7770 ms returned []
Implicit Place search using SMT only with invariants took 7771 ms to find 0 implicit places.
[2023-03-17 01:52:34] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
[2023-03-17 01:52:34] [INFO ] Invariant cache hit.
[2023-03-17 01:53:05] [INFO ] Performed 97828/151084 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:53:21] [INFO ] Dead Transitions using invariants and state equation in 46666 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55485 ms. Remains : 1428/1429 places, 151084/151085 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : RERS17pb114-PT-3-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s374)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 7 ms.
FORMULA RERS17pb114-PT-3-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS17pb114-PT-3-LTLCardinality-14 finished in 55950 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))&&((p1 U (p2||G(p1))) U p3)))'
Support contains 5 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Applied a total of 0 rules in 557 ms. Remains 1429 /1429 variables (removed 0) and now considering 151085/151085 (removed 0) transitions.
[2023-03-17 01:53:22] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1429 cols
[2023-03-17 01:53:22] [INFO ] Computed 18 place invariants in 264 ms
[2023-03-17 01:53:30] [INFO ] Implicit Places using invariants in 7778 ms returned []
Implicit Place search using SMT only with invariants took 7780 ms to find 0 implicit places.
[2023-03-17 01:53:30] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-17 01:53:30] [INFO ] Invariant cache hit.
[2023-03-17 01:54:00] [INFO ] Performed 100393/151085 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:54:15] [INFO ] Dead Transitions using invariants and state equation in 45387 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53728 ms. Remains : 1429/1429 places, 151085/151085 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p3) (NOT p0)), true, (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p3)]
Running random walk in product with property : RERS17pb114-PT-3-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p3 p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(LEQ s420 s1200), p2:(AND (LEQ s365 s1325) (GT 1 s192)), p1:(GT 1 s192), p0:(OR (LEQ s420 s1200) (LEQ s365 s1325))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 54930 steps with 27465 reset in 10002 ms.
Product exploration timeout after 53670 steps with 26835 reset in 10002 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p3 p2 p1 p0), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (OR (AND (NOT p3) p2) (AND (NOT p3) p1)))), (X p0), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), true, (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p3) p2) (AND (NOT p3) p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 14 factoid took 251 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS17pb114-PT-3-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS17pb114-PT-3-LTLCardinality-15 finished in 74897 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(p1)))||G(p2)))'
Found a Lengthening insensitive property : RERS17pb114-PT-3-LTLCardinality-09
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p2)]
Support contains 5 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1062 ms. Remains 1428 /1429 variables (removed 1) and now considering 151084/151085 (removed 1) transitions.
[2023-03-17 01:54:38] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
// Phase 1: matrix 84690 rows 1428 cols
[2023-03-17 01:54:38] [INFO ] Computed 18 place invariants in 253 ms
[2023-03-17 01:54:46] [INFO ] Implicit Places using invariants in 7773 ms returned []
Implicit Place search using SMT only with invariants took 7775 ms to find 0 implicit places.
[2023-03-17 01:54:46] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
[2023-03-17 01:54:46] [INFO ] Invariant cache hit.
[2023-03-17 01:55:16] [INFO ] Performed 95252/151084 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:55:34] [INFO ] Dead Transitions using invariants and state equation in 48017 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 56857 ms. Remains : 1428/1429 places, 151084/151085 transitions.
Running random walk in product with property : RERS17pb114-PT-3-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=3, aps=[p1:(LEQ s471 s281), p0:(LEQ s519 s426), p2:(GT 2 s917)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 8233 ms.
Product exploration explored 100000 steps with 0 reset in 8176 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 p2 p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2) p1))), (X p1), (X (AND p0 p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), true, (X (X (AND p0 p2))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 1242 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1011 ms. (steps per millisecond=9 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-17 01:55:54] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
[2023-03-17 01:55:54] [INFO ] Invariant cache hit.
[2023-03-17 01:55:54] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-17 01:55:54] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 01:55:55] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-17 01:56:20] [INFO ] After 24872ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 01:56:20] [INFO ] State equation strengthened by 773 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-17 01:56:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:56:20] [INFO ] After 25858ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 151084/151084 transitions.
Drop transitions removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 1428 transition count 150572
Applied a total of 512 rules in 1289 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/151084 (removed 512) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1293 ms. Remains : 1428/1428 places, 150572/151084 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 981 ms. (steps per millisecond=10 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 3868 steps, run timeout after 3007 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3868 steps, saw 3427 distinct states, run finished after 3007 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-17 01:56:26] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-17 01:56:27] [INFO ] Computed 18 place invariants in 289 ms
[2023-03-17 01:56:27] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-17 01:56:27] [INFO ] After 323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 01:56:27] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-17 01:56:52] [INFO ] After 24639ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 01:56:53] [INFO ] State equation strengthened by 773 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-17 01:56:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:56:53] [INFO ] After 25779ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1253 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1253 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1305 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-17 01:56:55] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 01:56:55] [INFO ] Invariant cache hit.
[2023-03-17 01:57:03] [INFO ] Implicit Places using invariants in 7573 ms returned []
Implicit Place search using SMT only with invariants took 7576 ms to find 0 implicit places.
[2023-03-17 01:57:03] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 01:57:03] [INFO ] Invariant cache hit.
[2023-03-17 01:57:33] [INFO ] Performed 95264/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:57:51] [INFO ] Dead Transitions using invariants and state equation in 47893 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56787 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 p2 p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2) p1))), (X p1), (X (AND p0 p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), true, (X (X (AND p0 p2))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND p2 p0))), (F (AND p2 (NOT p1))), (F (AND p2 (NOT p0))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND p2 (NOT p0) p1)), (F (NOT (AND p2 p0 p1)))]
Knowledge based reduction with 31 factoid took 1413 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 5 out of 1428 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1428/1428 places, 151084/151084 transitions.
Applied a total of 0 rules in 563 ms. Remains 1428 /1428 variables (removed 0) and now considering 151084/151084 (removed 0) transitions.
[2023-03-17 01:57:54] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
// Phase 1: matrix 84690 rows 1428 cols
[2023-03-17 01:57:54] [INFO ] Computed 18 place invariants in 287 ms
[2023-03-17 01:58:02] [INFO ] Implicit Places using invariants in 8449 ms returned []
Implicit Place search using SMT only with invariants took 8451 ms to find 0 implicit places.
[2023-03-17 01:58:02] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
[2023-03-17 01:58:02] [INFO ] Invariant cache hit.
[2023-03-17 01:58:32] [INFO ] Performed 97951/151084 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 01:58:48] [INFO ] Dead Transitions using invariants and state equation in 46191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55209 ms. Remains : 1428/1428 places, 151084/151084 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 p1 p0 p2), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p0 p1)), (X p0), (X (AND p2 p0)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X p1), (X (AND p0 p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p0 p1))), (X (X p0)), true, (X (X p2)), (X (X (AND p2 p0))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 1260 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1294 ms. (steps per millisecond=7 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-17 01:58:53] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
[2023-03-17 01:58:53] [INFO ] Invariant cache hit.
[2023-03-17 01:58:54] [INFO ] After 319ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-17 01:58:54] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-17 01:59:19] [INFO ] After 24498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-17 01:59:19] [INFO ] State equation strengthened by 773 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-17 01:59:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:59:19] [INFO ] After 25675ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 151084/151084 transitions.
Drop transitions removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 1428 transition count 150572
Applied a total of 512 rules in 1385 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/151084 (removed 512) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1388 ms. Remains : 1428/1428 places, 150572/151084 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1050 ms. (steps per millisecond=9 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-17 01:59:23] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-17 01:59:23] [INFO ] Computed 18 place invariants in 281 ms
[2023-03-17 01:59:23] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-17 01:59:23] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 01:59:23] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-17 01:59:48] [INFO ] After 24640ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 01:59:49] [INFO ] State equation strengthened by 773 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-17 01:59:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 01:59:49] [INFO ] After 25641ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1049 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1049 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 935 ms. (steps per millisecond=10 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 4224 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4224 steps, saw 3762 distinct states, run finished after 3003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-17 01:59:55] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 01:59:55] [INFO ] Invariant cache hit.
[2023-03-17 01:59:55] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-17 01:59:55] [INFO ] After 283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 01:59:55] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-17 02:00:20] [INFO ] After 24647ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 02:00:21] [INFO ] State equation strengthened by 773 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-17 02:00:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 02:00:21] [INFO ] After 25648ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1047 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1047 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1054 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-17 02:00:23] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 02:00:23] [INFO ] Invariant cache hit.
[2023-03-17 02:00:30] [INFO ] Implicit Places using invariants in 7753 ms returned []
Implicit Place search using SMT only with invariants took 7754 ms to find 0 implicit places.
[2023-03-17 02:00:30] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 02:00:30] [INFO ] Invariant cache hit.
[2023-03-17 02:01:01] [INFO ] Performed 95802/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 02:01:19] [INFO ] Dead Transitions using invariants and state equation in 48270 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57097 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p0 p1)), (X p0), (X (AND p2 p0)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X p1), (X (AND p0 p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p0 p1))), (X (X p0)), true, (X (X p2)), (X (X (AND p2 p0))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (AND (NOT p1) p2)), (F (AND (NOT p0) p2)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0))), (F (NOT p0)), (F (AND p1 (NOT p0) p2)), (F (NOT (AND p1 p0 p2)))]
Knowledge based reduction with 31 factoid took 1286 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 8360 ms.
Product exploration explored 100000 steps with 0 reset in 8059 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 5 out of 1428 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1428/1428 places, 151084/151084 transitions.
Applied a total of 0 rules in 1106 ms. Remains 1428 /1428 variables (removed 0) and now considering 151084/151084 (removed 0) transitions.
[2023-03-17 02:01:39] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
// Phase 1: matrix 84690 rows 1428 cols
[2023-03-17 02:01:39] [INFO ] Computed 18 place invariants in 290 ms
[2023-03-17 02:02:09] [INFO ] Performed 93149/151084 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 02:02:28] [INFO ] Dead Transitions using invariants and state equation in 48875 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49985 ms. Remains : 1428/1428 places, 151084/151084 transitions.
Support contains 5 out of 1428 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1428/1428 places, 151084/151084 transitions.
Applied a total of 0 rules in 553 ms. Remains 1428 /1428 variables (removed 0) and now considering 151084/151084 (removed 0) transitions.
[2023-03-17 02:02:28] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
[2023-03-17 02:02:28] [INFO ] Invariant cache hit.
[2023-03-17 02:02:36] [INFO ] Implicit Places using invariants in 8071 ms returned []
Implicit Place search using SMT only with invariants took 8072 ms to find 0 implicit places.
[2023-03-17 02:02:37] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
[2023-03-17 02:02:37] [INFO ] Invariant cache hit.
[2023-03-17 02:03:07] [INFO ] Performed 98849/151084 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 02:03:23] [INFO ] Dead Transitions using invariants and state equation in 46377 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55009 ms. Remains : 1428/1428 places, 151084/151084 transitions.
Treatment of property RERS17pb114-PT-3-LTLCardinality-09 finished in 532041 ms.
[2023-03-17 02:03:32] [INFO ] Flatten gal took : 3100 ms
[2023-03-17 02:03:32] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-17 02:03:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1429 places, 151085 transitions and 604235 arcs took 280 ms.
Total runtime 2197958 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2298/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : RERS17pb114-PT-3-LTLCardinality-09

BK_STOP 1679018648934

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name RERS17pb114-PT-3-LTLCardinality-09
ltl formula formula --ltl=/tmp/2298/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1429 places, 151085 transitions and 604235 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 16.320 real 5.130 user 4.590 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2298/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2298/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2298/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2298/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RERS17pb114-PT-3"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is RERS17pb114-PT-3, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-167889201600091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb114-PT-3.tgz
mv RERS17pb114-PT-3 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;