Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813695100763.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANInsertWithFailure-PT-080, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695100763
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 9.3K Feb 26 01:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 01:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 00:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 00:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 01:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 39M Mar 5 18:22 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 CANInsertWithFailure-PT-080-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678665690977

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=CANInsertWithFailure-PT-080
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 00:01:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 00:01:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 00:01:34] [INFO ] Load time of PNML (sax parser for PT used): 881 ms
[2023-03-13 00:01:34] [INFO ] Transformed 13764 places.
[2023-03-13 00:01:34] [INFO ] Transformed 38880 transitions.
[2023-03-13 00:01:34] [INFO ] Parsed PT model containing 13764 places and 38880 transitions and 104000 arcs in 1102 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 13764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13764/13764 places, 38880/38880 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13763 transition count 38880
Applied a total of 1 rules in 4258 ms. Remains 13763 /13764 variables (removed 1) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2023-03-13 00:01:47] [INFO ] Computed 82 place invariants in 8376 ms
[2023-03-13 00:01:48] [INFO ] Implicit Places using invariants in 9923 ms returned []
Implicit Place search using SMT only with invariants took 9963 ms to find 0 implicit places.
[2023-03-13 00:01:48] [INFO ] Invariant cache hit.
[2023-03-13 00:01:50] [INFO ] Dead Transitions using invariants and state equation in 1254 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 13763/13764 places, 38880/38880 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15489 ms. Remains : 13763/13764 places, 38880/38880 transitions.
Support contains 41 out of 13763 places after structural reductions.
[2023-03-13 00:01:51] [INFO ] Flatten gal took : 1144 ms
[2023-03-13 00:01:52] [INFO ] Flatten gal took : 946 ms
[2023-03-13 00:01:54] [INFO ] Input system was already deterministic with 38880 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 1011 ms. (steps per millisecond=9 ) properties (out of 30) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
[2023-03-13 00:01:56] [INFO ] Invariant cache hit.
[2023-03-13 00:02:03] [INFO ] [Real]Absence check using 80 positive place invariants in 172 ms returned sat
[2023-03-13 00:02:03] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 328 ms returned sat
[2023-03-13 00:02:04] [INFO ] After 8123ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:25
[2023-03-13 00:02:11] [INFO ] [Nat]Absence check using 80 positive place invariants in 185 ms returned sat
[2023-03-13 00:02:11] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 323 ms returned sat
[2023-03-13 00:02:29] [INFO ] After 12206ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :22
[2023-03-13 00:02:29] [INFO ] State equation strengthened by 12720 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 00:02:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:02:29] [INFO ] After 25309ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:25
Fused 26 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 31 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 556 transitions
Trivial Post-agglo rules discarded 556 transitions
Performed 556 trivial Post agglomeration. Transition count delta: 556
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 13763 transition count 38324
Reduce places removed 556 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 557 rules applied. Total rules applied 1113 place count 13207 transition count 38323
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1114 place count 13206 transition count 38323
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1114 place count 13206 transition count 38322
Deduced a syphon composed of 1 places in 21 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1116 place count 13205 transition count 38322
Performed 6300 Post agglomeration using F-continuation condition.Transition count delta: 6300
Deduced a syphon composed of 6300 places in 52 ms
Reduce places removed 6300 places and 0 transitions.
Iterating global reduction 3 with 12600 rules applied. Total rules applied 13716 place count 6905 transition count 32022
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 13717 place count 6905 transition count 32021
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 13718 place count 6904 transition count 32021
Partial Free-agglomeration rule applied 6472 times.
Drop transitions removed 6472 transitions
Iterating global reduction 4 with 6472 rules applied. Total rules applied 20190 place count 6904 transition count 32021
Partial Free-agglomeration rule applied 160 times.
Drop transitions removed 160 transitions
Iterating global reduction 4 with 160 rules applied. Total rules applied 20350 place count 6904 transition count 32021
Applied a total of 20350 rules in 18667 ms. Remains 6904 /13763 variables (removed 6859) and now considering 32021/38880 (removed 6859) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18674 ms. Remains : 6904/13763 places, 32021/38880 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 760 ms. (steps per millisecond=13 ) properties (out of 23) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-13 00:02:49] [INFO ] Flow matrix only has 32010 transitions (discarded 11 similar events)
// Phase 1: matrix 32010 rows 6904 cols
[2023-03-13 00:02:51] [INFO ] Computed 82 place invariants in 2158 ms
[2023-03-13 00:02:54] [INFO ] [Real]Absence check using 80 positive place invariants in 111 ms returned sat
[2023-03-13 00:02:54] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 128 ms returned sat
[2023-03-13 00:02:54] [INFO ] After 3634ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-13 00:02:57] [INFO ] [Nat]Absence check using 80 positive place invariants in 79 ms returned sat
[2023-03-13 00:02:57] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 168 ms returned sat
[2023-03-13 00:03:19] [INFO ] After 20019ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-13 00:03:20] [INFO ] State equation strengthened by 31540 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 00:03:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:03:20] [INFO ] After 25619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:17
Fused 17 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 21 out of 6904 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6904/6904 places, 32021/32021 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 6896 transition count 32013
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 6896 transition count 32013
Applied a total of 19 rules in 6784 ms. Remains 6896 /6904 variables (removed 8) and now considering 32013/32021 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6785 ms. Remains : 6896/6904 places, 32013/32021 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 767 ms. (steps per millisecond=13 ) properties (out of 17) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-13 00:03:28] [INFO ] Flow matrix only has 32005 transitions (discarded 8 similar events)
// Phase 1: matrix 32005 rows 6896 cols
[2023-03-13 00:03:30] [INFO ] Computed 82 place invariants in 2177 ms
[2023-03-13 00:03:33] [INFO ] [Real]Absence check using 80 positive place invariants in 113 ms returned sat
[2023-03-13 00:03:33] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 138 ms returned sat
[2023-03-13 00:03:33] [INFO ] After 2834ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-13 00:03:35] [INFO ] [Nat]Absence check using 80 positive place invariants in 106 ms returned sat
[2023-03-13 00:03:36] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 132 ms returned sat
[2023-03-13 00:03:58] [INFO ] After 20753ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-13 00:03:58] [INFO ] State equation strengthened by 31639 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 00:03:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:03:58] [INFO ] After 25439ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 16 out of 6896 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6896/6896 places, 32013/32013 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 6891 transition count 32008
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 6891 transition count 32008
Applied a total of 11 rules in 6414 ms. Remains 6891 /6896 variables (removed 5) and now considering 32008/32013 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6414 ms. Remains : 6891/6896 places, 32008/32013 transitions.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 322 stabilizing places and 560 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F(p1)))))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3396 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2023-03-13 00:04:17] [INFO ] Computed 82 place invariants in 8543 ms
[2023-03-13 00:04:19] [INFO ] Implicit Places using invariants in 10204 ms returned []
Implicit Place search using SMT only with invariants took 10206 ms to find 0 implicit places.
[2023-03-13 00:04:19] [INFO ] Invariant cache hit.
[2023-03-13 00:04:20] [INFO ] Dead Transitions using invariants and state equation in 1441 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15051 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s12901), p1:(GT 1 s5406)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 9047 ms.
Product exploration explored 100000 steps with 50000 reset in 7820 ms.
Computed a total of 322 stabilizing places and 560 stable transitions
Computed a total of 322 stabilizing places and 560 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-00 finished in 32633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p0&&F(G(p0)))))))'
Support contains 1 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6320 Post agglomeration using F-continuation condition.Transition count delta: 6320
Deduced a syphon composed of 6320 places in 17 ms
Reduce places removed 6320 places and 0 transitions.
Iterating global reduction 2 with 12640 rules applied. Total rules applied 13760 place count 6883 transition count 32000
Applied a total of 13760 rules in 9168 ms. Remains 6883 /13763 variables (removed 6880) and now considering 32000/38880 (removed 6880) transitions.
[2023-03-13 00:04:47] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
// Phase 1: matrix 25838 rows 6883 cols
[2023-03-13 00:04:51] [INFO ] Computed 82 place invariants in 4203 ms
[2023-03-13 00:04:53] [INFO ] Implicit Places using invariants in 6254 ms returned []
Implicit Place search using SMT only with invariants took 6255 ms to find 0 implicit places.
[2023-03-13 00:04:53] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
[2023-03-13 00:04:53] [INFO ] Invariant cache hit.
[2023-03-13 00:05:12] [INFO ] Dead Transitions using invariants and state equation in 18942 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6883/13763 places, 32000/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34369 ms. Remains : 6883/13763 places, 32000/38880 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s4270)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 440 steps with 0 reset in 13 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-02 finished in 34538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3598 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2023-03-13 00:05:25] [INFO ] Computed 82 place invariants in 9433 ms
[2023-03-13 00:05:27] [INFO ] Implicit Places using invariants in 10985 ms returned []
Implicit Place search using SMT only with invariants took 10986 ms to find 0 implicit places.
[2023-03-13 00:05:27] [INFO ] Invariant cache hit.
[2023-03-13 00:05:28] [INFO ] Dead Transitions using invariants and state equation in 1391 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15983 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 3 s5688), p1:(LEQ s2668 s2593)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-05 finished in 16282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F(p1)))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6319 Post agglomeration using F-continuation condition.Transition count delta: 6319
Deduced a syphon composed of 6319 places in 15 ms
Reduce places removed 6319 places and 0 transitions.
Iterating global reduction 2 with 12638 rules applied. Total rules applied 13758 place count 6884 transition count 32001
Applied a total of 13758 rules in 9303 ms. Remains 6884 /13763 variables (removed 6879) and now considering 32001/38880 (removed 6879) transitions.
[2023-03-13 00:05:38] [INFO ] Flow matrix only has 25840 transitions (discarded 6161 similar events)
// Phase 1: matrix 25840 rows 6884 cols
[2023-03-13 00:05:42] [INFO ] Computed 82 place invariants in 4198 ms
[2023-03-13 00:05:43] [INFO ] Implicit Places using invariants in 5056 ms returned []
Implicit Place search using SMT only with invariants took 5057 ms to find 0 implicit places.
[2023-03-13 00:05:43] [INFO ] Flow matrix only has 25840 transitions (discarded 6161 similar events)
[2023-03-13 00:05:43] [INFO ] Invariant cache hit.
[2023-03-13 00:06:02] [INFO ] Dead Transitions using invariants and state equation in 18563 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6884/13763 places, 32001/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32928 ms. Remains : 6884/13763 places, 32001/38880 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 s5434), p0:(LEQ 3 s3177)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 405 steps with 0 reset in 14 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-06 finished in 33119 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 13763 transition count 38322
Reduce places removed 558 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 559 rules applied. Total rules applied 1117 place count 13205 transition count 38321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1118 place count 13204 transition count 38321
Performed 6318 Post agglomeration using F-continuation condition.Transition count delta: 6318
Deduced a syphon composed of 6318 places in 14 ms
Reduce places removed 6318 places and 0 transitions.
Iterating global reduction 3 with 12636 rules applied. Total rules applied 13754 place count 6886 transition count 32003
Applied a total of 13754 rules in 9096 ms. Remains 6886 /13763 variables (removed 6877) and now considering 32003/38880 (removed 6877) transitions.
[2023-03-13 00:06:11] [INFO ] Flow matrix only has 25842 transitions (discarded 6161 similar events)
// Phase 1: matrix 25842 rows 6886 cols
[2023-03-13 00:06:15] [INFO ] Computed 82 place invariants in 4233 ms
[2023-03-13 00:06:17] [INFO ] Implicit Places using invariants in 6006 ms returned []
Implicit Place search using SMT only with invariants took 6007 ms to find 0 implicit places.
[2023-03-13 00:06:17] [INFO ] Flow matrix only has 25842 transitions (discarded 6161 similar events)
[2023-03-13 00:06:17] [INFO ] Invariant cache hit.
[2023-03-13 00:06:35] [INFO ] Dead Transitions using invariants and state equation in 18053 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6886/13763 places, 32003/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33164 ms. Remains : 6886/13763 places, 32003/38880 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s252 s5483)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 399 reset in 3019 ms.
Stack based approach found an accepted trace after 6649 steps with 26 reset with depth 313 and stack size 132 in 188 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-07 finished in 36565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G((p1&&(p2 U p3)))))))'
Support contains 7 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3558 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2023-03-13 00:06:51] [INFO ] Computed 82 place invariants in 9185 ms
[2023-03-13 00:06:52] [INFO ] Implicit Places using invariants in 10538 ms returned []
Implicit Place search using SMT only with invariants took 10539 ms to find 0 implicit places.
[2023-03-13 00:06:52] [INFO ] Invariant cache hit.
[2023-03-13 00:06:54] [INFO ] Dead Transitions using invariants and state equation in 1388 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15490 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p3)), true, (OR (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=3 dest: 3}, { cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s4277 s4571), p1:(LEQ s8333 s835), p3:(LEQ 1 s9010), p2:(GT s3375 s7084)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2089 steps with 0 reset in 134 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-08 finished in 16085 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)||F(p1)||G(p2)))'
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6317 Post agglomeration using F-continuation condition.Transition count delta: 6317
Deduced a syphon composed of 6317 places in 13 ms
Reduce places removed 6317 places and 0 transitions.
Iterating global reduction 2 with 12634 rules applied. Total rules applied 13754 place count 6886 transition count 32003
Applied a total of 13754 rules in 8892 ms. Remains 6886 /13763 variables (removed 6877) and now considering 32003/38880 (removed 6877) transitions.
[2023-03-13 00:07:03] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
// Phase 1: matrix 25844 rows 6886 cols
[2023-03-13 00:07:08] [INFO ] Computed 82 place invariants in 4605 ms
[2023-03-13 00:07:10] [INFO ] Implicit Places using invariants in 6353 ms returned []
Implicit Place search using SMT only with invariants took 6355 ms to find 0 implicit places.
[2023-03-13 00:07:10] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
[2023-03-13 00:07:10] [INFO ] Invariant cache hit.
[2023-03-13 00:07:28] [INFO ] Dead Transitions using invariants and state equation in 18488 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6886/13763 places, 32003/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33737 ms. Remains : 6886/13763 places, 32003/38880 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ 1 s4917), p2:(LEQ 1 s6200), p0:(LEQ 2 s1573)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 420 steps with 0 reset in 20 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-10 finished in 34040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0&&X(F(p1))&&(p2 U (p3||G(p2))))||G((F(p1)&&(p2 U (p3||G(p2))))))))'
Support contains 5 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3522 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2023-03-13 00:07:42] [INFO ] Computed 82 place invariants in 9637 ms
[2023-03-13 00:07:43] [INFO ] Implicit Places using invariants in 10897 ms returned []
Implicit Place search using SMT only with invariants took 10911 ms to find 0 implicit places.
[2023-03-13 00:07:43] [INFO ] Invariant cache hit.
[2023-03-13 00:07:44] [INFO ] Dead Transitions using invariants and state equation in 1511 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15949 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 545 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p3 (NOT p1)) (AND (NOT p0) p2 (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 2} source=0 dest: 2}, { cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p0 p3 (NOT p1)) (AND p0 p2 (NOT p1))), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p3) p2), acceptance={1} source=0 dest: 6}, { cond=(AND p0 (NOT p3) p2), acceptance={2} source=0 dest: 8}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(OR (AND p0 p3 (NOT p1)) (AND p0 p2 (NOT p1))), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 2} source=2 dest: 2}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p3) p2), acceptance={2} source=2 dest: 8}], [{ cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0, 2} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0, 1, 2} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0, 2} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p3) p2), acceptance={2} source=6 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=8 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={2} source=8 dest: 8}]], initial=0, aps=[p0:(GT 2 s9998), p3:(AND (GT 3 s1539) (GT 2 s4218)), p2:(GT 2 s4218), p1:(GT s2715 s221)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2081 steps with 0 reset in 87 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-12 finished in 16738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3716 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2023-03-13 00:07:49] [INFO ] Invariant cache hit.
[2023-03-13 00:07:50] [INFO ] Implicit Places using invariants in 1507 ms returned []
Implicit Place search using SMT only with invariants took 1509 ms to find 0 implicit places.
[2023-03-13 00:07:50] [INFO ] Invariant cache hit.
[2023-03-13 00:07:52] [INFO ] Dead Transitions using invariants and state equation in 1280 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6524 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s6990 s7553)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 14795 steps with 7 reset in 349 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-13 finished in 7050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (p1||X(p2)))))'
Support contains 4 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3517 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2023-03-13 00:07:56] [INFO ] Invariant cache hit.
[2023-03-13 00:07:57] [INFO ] Implicit Places using invariants in 1424 ms returned []
Implicit Place search using SMT only with invariants took 1426 ms to find 0 implicit places.
[2023-03-13 00:07:57] [INFO ] Invariant cache hit.
[2023-03-13 00:07:58] [INFO ] Dead Transitions using invariants and state equation in 1295 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6246 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 3 s10188), p0:(LEQ s4134 s2448), p2:(LEQ 2 s9325)], nbAcceptance=0, 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 1972 steps with 0 reset in 53 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-14 finished in 6630 ms.
All properties solved by simple procedures.
Total runtime 386256 ms.
ITS solved all properties within timeout

BK_STOP 1678666079537

--------------------
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

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="CANInsertWithFailure-PT-080"
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 CANInsertWithFailure-PT-080, 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 r041-tajo-167813695100763"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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