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-167889201800243.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 RERS2020-PT-pb104, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889201800243
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 81M
-rw-r--r-- 1 mcc users 7.5K Feb 26 08:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 08:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 08:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 08:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 08:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Feb 26 08:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 08:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 08:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 80M 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 RERS2020-PT-pb104-LTLCardinality-00
FORMULA_NAME RERS2020-PT-pb104-LTLCardinality-01
FORMULA_NAME RERS2020-PT-pb104-LTLCardinality-02
FORMULA_NAME RERS2020-PT-pb104-LTLCardinality-03
FORMULA_NAME RERS2020-PT-pb104-LTLCardinality-04
FORMULA_NAME RERS2020-PT-pb104-LTLCardinality-05
FORMULA_NAME RERS2020-PT-pb104-LTLCardinality-06
FORMULA_NAME RERS2020-PT-pb104-LTLCardinality-07
FORMULA_NAME RERS2020-PT-pb104-LTLCardinality-08
FORMULA_NAME RERS2020-PT-pb104-LTLCardinality-09
FORMULA_NAME RERS2020-PT-pb104-LTLCardinality-10
FORMULA_NAME RERS2020-PT-pb104-LTLCardinality-11
FORMULA_NAME RERS2020-PT-pb104-LTLCardinality-12
FORMULA_NAME RERS2020-PT-pb104-LTLCardinality-13
FORMULA_NAME RERS2020-PT-pb104-LTLCardinality-14
FORMULA_NAME RERS2020-PT-pb104-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679089828973

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=RERS2020-PT-pb104
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 21:50:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 21:50:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 21:50:33] [INFO ] Load time of PNML (sax parser for PT used): 2301 ms
[2023-03-17 21:50:33] [INFO ] Transformed 1353 places.
[2023-03-17 21:50:33] [INFO ] Transformed 143642 transitions.
[2023-03-17 21:50:33] [INFO ] Found NUPN structural information;
[2023-03-17 21:50:33] [INFO ] Parsed PT model containing 1353 places and 143642 transitions and 572292 arcs in 2820 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 13930 transitions
Reduce redundant transitions removed 13930 transitions.
FORMULA RERS2020-PT-pb104-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb104-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb104-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb104-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb104-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb104-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb104-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb104-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb104-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb104-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb104-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 1353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1353/1353 places, 129712/129712 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 1345 transition count 129712
Applied a total of 8 rules in 436 ms. Remains 1345 /1353 variables (removed 8) and now considering 129712/129712 (removed 0) transitions.
[2023-03-17 21:50:35] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
// Phase 1: matrix 96758 rows 1345 cols
[2023-03-17 21:50:36] [INFO ] Computed 9 place invariants in 656 ms
[2023-03-17 21:50:40] [INFO ] Implicit Places using invariants in 5246 ms returned []
Implicit Place search using SMT only with invariants took 5272 ms to find 0 implicit places.
[2023-03-17 21:50:40] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
[2023-03-17 21:50:40] [INFO ] Invariant cache hit.
[2023-03-17 21:51:11] [INFO ] Performed 85654/129712 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 21:51:26] [INFO ] Dead Transitions using invariants and state equation in 45977 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1345/1353 places, 129712/129712 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51704 ms. Remains : 1345/1353 places, 129712/129712 transitions.
Support contains 24 out of 1345 places after structural reductions.
[2023-03-17 21:51:31] [INFO ] Flatten gal took : 3444 ms
[2023-03-17 21:51:34] [INFO ] Flatten gal took : 3238 ms
[2023-03-17 21:51:41] [INFO ] Input system was already deterministic with 129712 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1653 ms. (steps per millisecond=6 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 10) 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 10) 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 10) 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 10) seen :0
Running SMT prover for 10 properties.
[2023-03-17 21:51:45] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
[2023-03-17 21:51:45] [INFO ] Invariant cache hit.
[2023-03-17 21:51:45] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2023-03-17 21:52:10] [INFO ] After 24382ms SMT Verify possible using state equation in real domain returned unsat :1 sat :8
[2023-03-17 21:52:11] [INFO ] State equation strengthened by 3455 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 21:52:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:52:11] [INFO ] After 26636ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 17 out of 1345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1345/1345 places, 129712/129712 transitions.
Drop transitions removed 2126 transitions
Reduce isomorphic transitions removed 2126 transitions.
Iterating post reduction 0 with 2126 rules applied. Total rules applied 2126 place count 1345 transition count 127586
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 2126 place count 1345 transition count 127577
Deduced a syphon composed of 9 places in 79 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 2144 place count 1336 transition count 127577
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 61 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 1 with 44 rules applied. Total rules applied 2188 place count 1314 transition count 127555
Free-agglomeration rule applied 19 times.
Iterating global reduction 1 with 19 rules applied. Total rules applied 2207 place count 1314 transition count 127536
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 2231 place count 1295 transition count 127531
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2235 place count 1295 transition count 127527
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 2255 place count 1291 transition count 127511
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2256 place count 1291 transition count 127510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2257 place count 1290 transition count 127510
Free-agglomeration rule (complex) applied 30 times with reduction of 583 identical transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 2287 place count 1290 transition count 133109
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 643 transitions
Reduce isomorphic transitions removed 648 transitions.
Iterating post reduction 4 with 678 rules applied. Total rules applied 2965 place count 1260 transition count 132461
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2966 place count 1259 transition count 132460
Applied a total of 2966 rules in 7416 ms. Remains 1259 /1345 variables (removed 86) and now considering 132460/129712 (removed -2748) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7420 ms. Remains : 1259/1345 places, 132460/129712 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 986 ms. (steps per millisecond=10 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) seen :0
Interrupted probabilistic random walk after 13467 steps, run timeout after 6003 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 13467 steps, saw 10549 distinct states, run finished after 6006 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-17 21:52:27] [INFO ] Flow matrix only has 101399 transitions (discarded 31061 similar events)
// Phase 1: matrix 101399 rows 1259 cols
[2023-03-17 21:52:27] [INFO ] Computed 9 place invariants in 481 ms
[2023-03-17 21:52:28] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2023-03-17 21:52:52] [INFO ] After 24478ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8
[2023-03-17 21:52:53] [INFO ] State equation strengthened by 3595 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 21:52:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:52:53] [INFO ] After 25591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 17 out of 1259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1259/1259 places, 132460/132460 transitions.
Applied a total of 0 rules in 568 ms. Remains 1259 /1259 variables (removed 0) and now considering 132460/132460 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 568 ms. Remains : 1259/1259 places, 132460/132460 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1259/1259 places, 132460/132460 transitions.
Applied a total of 0 rules in 570 ms. Remains 1259 /1259 variables (removed 0) and now considering 132460/132460 (removed 0) transitions.
[2023-03-17 21:52:54] [INFO ] Flow matrix only has 101399 transitions (discarded 31061 similar events)
[2023-03-17 21:52:54] [INFO ] Invariant cache hit.
[2023-03-17 21:52:59] [INFO ] Implicit Places using invariants in 4465 ms returned []
Implicit Place search using SMT only with invariants took 4471 ms to find 0 implicit places.
[2023-03-17 21:52:59] [INFO ] Flow matrix only has 101399 transitions (discarded 31061 similar events)
[2023-03-17 21:52:59] [INFO ] Invariant cache hit.
[2023-03-17 21:53:29] [INFO ] Performed 87402/132460 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 21:53:43] [INFO ] Dead Transitions using invariants and state equation in 44467 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49522 ms. Remains : 1259/1259 places, 132460/132460 transitions.
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
Computed a total of 389 stabilizing places and 51386 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(G(p1)&&F(G(p2)))))'
Support contains 5 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 129712/129712 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 1344 transition count 129702
Deduced a syphon composed of 9 places in 51 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 1335 transition count 129702
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 50 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 62 place count 1313 transition count 129680
Applied a total of 62 rules in 1831 ms. Remains 1313 /1345 variables (removed 32) and now considering 129680/129712 (removed 32) transitions.
[2023-03-17 21:53:46] [INFO ] Flow matrix only has 96724 transitions (discarded 32956 similar events)
// Phase 1: matrix 96724 rows 1313 cols
[2023-03-17 21:53:46] [INFO ] Computed 9 place invariants in 383 ms
[2023-03-17 21:53:50] [INFO ] Implicit Places using invariants in 4407 ms returned []
Implicit Place search using SMT only with invariants took 4408 ms to find 0 implicit places.
[2023-03-17 21:53:50] [INFO ] Flow matrix only has 96724 transitions (discarded 32956 similar events)
[2023-03-17 21:53:50] [INFO ] Invariant cache hit.
[2023-03-17 21:54:20] [INFO ] Performed 85035/129680 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 21:54:35] [INFO ] Dead Transitions using invariants and state equation in 45064 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1313/1345 places, 129680/129712 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51309 ms. Remains : 1313/1345 places, 129680/129712 transitions.
Stuttering acceptance computed with spot in 393 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : RERS2020-PT-pb104-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s458 0) (EQ s1312 1)), p1:(OR (EQ s1173 0) (EQ s1190 1)), p2:(NEQ s720 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 7663 ms.
Product exploration explored 100000 steps with 0 reset in 7855 ms.
Computed a total of 368 stabilizing places and 51365 stable transitions
Computed a total of 368 stabilizing places and 51365 stable transitions
Detected a total of 368/1313 stabilizing places and 51365/129680 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p2)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 940 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 5 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (OR (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 899 ms. (steps per millisecond=11 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 7) 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 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
[2023-03-17 21:54:55] [INFO ] Flow matrix only has 96724 transitions (discarded 32956 similar events)
[2023-03-17 21:54:55] [INFO ] Invariant cache hit.
[2023-03-17 21:54:55] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2023-03-17 21:55:20] [INFO ] After 24829ms SMT Verify possible using state equation in real domain returned unsat :1 sat :5 real:1
[2023-03-17 21:55:21] [INFO ] State equation strengthened by 3453 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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 21:55:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:55:21] [INFO ] After 26424ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1313/1313 places, 129680/129680 transitions.
Drop transitions removed 2126 transitions
Reduce isomorphic transitions removed 2126 transitions.
Iterating post reduction 0 with 2126 rules applied. Total rules applied 2126 place count 1313 transition count 127554
Free-agglomeration rule applied 19 times.
Iterating global reduction 1 with 19 rules applied. Total rules applied 2145 place count 1313 transition count 127535
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 2169 place count 1294 transition count 127530
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2173 place count 1294 transition count 127526
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 2193 place count 1290 transition count 127510
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2194 place count 1290 transition count 127509
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2195 place count 1289 transition count 127509
Free-agglomeration rule (complex) applied 32 times with reduction of 678 identical transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 2227 place count 1289 transition count 133681
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 804 transitions
Reduce isomorphic transitions removed 809 transitions.
Iterating post reduction 4 with 841 rules applied. Total rules applied 3068 place count 1257 transition count 132872
Applied a total of 3068 rules in 4438 ms. Remains 1257 /1313 variables (removed 56) and now considering 132872/129680 (removed -3192) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4444 ms. Remains : 1257/1313 places, 132872/129680 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 972 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 140 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) 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 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 111 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 5804 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 5804 steps, saw 4623 distinct states, run finished after 3002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-17 21:55:31] [INFO ] Flow matrix only has 101791 transitions (discarded 31081 similar events)
// Phase 1: matrix 101791 rows 1257 cols
[2023-03-17 21:55:31] [INFO ] Computed 9 place invariants in 487 ms
[2023-03-17 21:55:31] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2023-03-17 21:55:56] [INFO ] After 24603ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:1
[2023-03-17 21:55:57] [INFO ] State equation strengthened by 3611 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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 21:55:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:55:57] [INFO ] After 25599ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1257/1257 places, 132872/132872 transitions.
Applied a total of 0 rules in 621 ms. Remains 1257 /1257 variables (removed 0) and now considering 132872/132872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 622 ms. Remains : 1257/1257 places, 132872/132872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1257/1257 places, 132872/132872 transitions.
Applied a total of 0 rules in 585 ms. Remains 1257 /1257 variables (removed 0) and now considering 132872/132872 (removed 0) transitions.
[2023-03-17 21:55:58] [INFO ] Flow matrix only has 101791 transitions (discarded 31081 similar events)
[2023-03-17 21:55:58] [INFO ] Invariant cache hit.
[2023-03-17 21:56:02] [INFO ] Implicit Places using invariants in 4367 ms returned []
Implicit Place search using SMT only with invariants took 4368 ms to find 0 implicit places.
[2023-03-17 21:56:02] [INFO ] Flow matrix only has 101791 transitions (discarded 31081 similar events)
[2023-03-17 21:56:02] [INFO ] Invariant cache hit.
[2023-03-17 21:56:33] [INFO ] Performed 80649/132872 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 21:56:50] [INFO ] Dead Transitions using invariants and state equation in 48153 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53116 ms. Remains : 1257/1257 places, 132872/132872 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p2)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 22 factoid took 894 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (OR (NOT p2) (NOT p1))]
Support contains 5 out of 1313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1313/1313 places, 129680/129680 transitions.
Applied a total of 0 rules in 520 ms. Remains 1313 /1313 variables (removed 0) and now considering 129680/129680 (removed 0) transitions.
[2023-03-17 21:56:52] [INFO ] Flow matrix only has 96724 transitions (discarded 32956 similar events)
// Phase 1: matrix 96724 rows 1313 cols
[2023-03-17 21:56:53] [INFO ] Computed 9 place invariants in 351 ms
[2023-03-17 21:56:57] [INFO ] Implicit Places using invariants in 4674 ms returned []
Implicit Place search using SMT only with invariants took 4675 ms to find 0 implicit places.
[2023-03-17 21:56:57] [INFO ] Flow matrix only has 96724 transitions (discarded 32956 similar events)
[2023-03-17 21:56:57] [INFO ] Invariant cache hit.
[2023-03-17 21:57:27] [INFO ] Performed 84326/129680 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 21:57:43] [INFO ] Dead Transitions using invariants and state equation in 45789 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50989 ms. Remains : 1313/1313 places, 129680/129680 transitions.
Computed a total of 368 stabilizing places and 51365 stable transitions
Computed a total of 368 stabilizing places and 51365 stable transitions
Detected a total of 368/1313 stabilizing places and 51365/129680 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p2)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 791 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (OR (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1047 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 119 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
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 121 ms. (steps per millisecond=82 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-17 21:57:46] [INFO ] Flow matrix only has 96724 transitions (discarded 32956 similar events)
[2023-03-17 21:57:46] [INFO ] Invariant cache hit.
[2023-03-17 21:57:47] [INFO ] [Real]Absence check using 9 positive place invariants in 11 ms returned sat
[2023-03-17 21:58:11] [INFO ] After 24630ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:1
[2023-03-17 21:58:13] [INFO ] State equation strengthened by 3453 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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 21:58:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:58:13] [INFO ] After 26189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1313/1313 places, 129680/129680 transitions.
Drop transitions removed 2126 transitions
Reduce isomorphic transitions removed 2126 transitions.
Iterating post reduction 0 with 2126 rules applied. Total rules applied 2126 place count 1313 transition count 127554
Free-agglomeration rule applied 19 times.
Iterating global reduction 1 with 19 rules applied. Total rules applied 2145 place count 1313 transition count 127535
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 2169 place count 1294 transition count 127530
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2173 place count 1294 transition count 127526
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 2193 place count 1290 transition count 127510
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2194 place count 1290 transition count 127509
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2195 place count 1289 transition count 127509
Free-agglomeration rule (complex) applied 32 times with reduction of 678 identical transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 2227 place count 1289 transition count 133681
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 804 transitions
Reduce isomorphic transitions removed 809 transitions.
Iterating post reduction 4 with 841 rules applied. Total rules applied 3068 place count 1257 transition count 132872
Applied a total of 3068 rules in 5585 ms. Remains 1257 /1313 variables (removed 56) and now considering 132872/129680 (removed -3192) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5588 ms. Remains : 1257/1313 places, 132872/129680 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1160 ms. (steps per millisecond=8 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 4940 steps, run timeout after 3001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4940 steps, saw 3928 distinct states, run finished after 3002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-17 21:58:23] [INFO ] Flow matrix only has 101791 transitions (discarded 31081 similar events)
// Phase 1: matrix 101791 rows 1257 cols
[2023-03-17 21:58:24] [INFO ] Computed 9 place invariants in 594 ms
[2023-03-17 21:58:24] [INFO ] [Real]Absence check using 9 positive place invariants in 11 ms returned sat
[2023-03-17 21:58:49] [INFO ] After 24615ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:1
[2023-03-17 21:58:50] [INFO ] State equation strengthened by 3611 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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 21:58:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:58:50] [INFO ] After 26143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1257/1257 places, 132872/132872 transitions.
Applied a total of 0 rules in 776 ms. Remains 1257 /1257 variables (removed 0) and now considering 132872/132872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 776 ms. Remains : 1257/1257 places, 132872/132872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1257/1257 places, 132872/132872 transitions.
Applied a total of 0 rules in 691 ms. Remains 1257 /1257 variables (removed 0) and now considering 132872/132872 (removed 0) transitions.
[2023-03-17 21:58:52] [INFO ] Flow matrix only has 101791 transitions (discarded 31081 similar events)
[2023-03-17 21:58:52] [INFO ] Invariant cache hit.
[2023-03-17 21:58:56] [INFO ] Implicit Places using invariants in 4713 ms returned []
Implicit Place search using SMT only with invariants took 4715 ms to find 0 implicit places.
[2023-03-17 21:58:56] [INFO ] Flow matrix only has 101791 transitions (discarded 31081 similar events)
[2023-03-17 21:58:56] [INFO ] Invariant cache hit.
[2023-03-17 21:59:27] [INFO ] Performed 81550/132872 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 21:59:45] [INFO ] Dead Transitions using invariants and state equation in 48319 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53740 ms. Remains : 1257/1257 places, 132872/132872 transitions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p2)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 18 factoid took 799 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (OR (NOT p2) (NOT p1))]
Product exploration timeout after 94870 steps with 0 reset in 10001 ms.
Product exploration timeout after 97760 steps with 0 reset in 10001 ms.
Support contains 5 out of 1313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1313/1313 places, 129680/129680 transitions.
Applied a total of 0 rules in 663 ms. Remains 1313 /1313 variables (removed 0) and now considering 129680/129680 (removed 0) transitions.
[2023-03-17 22:00:07] [INFO ] Flow matrix only has 96724 transitions (discarded 32956 similar events)
// Phase 1: matrix 96724 rows 1313 cols
[2023-03-17 22:00:07] [INFO ] Computed 9 place invariants in 372 ms
[2023-03-17 22:00:11] [INFO ] Implicit Places using invariants in 4749 ms returned []
Implicit Place search using SMT only with invariants took 4754 ms to find 0 implicit places.
[2023-03-17 22:00:12] [INFO ] Flow matrix only has 96724 transitions (discarded 32956 similar events)
[2023-03-17 22:00:12] [INFO ] Invariant cache hit.
[2023-03-17 22:00:42] [INFO ] Performed 79206/129680 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 22:01:01] [INFO ] Dead Transitions using invariants and state equation in 49299 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54722 ms. Remains : 1313/1313 places, 129680/129680 transitions.
Treatment of property RERS2020-PT-pb104-LTLCardinality-00 finished in 442272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p1&&G(!p2))))))'
Support contains 6 out of 1345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1345/1345 places, 129712/129712 transitions.
Applied a total of 0 rules in 271 ms. Remains 1345 /1345 variables (removed 0) and now considering 129712/129712 (removed 0) transitions.
[2023-03-17 22:01:06] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
// Phase 1: matrix 96758 rows 1345 cols
[2023-03-17 22:01:07] [INFO ] Computed 9 place invariants in 443 ms
[2023-03-17 22:01:11] [INFO ] Implicit Places using invariants in 4792 ms returned []
Implicit Place search using SMT only with invariants took 4793 ms to find 0 implicit places.
[2023-03-17 22:01:11] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
[2023-03-17 22:01:11] [INFO ] Invariant cache hit.
[2023-03-17 22:01:41] [INFO ] Performed 83029/129712 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 22:01:59] [INFO ] Dead Transitions using invariants and state equation in 47571 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52640 ms. Remains : 1345/1345 places, 129712/129712 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), p2, (OR (NOT p1) p2)]
Running random walk in product with property : RERS2020-PT-pb104-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) p2), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(OR (EQ s452 0) (EQ s346 1)), p2:(OR (EQ s114 0) (EQ s1101 1)), p1:(OR (EQ s237 0) (EQ s791 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 4 ms.
FORMULA RERS2020-PT-pb104-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb104-LTLCardinality-04 finished in 53013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(F((p0&&F(p1)))))))))'
Support contains 5 out of 1345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1345/1345 places, 129712/129712 transitions.
Applied a total of 0 rules in 223 ms. Remains 1345 /1345 variables (removed 0) and now considering 129712/129712 (removed 0) transitions.
[2023-03-17 22:01:59] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
[2023-03-17 22:01:59] [INFO ] Invariant cache hit.
[2023-03-17 22:02:04] [INFO ] Implicit Places using invariants in 4406 ms returned []
Implicit Place search using SMT only with invariants took 4408 ms to find 0 implicit places.
[2023-03-17 22:02:04] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
[2023-03-17 22:02:04] [INFO ] Invariant cache hit.
[2023-03-17 22:02:34] [INFO ] Performed 82524/129712 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 22:02:51] [INFO ] Dead Transitions using invariants and state equation in 47203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51840 ms. Remains : 1345/1345 places, 129712/129712 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : RERS2020-PT-pb104-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s844 1), p1:(AND (NEQ s1100 0) (NEQ s137 1) (OR (EQ s956 0) (EQ s283 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 159 steps with 0 reset in 17 ms.
FORMULA RERS2020-PT-pb104-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb104-LTLCardinality-07 finished in 52329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(G(p0)))&&(G(F(p1))||(F(p1)&&F(!p0)))))))'
Support contains 3 out of 1345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1345/1345 places, 129712/129712 transitions.
Applied a total of 0 rules in 263 ms. Remains 1345 /1345 variables (removed 0) and now considering 129712/129712 (removed 0) transitions.
[2023-03-17 22:02:52] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
[2023-03-17 22:02:52] [INFO ] Invariant cache hit.
[2023-03-17 22:02:56] [INFO ] Implicit Places using invariants in 4333 ms returned []
Implicit Place search using SMT only with invariants took 4334 ms to find 0 implicit places.
[2023-03-17 22:02:56] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
[2023-03-17 22:02:56] [INFO ] Invariant cache hit.
[2023-03-17 22:03:26] [INFO ] Performed 82633/129712 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 22:03:43] [INFO ] Dead Transitions using invariants and state equation in 47222 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51828 ms. Remains : 1345/1345 places, 129712/129712 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p0 (NOT p1)), (NOT p0), true, (AND (NOT p1) p0)]
Running random walk in product with property : RERS2020-PT-pb104-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 8}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(NEQ s1123 1), p0:(OR (EQ s814 0) (EQ s979 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 7739 ms.
Product exploration explored 100000 steps with 0 reset in 6819 ms.
Computed a total of 389 stabilizing places and 51386 stable transitions
Computed a total of 389 stabilizing places and 51386 stable transitions
Detected a total of 389/1345 stabilizing places and 51386/129712 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 242 ms. Reduced automaton from 9 states, 13 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (NOT p0), true, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 843 ms. (steps per millisecond=11 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 22:04:01] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
[2023-03-17 22:04:01] [INFO ] Invariant cache hit.
[2023-03-17 22:04:01] [INFO ] [Real]Absence check using 9 positive place invariants in 15 ms returned sat
[2023-03-17 22:04:26] [INFO ] After 25020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 1345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1345/1345 places, 129712/129712 transitions.
Drop transitions removed 2126 transitions
Reduce isomorphic transitions removed 2126 transitions.
Iterating post reduction 0 with 2126 rules applied. Total rules applied 2126 place count 1345 transition count 127586
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 2126 place count 1345 transition count 127577
Deduced a syphon composed of 9 places in 53 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 2144 place count 1336 transition count 127577
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 50 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 1 with 44 rules applied. Total rules applied 2188 place count 1314 transition count 127555
Free-agglomeration rule applied 19 times.
Iterating global reduction 1 with 19 rules applied. Total rules applied 2207 place count 1314 transition count 127536
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 2231 place count 1295 transition count 127531
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2235 place count 1295 transition count 127527
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 2255 place count 1291 transition count 127511
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2256 place count 1291 transition count 127510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2257 place count 1290 transition count 127510
Free-agglomeration rule (complex) applied 31 times with reduction of 678 identical transitions.
Iterating global reduction 4 with 31 rules applied. Total rules applied 2288 place count 1290 transition count 133522
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 709 transitions
Reduce isomorphic transitions removed 714 transitions.
Iterating post reduction 4 with 745 rules applied. Total rules applied 3033 place count 1259 transition count 132808
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3034 place count 1258 transition count 132807
Applied a total of 3034 rules in 5940 ms. Remains 1258 /1345 variables (removed 87) and now considering 132807/129712 (removed -3095) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5943 ms. Remains : 1258/1345 places, 132807/129712 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 881 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 6593 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6593 steps, saw 5184 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 22:04:36] [INFO ] Flow matrix only has 101729 transitions (discarded 31078 similar events)
// Phase 1: matrix 101729 rows 1258 cols
[2023-03-17 22:04:36] [INFO ] Computed 9 place invariants in 582 ms
[2023-03-17 22:04:37] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2023-03-17 22:05:01] [INFO ] After 25027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 1258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1258/1258 places, 132807/132807 transitions.
Applied a total of 0 rules in 595 ms. Remains 1258 /1258 variables (removed 0) and now considering 132807/132807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 595 ms. Remains : 1258/1258 places, 132807/132807 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1258/1258 places, 132807/132807 transitions.
Applied a total of 0 rules in 571 ms. Remains 1258 /1258 variables (removed 0) and now considering 132807/132807 (removed 0) transitions.
[2023-03-17 22:05:03] [INFO ] Flow matrix only has 101729 transitions (discarded 31078 similar events)
[2023-03-17 22:05:03] [INFO ] Invariant cache hit.
[2023-03-17 22:05:07] [INFO ] Implicit Places using invariants in 4190 ms returned []
Implicit Place search using SMT only with invariants took 4191 ms to find 0 implicit places.
[2023-03-17 22:05:07] [INFO ] Flow matrix only has 101729 transitions (discarded 31078 similar events)
[2023-03-17 22:05:07] [INFO ] Invariant cache hit.
[2023-03-17 22:05:37] [INFO ] Performed 86324/132807 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 22:05:52] [INFO ] Dead Transitions using invariants and state equation in 44967 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49743 ms. Remains : 1258/1258 places, 132807/132807 transitions.
Knowledge obtained : [(AND p1 p0), true, (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 278 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (NOT p0), true, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (NOT p0), true, (AND p0 (NOT p1))]
Support contains 3 out of 1345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1345/1345 places, 129712/129712 transitions.
Applied a total of 0 rules in 177 ms. Remains 1345 /1345 variables (removed 0) and now considering 129712/129712 (removed 0) transitions.
[2023-03-17 22:05:53] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
// Phase 1: matrix 96758 rows 1345 cols
[2023-03-17 22:05:53] [INFO ] Computed 9 place invariants in 387 ms
[2023-03-17 22:05:57] [INFO ] Implicit Places using invariants in 4446 ms returned []
Implicit Place search using SMT only with invariants took 4448 ms to find 0 implicit places.
[2023-03-17 22:05:57] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
[2023-03-17 22:05:57] [INFO ] Invariant cache hit.
[2023-03-17 22:06:28] [INFO ] Performed 82998/129712 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 22:06:45] [INFO ] Dead Transitions using invariants and state equation in 47451 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52081 ms. Remains : 1345/1345 places, 129712/129712 transitions.
Computed a total of 389 stabilizing places and 51386 stable transitions
Computed a total of 389 stabilizing places and 51386 stable transitions
Detected a total of 389/1345 stabilizing places and 51386/129712 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (NOT p0), true, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 860 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 22:06:47] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
[2023-03-17 22:06:47] [INFO ] Invariant cache hit.
[2023-03-17 22:06:47] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2023-03-17 22:07:12] [INFO ] After 24794ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 22:07:13] [INFO ] State equation strengthened by 3455 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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 22:07:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 22:07:13] [INFO ] After 25626ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 1345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1345/1345 places, 129712/129712 transitions.
Drop transitions removed 2126 transitions
Reduce isomorphic transitions removed 2126 transitions.
Iterating post reduction 0 with 2126 rules applied. Total rules applied 2126 place count 1345 transition count 127586
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 2126 place count 1345 transition count 127577
Deduced a syphon composed of 9 places in 51 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 2144 place count 1336 transition count 127577
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 51 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 1 with 44 rules applied. Total rules applied 2188 place count 1314 transition count 127555
Free-agglomeration rule applied 19 times.
Iterating global reduction 1 with 19 rules applied. Total rules applied 2207 place count 1314 transition count 127536
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 2231 place count 1295 transition count 127531
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2235 place count 1295 transition count 127527
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 2255 place count 1291 transition count 127511
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2256 place count 1291 transition count 127510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2257 place count 1290 transition count 127510
Free-agglomeration rule (complex) applied 31 times with reduction of 678 identical transitions.
Iterating global reduction 4 with 31 rules applied. Total rules applied 2288 place count 1290 transition count 133522
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 709 transitions
Reduce isomorphic transitions removed 714 transitions.
Iterating post reduction 4 with 745 rules applied. Total rules applied 3033 place count 1259 transition count 132808
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3034 place count 1258 transition count 132807
Applied a total of 3034 rules in 5751 ms. Remains 1258 /1345 variables (removed 87) and now considering 132807/129712 (removed -3095) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5754 ms. Remains : 1258/1345 places, 132807/129712 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 798 ms. (steps per millisecond=12 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5699 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 5699 steps, saw 4541 distinct states, run finished after 3003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 22:07:23] [INFO ] Flow matrix only has 101729 transitions (discarded 31078 similar events)
// Phase 1: matrix 101729 rows 1258 cols
[2023-03-17 22:07:23] [INFO ] Computed 9 place invariants in 474 ms
[2023-03-17 22:07:23] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2023-03-17 22:07:48] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 1258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1258/1258 places, 132807/132807 transitions.
Applied a total of 0 rules in 576 ms. Remains 1258 /1258 variables (removed 0) and now considering 132807/132807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 578 ms. Remains : 1258/1258 places, 132807/132807 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1258/1258 places, 132807/132807 transitions.
Applied a total of 0 rules in 563 ms. Remains 1258 /1258 variables (removed 0) and now considering 132807/132807 (removed 0) transitions.
[2023-03-17 22:07:49] [INFO ] Flow matrix only has 101729 transitions (discarded 31078 similar events)
[2023-03-17 22:07:49] [INFO ] Invariant cache hit.
[2023-03-17 22:07:54] [INFO ] Implicit Places using invariants in 4341 ms returned []
Implicit Place search using SMT only with invariants took 4344 ms to find 0 implicit places.
[2023-03-17 22:07:54] [INFO ] Flow matrix only has 101729 transitions (discarded 31078 similar events)
[2023-03-17 22:07:54] [INFO ] Invariant cache hit.
[2023-03-17 22:08:24] [INFO ] Performed 83773/132807 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 22:08:41] [INFO ] Dead Transitions using invariants and state equation in 47167 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52088 ms. Remains : 1258/1258 places, 132807/132807 transitions.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (NOT p0), true, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (NOT p0), true, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (NOT p0), true, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 6665 ms.
Product exploration explored 100000 steps with 0 reset in 6882 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (NOT p0), true, (AND p0 (NOT p1))]
Support contains 3 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 129712/129712 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 66 ms
Iterating global reduction 0 with 31 rules applied. Total rules applied 31 place count 1345 transition count 129712
Deduced a syphon composed of 31 places in 51 ms
Applied a total of 31 rules in 1623 ms. Remains 1345 /1345 variables (removed 0) and now considering 129712/129712 (removed 0) transitions.
[2023-03-17 22:08:58] [INFO ] Flow matrix only has 96756 transitions (discarded 32956 similar events)
// Phase 1: matrix 96756 rows 1345 cols
[2023-03-17 22:08:58] [INFO ] Computed 9 place invariants in 553 ms
[2023-03-17 22:09:28] [INFO ] Performed 84789/129712 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 22:09:43] [INFO ] Dead Transitions using invariants and state equation in 45508 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1345/1345 places, 129712/129712 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47135 ms. Remains : 1345/1345 places, 129712/129712 transitions.
Support contains 3 out of 1345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1345/1345 places, 129712/129712 transitions.
Applied a total of 0 rules in 160 ms. Remains 1345 /1345 variables (removed 0) and now considering 129712/129712 (removed 0) transitions.
[2023-03-17 22:09:43] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
// Phase 1: matrix 96758 rows 1345 cols
[2023-03-17 22:09:44] [INFO ] Computed 9 place invariants in 363 ms
[2023-03-17 22:09:48] [INFO ] Implicit Places using invariants in 4352 ms returned []
Implicit Place search using SMT only with invariants took 4354 ms to find 0 implicit places.
[2023-03-17 22:09:48] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
[2023-03-17 22:09:48] [INFO ] Invariant cache hit.
[2023-03-17 22:10:18] [INFO ] Performed 86597/129712 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 22:10:33] [INFO ] Dead Transitions using invariants and state equation in 44962 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49479 ms. Remains : 1345/1345 places, 129712/129712 transitions.
Treatment of property RERS2020-PT-pb104-LTLCardinality-11 finished in 465455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(X(X(p1)) U ((X(X(p1))&&G(p2))||X(X(G(p1)))))))'
Support contains 5 out of 1345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1345/1345 places, 129712/129712 transitions.
Applied a total of 0 rules in 158 ms. Remains 1345 /1345 variables (removed 0) and now considering 129712/129712 (removed 0) transitions.
[2023-03-17 22:10:37] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
[2023-03-17 22:10:37] [INFO ] Invariant cache hit.
[2023-03-17 22:10:41] [INFO ] Implicit Places using invariants in 4335 ms returned []
Implicit Place search using SMT only with invariants took 4338 ms to find 0 implicit places.
[2023-03-17 22:10:41] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
[2023-03-17 22:10:41] [INFO ] Invariant cache hit.
[2023-03-17 22:11:12] [INFO ] Performed 82180/129712 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 22:11:28] [INFO ] Dead Transitions using invariants and state equation in 46893 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51396 ms. Remains : 1345/1345 places, 129712/129712 transitions.
Stuttering acceptance computed with spot in 569 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : RERS2020-PT-pb104-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 10}], [{ cond=true, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={1} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={1} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 12}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=p0, acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p0 p2), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p0 p2), acceptance={} source=8 dest: 8}, { cond=(AND p0 p2), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=9 dest: 11}, { cond=(AND p0 p2), acceptance={} source=9 dest: 13}], [{ cond=true, acceptance={0, 1} source=10 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=11 dest: 10}, { cond=(AND p2 (NOT p1)), acceptance={} source=11 dest: 14}], [{ cond=(NOT p0), acceptance={} source=12 dest: 10}, { cond=p0, acceptance={} source=12 dest: 12}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=13 dest: 10}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=13 dest: 12}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=13 dest: 14}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=13 dest: 15}], [{ cond=(AND (NOT p2) p1), acceptance={} source=14 dest: 10}, { cond=(AND p2 p1), acceptance={} source=14 dest: 14}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=15 dest: 10}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=15 dest: 12}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=15 dest: 14}, { cond=(AND p0 p2 p1), acceptance={} source=15 dest: 15}]], initial=7, aps=[p0:(OR (EQ s627 0) (EQ s465 1)), p1:(OR (EQ s990 0) (EQ s35 1)), p2:(NEQ s914 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 99420 steps with 24828 reset in 10001 ms.
Product exploration explored 100000 steps with 25024 reset in 9282 ms.
Computed a total of 389 stabilizing places and 51386 stable transitions
Computed a total of 389 stabilizing places and 51386 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p2 (NOT p1)))), (X (X p2)), (X (X (AND p0 p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1445 ms. Reduced automaton from 16 states, 52 edges and 3 AP (stutter sensitive) to 16 states, 52 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 572 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1024 ms. (steps per millisecond=9 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 7208 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7208 steps, saw 5526 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 21 properties.
[2023-03-17 22:11:56] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
[2023-03-17 22:11:56] [INFO ] Invariant cache hit.
[2023-03-17 22:11:56] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2023-03-17 22:12:21] [INFO ] After 24230ms SMT Verify possible using state equation in real domain returned unsat :7 sat :11 real:3
[2023-03-17 22:12:22] [INFO ] State equation strengthened by 3455 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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 22:12:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 22:12:22] [INFO ] After 26040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1345/1345 places, 129712/129712 transitions.
Drop transitions removed 2126 transitions
Reduce isomorphic transitions removed 2126 transitions.
Iterating post reduction 0 with 2126 rules applied. Total rules applied 2126 place count 1345 transition count 127586
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 2126 place count 1345 transition count 127577
Deduced a syphon composed of 9 places in 75 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 2144 place count 1336 transition count 127577
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 59 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 1 with 44 rules applied. Total rules applied 2188 place count 1314 transition count 127555
Free-agglomeration rule applied 19 times.
Iterating global reduction 1 with 19 rules applied. Total rules applied 2207 place count 1314 transition count 127536
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 2231 place count 1295 transition count 127531
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2235 place count 1295 transition count 127527
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 2255 place count 1291 transition count 127511
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2256 place count 1291 transition count 127510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2257 place count 1290 transition count 127510
Free-agglomeration rule (complex) applied 32 times with reduction of 678 identical transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 2289 place count 1290 transition count 133682
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 804 transitions
Reduce isomorphic transitions removed 809 transitions.
Iterating post reduction 4 with 841 rules applied. Total rules applied 3130 place count 1258 transition count 132873
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3131 place count 1257 transition count 132872
Applied a total of 3131 rules in 6474 ms. Remains 1257 /1345 variables (removed 88) and now considering 132872/129712 (removed -3160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6478 ms. Remains : 1257/1345 places, 132872/129712 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 1034 ms. (steps per millisecond=9 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 14) 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 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 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 164 ms. (steps per millisecond=60 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 21347 steps, run timeout after 9004 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 21347 steps, saw 16282 distinct states, run finished after 9004 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 14 properties.
[2023-03-17 22:12:40] [INFO ] Flow matrix only has 101791 transitions (discarded 31081 similar events)
// Phase 1: matrix 101791 rows 1257 cols
[2023-03-17 22:12:41] [INFO ] Computed 9 place invariants in 432 ms
[2023-03-17 22:12:41] [INFO ] [Real]Absence check using 9 positive place invariants in 19 ms returned sat
[2023-03-17 22:13:06] [INFO ] After 24362ms SMT Verify possible using state equation in real domain returned unsat :0 sat :10 real:3
[2023-03-17 22:13:06] [INFO ] State equation strengthened by 3611 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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 22:13:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 22:13:06] [INFO ] After 25594ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 1257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1257/1257 places, 132872/132872 transitions.
Applied a total of 0 rules in 571 ms. Remains 1257 /1257 variables (removed 0) and now considering 132872/132872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 571 ms. Remains : 1257/1257 places, 132872/132872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1257/1257 places, 132872/132872 transitions.
Applied a total of 0 rules in 556 ms. Remains 1257 /1257 variables (removed 0) and now considering 132872/132872 (removed 0) transitions.
[2023-03-17 22:13:08] [INFO ] Flow matrix only has 101791 transitions (discarded 31081 similar events)
[2023-03-17 22:13:08] [INFO ] Invariant cache hit.
[2023-03-17 22:13:12] [INFO ] Implicit Places using invariants in 4305 ms returned []
Implicit Place search using SMT only with invariants took 4306 ms to find 0 implicit places.
[2023-03-17 22:13:12] [INFO ] Flow matrix only has 101791 transitions (discarded 31081 similar events)
[2023-03-17 22:13:12] [INFO ] Invariant cache hit.
[2023-03-17 22:13:42] [INFO ] Performed 89964/132872 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 22:13:55] [INFO ] Dead Transitions using invariants and state equation in 43554 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48429 ms. Remains : 1257/1257 places, 132872/132872 transitions.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p2 (NOT p1)))), (X (X p2)), (X (X (AND p0 p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 1770 ms. Reduced automaton from 16 states, 52 edges and 3 AP (stutter sensitive) to 16 states, 40 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 524 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), true, (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 602 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), true, (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 1345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1345/1345 places, 129712/129712 transitions.
Applied a total of 0 rules in 162 ms. Remains 1345 /1345 variables (removed 0) and now considering 129712/129712 (removed 0) transitions.
[2023-03-17 22:13:59] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
// Phase 1: matrix 96758 rows 1345 cols
[2023-03-17 22:13:59] [INFO ] Computed 9 place invariants in 384 ms
[2023-03-17 22:14:03] [INFO ] Implicit Places using invariants in 4524 ms returned []
Implicit Place search using SMT only with invariants took 4528 ms to find 0 implicit places.
[2023-03-17 22:14:03] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
[2023-03-17 22:14:03] [INFO ] Invariant cache hit.
[2023-03-17 22:14:33] [INFO ] Performed 82726/129712 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 22:14:50] [INFO ] Dead Transitions using invariants and state equation in 47173 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51867 ms. Remains : 1345/1345 places, 129712/129712 transitions.
Computed a total of 389 stabilizing places and 51386 stable transitions
Computed a total of 389 stabilizing places and 51386 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (AND p0 p2)), (X p1), (X p0), (X (AND p1 p2)), true, (X (X p2)), (X (X (AND p0 p2))), (X (X p1)), (X (X p0)), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 880 ms. Reduced automaton from 16 states, 40 edges and 3 AP (stutter sensitive) to 16 states, 40 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 505 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), true, (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 910 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 108 ms. (steps per millisecond=92 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 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 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 104 ms. (steps per millisecond=96 ) 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 106 ms. (steps per millisecond=94 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 7011 steps, run timeout after 3004 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7011 steps, saw 5362 distinct states, run finished after 3006 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-17 22:14:57] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
[2023-03-17 22:14:57] [INFO ] Invariant cache hit.
[2023-03-17 22:14:57] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2023-03-17 22:15:22] [INFO ] After 24915ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:3
[2023-03-17 22:15:23] [INFO ] State equation strengthened by 3455 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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 22:15:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 22:15:23] [INFO ] After 25874ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1345/1345 places, 129712/129712 transitions.
Drop transitions removed 2126 transitions
Reduce isomorphic transitions removed 2126 transitions.
Iterating post reduction 0 with 2126 rules applied. Total rules applied 2126 place count 1345 transition count 127586
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 2126 place count 1345 transition count 127577
Deduced a syphon composed of 9 places in 50 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 2144 place count 1336 transition count 127577
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 50 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 1 with 44 rules applied. Total rules applied 2188 place count 1314 transition count 127555
Free-agglomeration rule applied 19 times.
Iterating global reduction 1 with 19 rules applied. Total rules applied 2207 place count 1314 transition count 127536
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 2231 place count 1295 transition count 127531
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2235 place count 1295 transition count 127527
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 2255 place count 1291 transition count 127511
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2256 place count 1291 transition count 127510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2257 place count 1290 transition count 127510
Free-agglomeration rule (complex) applied 32 times with reduction of 678 identical transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 2289 place count 1290 transition count 133682
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 804 transitions
Reduce isomorphic transitions removed 809 transitions.
Iterating post reduction 4 with 841 rules applied. Total rules applied 3130 place count 1258 transition count 132873
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3131 place count 1257 transition count 132872
Applied a total of 3131 rules in 5710 ms. Remains 1257 /1345 variables (removed 88) and now considering 132872/129712 (removed -3160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5714 ms. Remains : 1257/1345 places, 132872/129712 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 904 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 169 ms. (steps per millisecond=59 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) 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 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 100 ms. (steps per millisecond=100 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 6301 steps, run timeout after 3003 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6301 steps, saw 4973 distinct states, run finished after 3003 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-17 22:15:34] [INFO ] Flow matrix only has 101791 transitions (discarded 31081 similar events)
// Phase 1: matrix 101791 rows 1257 cols
[2023-03-17 22:15:34] [INFO ] Computed 9 place invariants in 458 ms
[2023-03-17 22:15:34] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2023-03-17 22:15:59] [INFO ] After 24696ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2023-03-17 22:16:00] [INFO ] State equation strengthened by 3611 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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 22:16:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 22:16:00] [INFO ] After 26330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1257/1257 places, 132872/132872 transitions.
Applied a total of 0 rules in 563 ms. Remains 1257 /1257 variables (removed 0) and now considering 132872/132872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 563 ms. Remains : 1257/1257 places, 132872/132872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1257/1257 places, 132872/132872 transitions.
Applied a total of 0 rules in 563 ms. Remains 1257 /1257 variables (removed 0) and now considering 132872/132872 (removed 0) transitions.
[2023-03-17 22:16:02] [INFO ] Flow matrix only has 101791 transitions (discarded 31081 similar events)
[2023-03-17 22:16:02] [INFO ] Invariant cache hit.
[2023-03-17 22:16:06] [INFO ] Implicit Places using invariants in 4446 ms returned []
Implicit Place search using SMT only with invariants took 4460 ms to find 0 implicit places.
[2023-03-17 22:16:06] [INFO ] Flow matrix only has 101791 transitions (discarded 31081 similar events)
[2023-03-17 22:16:06] [INFO ] Invariant cache hit.
[2023-03-17 22:16:36] [INFO ] Performed 88457/132872 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 22:16:51] [INFO ] Dead Transitions using invariants and state equation in 44669 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49705 ms. Remains : 1257/1257 places, 132872/132872 transitions.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (AND p0 p2)), (X p1), (X p0), (X (AND p1 p2)), true, (X (X p2)), (X (X (AND p0 p2))), (X (X p1)), (X (X p0)), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 1059 ms. Reduced automaton from 16 states, 40 edges and 3 AP (stutter sensitive) to 16 states, 40 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 517 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), true, (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 551 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), true, (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 532 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), true, (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2))]
Product exploration timeout after 99500 steps with 24890 reset in 10001 ms.
Product exploration explored 100000 steps with 25008 reset in 9962 ms.
Applying partial POR strategy [false, false, true, false, false, false, false, false, false, false, true, false, true, false, true, false]
Stuttering acceptance computed with spot in 600 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), true, (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 129712/129712 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 52 ms
Iterating global reduction 0 with 31 rules applied. Total rules applied 31 place count 1345 transition count 129712
Deduced a syphon composed of 31 places in 52 ms
Applied a total of 31 rules in 1361 ms. Remains 1345 /1345 variables (removed 0) and now considering 129712/129712 (removed 0) transitions.
[2023-03-17 22:17:15] [INFO ] Flow matrix only has 96756 transitions (discarded 32956 similar events)
// Phase 1: matrix 96756 rows 1345 cols
[2023-03-17 22:17:16] [INFO ] Computed 9 place invariants in 393 ms
[2023-03-17 22:17:46] [INFO ] Performed 84284/129712 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 22:18:01] [INFO ] Dead Transitions using invariants and state equation in 45875 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1345/1345 places, 129712/129712 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47240 ms. Remains : 1345/1345 places, 129712/129712 transitions.
Support contains 5 out of 1345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1345/1345 places, 129712/129712 transitions.
Applied a total of 0 rules in 185 ms. Remains 1345 /1345 variables (removed 0) and now considering 129712/129712 (removed 0) transitions.
[2023-03-17 22:18:02] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
// Phase 1: matrix 96758 rows 1345 cols
[2023-03-17 22:18:02] [INFO ] Computed 9 place invariants in 356 ms
[2023-03-17 22:18:06] [INFO ] Implicit Places using invariants in 4538 ms returned []
Implicit Place search using SMT only with invariants took 4539 ms to find 0 implicit places.
[2023-03-17 22:18:06] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
[2023-03-17 22:18:06] [INFO ] Invariant cache hit.
[2023-03-17 22:18:36] [INFO ] Performed 82456/129712 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 22:18:54] [INFO ] Dead Transitions using invariants and state equation in 47346 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52074 ms. Remains : 1345/1345 places, 129712/129712 transitions.
Treatment of property RERS2020-PT-pb104-LTLCardinality-14 finished in 501234 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)||(G(p1)&&F(G(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(G(p0)))&&(G(F(p1))||(F(p1)&&F(!p0)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(X(X(p1)) U ((X(X(p1))&&G(p2))||X(X(G(p1)))))))'
[2023-03-17 22:19:02] [INFO ] Flatten gal took : 3351 ms
[2023-03-17 22:19:02] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-17 22:19:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1345 places, 129712 transitions and 516610 arcs took 299 ms.
Total runtime 1712052 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2291/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2291/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2291/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : RERS2020-PT-pb104-LTLCardinality-00
Could not compute solution for formula : RERS2020-PT-pb104-LTLCardinality-11
Could not compute solution for formula : RERS2020-PT-pb104-LTLCardinality-14

BK_STOP 1679091639206

--------------------
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 RERS2020-PT-pb104-LTLCardinality-00
ltl formula formula --ltl=/tmp/2291/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 1345 places, 129712 transitions and 516610 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 24.730 real 4.520 user 4.800 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2291/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2291/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2291/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2291/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name RERS2020-PT-pb104-LTLCardinality-11
ltl formula formula --ltl=/tmp/2291/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1345 places, 129712 transitions and 516610 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 12.220 real 4.410 user 3.640 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2291/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2291/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2291/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2291/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name RERS2020-PT-pb104-LTLCardinality-14
ltl formula formula --ltl=/tmp/2291/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1345 places, 129712 transitions and 516610 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 12.420 real 4.470 user 3.730 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2291/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2291/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2291/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2291/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 17 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="RERS2020-PT-pb104"
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 RERS2020-PT-pb104, 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-167889201800243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS2020-PT-pb104.tgz
mv RERS2020-PT-pb104 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 ;