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.r233-tall-167856418600219.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 JoinFreeModules-PT-2000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418600219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.6M
-rw-r--r-- 1 mcc users 6.0K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 12:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 12:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 6.2M 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 JoinFreeModules-PT-2000-LTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679473967514

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=JoinFreeModules-PT-2000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 08:32:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 08:32:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 08:32:49] [INFO ] Load time of PNML (sax parser for PT used): 403 ms
[2023-03-22 08:32:49] [INFO ] Transformed 10001 places.
[2023-03-22 08:32:49] [INFO ] Transformed 16001 transitions.
[2023-03-22 08:32:49] [INFO ] Parsed PT model containing 10001 places and 16001 transitions and 46002 arcs in 550 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 6 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-2000-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1592 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-22 08:32:51] [INFO ] Computed 2000 place invariants in 86 ms
[2023-03-22 08:32:52] [INFO ] Dead Transitions using invariants and state equation in 1140 ms found 0 transitions.
[2023-03-22 08:32:52] [INFO ] Invariant cache hit.
[2023-03-22 08:32:54] [INFO ] Implicit Places using invariants in 1673 ms returned []
Implicit Place search using SMT only with invariants took 1682 ms to find 0 implicit places.
[2023-03-22 08:32:54] [INFO ] Invariant cache hit.
[2023-03-22 08:32:55] [INFO ] Dead Transitions using invariants and state equation in 893 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5341 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Support contains 35 out of 10000 places after structural reductions.
[2023-03-22 08:32:56] [INFO ] Flatten gal took : 595 ms
[2023-03-22 08:32:56] [INFO ] Flatten gal took : 370 ms
[2023-03-22 08:32:57] [INFO ] Input system was already deterministic with 16001 transitions.
Incomplete random walk after 11009 steps, including 2 resets, run finished after 953 ms. (steps per millisecond=11 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 84 ms. (steps per millisecond=11 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 132 ms. (steps per millisecond=7 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 102 ms. (steps per millisecond=9 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 100 ms. (steps per millisecond=10 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 100 ms. (steps per millisecond=10 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 100 ms. (steps per millisecond=10 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 100 ms. (steps per millisecond=10 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 99 ms. (steps per millisecond=10 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 99 ms. (steps per millisecond=10 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 98 ms. (steps per millisecond=10 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 98 ms. (steps per millisecond=10 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 112 ms. (steps per millisecond=8 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 82 ms. (steps per millisecond=12 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 81 ms. (steps per millisecond=12 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 82 ms. (steps per millisecond=12 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 81 ms. (steps per millisecond=12 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 81 ms. (steps per millisecond=12 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 81 ms. (steps per millisecond=12 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 81 ms. (steps per millisecond=12 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 81 ms. (steps per millisecond=12 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 81 ms. (steps per millisecond=12 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 100 ms. (steps per millisecond=10 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 23) seen :0
Probabilistic random walk after 58049 steps, saw 58028 distinct states, run finished after 9102 ms. (steps per millisecond=6 ) properties seen :5
Running SMT prover for 18 properties.
[2023-03-22 08:33:09] [INFO ] Invariant cache hit.
[2023-03-22 08:33:13] [INFO ] [Real]Absence check using 2000 positive place invariants in 648 ms returned sat
[2023-03-22 08:33:13] [INFO ] After 4136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-22 08:33:17] [INFO ] [Nat]Absence check using 2000 positive place invariants in 702 ms returned sat
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
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-22 08:33:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 08:33:38] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:18
Fused 18 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 25 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 125 are kept as prefixes of interest. Removing 9875 places using SCC suffix rule.22 ms
Discarding 9875 places :
Also discarding 15800 output transitions
Drop transitions removed 15800 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 200
Applied a total of 2 rules in 78 ms. Remains 125 /10000 variables (removed 9875) and now considering 200/16001 (removed 15801) transitions.
// Phase 1: matrix 200 rows 125 cols
[2023-03-22 08:33:39] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-22 08:33:39] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 125/10000 places, 200/16001 transitions.
Incomplete random walk after 10009 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=556 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) 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 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) 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 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 8) seen :1
Running SMT prover for 7 properties.
[2023-03-22 08:33:39] [INFO ] Invariant cache hit.
[2023-03-22 08:33:39] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 08:33:39] [INFO ] [Nat]Absence check using 25 positive place invariants in 3 ms returned sat
[2023-03-22 08:33:39] [INFO ] After 354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 08:33:39] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-22 08:33:39] [INFO ] After 110ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 08:33:39] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-22 08:33:39] [INFO ] After 728ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 22059 steps, including 0 resets, run visited all 1 properties in 75 ms. (steps per millisecond=294 )
Parikh walk visited 7 properties in 1558 ms.
FORMULA JoinFreeModules-PT-2000-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(p1&&G(p2)))))'
Support contains 5 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 3655 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-22 08:33:46] [INFO ] Computed 2000 place invariants in 38 ms
[2023-03-22 08:33:47] [INFO ] Dead Transitions using invariants and state equation in 918 ms found 0 transitions.
[2023-03-22 08:33:47] [INFO ] Invariant cache hit.
[2023-03-22 08:33:49] [INFO ] Implicit Places using invariants in 1968 ms returned []
Implicit Place search using SMT only with invariants took 1969 ms to find 0 implicit places.
[2023-03-22 08:33:49] [INFO ] Invariant cache hit.
[2023-03-22 08:33:50] [INFO ] Dead Transitions using invariants and state equation in 947 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7496 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 3 s8794), p1:(GT s5438 s7803), p2:(LEQ s6474 s2942)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 12550 steps with 0 reset in 10005 ms.
Product exploration timeout after 12150 steps with 0 reset in 10004 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (X (OR (AND p0 p2) (AND p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 225 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10011 steps, including 2 resets, run finished after 855 ms. (steps per millisecond=11 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 941 ms. (steps per millisecond=10 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 912 ms. (steps per millisecond=10 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 838 ms. (steps per millisecond=11 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 882 ms. (steps per millisecond=11 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 857 ms. (steps per millisecond=11 ) properties (out of 5) seen :0
Probabilistic random walk after 106103 steps, saw 106057 distinct states, run finished after 15098 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-22 08:34:32] [INFO ] Invariant cache hit.
[2023-03-22 08:34:34] [INFO ] After 1623ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 08:34:36] [INFO ] [Nat]Absence check using 2000 positive place invariants in 670 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 08:34:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 08:34:59] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 25 are kept as prefixes of interest. Removing 9975 places using SCC suffix rule.5 ms
Discarding 9975 places :
Also discarding 15960 output transitions
Drop transitions removed 15960 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 40
Applied a total of 2 rules in 32 ms. Remains 25 /10000 variables (removed 9975) and now considering 40/16001 (removed 15961) transitions.
// Phase 1: matrix 40 rows 25 cols
[2023-03-22 08:34:59] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-22 08:34:59] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 25/10000 places, 40/16001 transitions.
Incomplete random walk after 10994 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2748 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :4
Finished Best-First random walk after 44 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (X (OR (AND p0 p2) (AND p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X p0)]
False Knowledge obtained : [(F (NOT (OR (AND p1 p2) (AND p0 p2)))), (F (OR (AND (NOT p1) (NOT p0)) (NOT p2))), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))), (F (AND p1 (NOT p0) p2)), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 6 factoid took 153 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-2000-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-2000-LTLCardinality-01 finished in 76754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U G(p1)) U G(p2)))))'
Support contains 5 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1155 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-22 08:35:00] [INFO ] Computed 2000 place invariants in 37 ms
[2023-03-22 08:35:01] [INFO ] Dead Transitions using invariants and state equation in 967 ms found 0 transitions.
[2023-03-22 08:35:01] [INFO ] Invariant cache hit.
[2023-03-22 08:35:03] [INFO ] Implicit Places using invariants in 1519 ms returned []
Implicit Place search using SMT only with invariants took 1520 ms to find 0 implicit places.
[2023-03-22 08:35:03] [INFO ] Invariant cache hit.
[2023-03-22 08:35:04] [INFO ] Dead Transitions using invariants and state equation in 863 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4508 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 3}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=7 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=7 dest: 6}, { cond=(AND p2 p1 p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(LEQ s1065 s5724), p1:(LEQ s1903 s5020), p0:(LEQ 1 s9255)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA JoinFreeModules-PT-2000-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLCardinality-03 finished in 4816 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(X(G(p1))))))'
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 959 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-22 08:35:05] [INFO ] Invariant cache hit.
[2023-03-22 08:35:06] [INFO ] Dead Transitions using invariants and state equation in 866 ms found 0 transitions.
[2023-03-22 08:35:06] [INFO ] Invariant cache hit.
[2023-03-22 08:35:07] [INFO ] Implicit Places using invariants in 1503 ms returned []
Implicit Place search using SMT only with invariants took 1504 ms to find 0 implicit places.
[2023-03-22 08:35:07] [INFO ] Invariant cache hit.
[2023-03-22 08:35:08] [INFO ] Dead Transitions using invariants and state equation in 871 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4208 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(LEQ 3 s8139), p1:(LEQ 3 s8937)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 12950 steps with 0 reset in 10007 ms.
Product exploration timeout after 12490 steps with 0 reset in 10010 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10009 steps, including 2 resets, run finished after 786 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 904 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Probabilistic random walk after 23008 steps, saw 23003 distinct states, run finished after 3013 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:35:34] [INFO ] Invariant cache hit.
[2023-03-22 08:35:36] [INFO ] [Real]Absence check using 2000 positive place invariants in 670 ms returned sat
[2023-03-22 08:35:48] [INFO ] After 14318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:35:50] [INFO ] [Nat]Absence check using 2000 positive place invariants in 656 ms returned sat
[2023-03-22 08:36:13] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 5 are kept as prefixes of interest. Removing 9995 places using SCC suffix rule.5 ms
Discarding 9995 places :
Also discarding 15992 output transitions
Drop transitions removed 15992 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 8
Applied a total of 2 rules in 24 ms. Remains 5 /10000 variables (removed 9995) and now considering 8/16001 (removed 15993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 08:36:14] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 08:36:14] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 5/10000 places, 8/16001 transitions.
Finished random walk after 2001 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2001 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 10000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 945 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-22 08:36:15] [INFO ] Computed 2000 place invariants in 38 ms
[2023-03-22 08:36:16] [INFO ] Dead Transitions using invariants and state equation in 922 ms found 0 transitions.
[2023-03-22 08:36:16] [INFO ] Invariant cache hit.
[2023-03-22 08:36:17] [INFO ] Implicit Places using invariants in 1551 ms returned []
Implicit Place search using SMT only with invariants took 1552 ms to find 0 implicit places.
[2023-03-22 08:36:17] [INFO ] Invariant cache hit.
[2023-03-22 08:36:18] [INFO ] Dead Transitions using invariants and state equation in 888 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4323 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 57 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 11010 steps, including 2 resets, run finished after 851 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 934 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Probabilistic random walk after 22008 steps, saw 22003 distinct states, run finished after 3051 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:36:24] [INFO ] Invariant cache hit.
[2023-03-22 08:36:26] [INFO ] [Real]Absence check using 2000 positive place invariants in 663 ms returned sat
[2023-03-22 08:36:38] [INFO ] After 13901ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:36:40] [INFO ] [Nat]Absence check using 2000 positive place invariants in 687 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 08:37:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 08:37:03] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 5 are kept as prefixes of interest. Removing 9995 places using SCC suffix rule.3 ms
Discarding 9995 places :
Also discarding 15992 output transitions
Drop transitions removed 15992 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 8
Applied a total of 2 rules in 28 ms. Remains 5 /10000 variables (removed 9995) and now considering 8/16001 (removed 15993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 08:37:03] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 08:37:03] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 5/10000 places, 8/16001 transitions.
Finished random walk after 1001 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1001 )
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 64 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration timeout after 12850 steps with 0 reset in 10002 ms.
Product exploration timeout after 12110 steps with 0 reset in 10010 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 3416 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-22 08:37:28] [INFO ] Computed 2000 place invariants in 38 ms
[2023-03-22 08:37:29] [INFO ] Dead Transitions using invariants and state equation in 944 ms found 0 transitions.
[2023-03-22 08:37:29] [INFO ] Invariant cache hit.
[2023-03-22 08:37:29] [INFO ] Dead Transitions using invariants and state equation in 891 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5261 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Support contains 1 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1077 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-22 08:37:31] [INFO ] Invariant cache hit.
[2023-03-22 08:37:32] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
[2023-03-22 08:37:32] [INFO ] Invariant cache hit.
[2023-03-22 08:37:33] [INFO ] Implicit Places using invariants in 1581 ms returned []
Implicit Place search using SMT only with invariants took 1582 ms to find 0 implicit places.
[2023-03-22 08:37:33] [INFO ] Invariant cache hit.
[2023-03-22 08:37:34] [INFO ] Dead Transitions using invariants and state equation in 878 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4444 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Treatment of property JoinFreeModules-PT-2000-LTLCardinality-04 finished in 150791 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(F((p1&&X((p1 U X(p1))))))))'
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1057 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-22 08:37:36] [INFO ] Invariant cache hit.
[2023-03-22 08:37:37] [INFO ] Dead Transitions using invariants and state equation in 845 ms found 0 transitions.
[2023-03-22 08:37:37] [INFO ] Invariant cache hit.
[2023-03-22 08:37:38] [INFO ] Implicit Places using invariants in 1516 ms returned []
Implicit Place search using SMT only with invariants took 1517 ms to find 0 implicit places.
[2023-03-22 08:37:38] [INFO ] Invariant cache hit.
[2023-03-22 08:37:39] [INFO ] Dead Transitions using invariants and state equation in 869 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4290 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=p1, acceptance={0} source=3 dest: 5}, { cond=(NOT p1), acceptance={0} source=3 dest: 6}], [{ cond=p1, acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 4}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 8}], [{ cond=(AND p0 p1), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 8}]], initial=7, aps=[p0:(GT 3 s8537), p1:(GT s7255 s8619)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 25150 steps with 6287 reset in 10001 ms.
Product exploration timeout after 24000 steps with 6000 reset in 10003 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 219 ms. Reduced automaton from 9 states, 20 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 11008 steps, including 2 resets, run finished after 848 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 859 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Probabilistic random walk after 22008 steps, saw 22003 distinct states, run finished after 3059 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:38:05] [INFO ] Invariant cache hit.
[2023-03-22 08:38:07] [INFO ] [Real]Absence check using 2000 positive place invariants in 664 ms returned sat
[2023-03-22 08:38:20] [INFO ] After 14233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:38:21] [INFO ] [Nat]Absence check using 2000 positive place invariants in 650 ms returned sat
[2023-03-22 08:38:45] [INFO ] After 25009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 10 are kept as prefixes of interest. Removing 9990 places using SCC suffix rule.4 ms
Discarding 9990 places :
Also discarding 15984 output transitions
Drop transitions removed 15984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 15 ms. Remains 10 /10000 variables (removed 9990) and now considering 16/16001 (removed 15985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-22 08:38:45] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 08:38:45] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 10/10000 places, 16/16001 transitions.
Finished random walk after 2002 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1001 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X p1)]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 244 ms. Reduced automaton from 5 states, 7 edges and 1 AP (stutter sensitive) to 5 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 10000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 938 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-22 08:38:46] [INFO ] Computed 2000 place invariants in 27 ms
[2023-03-22 08:38:47] [INFO ] Dead Transitions using invariants and state equation in 913 ms found 0 transitions.
[2023-03-22 08:38:47] [INFO ] Invariant cache hit.
[2023-03-22 08:38:49] [INFO ] Implicit Places using invariants in 1550 ms returned []
Implicit Place search using SMT only with invariants took 1551 ms to find 0 implicit places.
[2023-03-22 08:38:49] [INFO ] Invariant cache hit.
[2023-03-22 08:38:50] [INFO ] Dead Transitions using invariants and state equation in 868 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4273 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 5 states, 7 edges and 1 AP (stutter sensitive) to 5 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 768 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 914 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Probabilistic random walk after 24008 steps, saw 24003 distinct states, run finished after 3023 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:38:56] [INFO ] Invariant cache hit.
[2023-03-22 08:38:57] [INFO ] [Real]Absence check using 2000 positive place invariants in 674 ms returned sat
[2023-03-22 08:39:10] [INFO ] After 14192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:39:11] [INFO ] [Nat]Absence check using 2000 positive place invariants in 665 ms returned sat
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 08:39:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 08:39:35] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 10 are kept as prefixes of interest. Removing 9990 places using SCC suffix rule.4 ms
Discarding 9990 places :
Also discarding 15984 output transitions
Drop transitions removed 15984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 16 ms. Remains 10 /10000 variables (removed 9990) and now considering 16/16001 (removed 15985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-22 08:39:35] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 08:39:35] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 10/10000 places, 16/16001 transitions.
Finished random walk after 6005 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3002 )
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 5 states, 7 edges and 1 AP (stutter sensitive) to 5 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration timeout after 25290 steps with 6322 reset in 10004 ms.
Product exploration timeout after 23800 steps with 5950 reset in 10003 ms.
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1066 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-22 08:39:57] [INFO ] Computed 2000 place invariants in 32 ms
[2023-03-22 08:39:57] [INFO ] Dead Transitions using invariants and state equation in 882 ms found 0 transitions.
[2023-03-22 08:39:58] [INFO ] Invariant cache hit.
[2023-03-22 08:39:59] [INFO ] Implicit Places using invariants in 1498 ms returned []
Implicit Place search using SMT only with invariants took 1498 ms to find 0 implicit places.
[2023-03-22 08:39:59] [INFO ] Invariant cache hit.
[2023-03-22 08:40:00] [INFO ] Dead Transitions using invariants and state equation in 825 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4272 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Treatment of property JoinFreeModules-PT-2000-LTLCardinality-05 finished in 145557 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||G(p1)))))'
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 2644 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-22 08:40:03] [INFO ] Invariant cache hit.
[2023-03-22 08:40:04] [INFO ] Dead Transitions using invariants and state equation in 880 ms found 0 transitions.
[2023-03-22 08:40:04] [INFO ] Invariant cache hit.
[2023-03-22 08:40:05] [INFO ] Implicit Places using invariants in 1577 ms returned []
Implicit Place search using SMT only with invariants took 1578 ms to find 0 implicit places.
[2023-03-22 08:40:05] [INFO ] Invariant cache hit.
[2023-03-22 08:40:06] [INFO ] Dead Transitions using invariants and state equation in 865 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5970 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT s4728 s2623), p0:(LEQ 3 s9443)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA JoinFreeModules-PT-2000-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLCardinality-06 finished in 6093 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p0)&&F(G(p1)))))'
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 2581 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-22 08:40:09] [INFO ] Invariant cache hit.
[2023-03-22 08:40:10] [INFO ] Dead Transitions using invariants and state equation in 878 ms found 0 transitions.
[2023-03-22 08:40:10] [INFO ] Invariant cache hit.
[2023-03-22 08:40:11] [INFO ] Implicit Places using invariants in 1537 ms returned []
Implicit Place search using SMT only with invariants took 1537 ms to find 0 implicit places.
[2023-03-22 08:40:11] [INFO ] Invariant cache hit.
[2023-03-22 08:40:12] [INFO ] Dead Transitions using invariants and state equation in 849 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5849 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s6451 s1011), p1:(GT s1299 s2086)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration timeout after 12720 steps with 0 reset in 10001 ms.
Product exploration timeout after 12180 steps with 0 reset in 10003 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10010 steps, including 2 resets, run finished after 765 ms. (steps per millisecond=13 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 935 ms. (steps per millisecond=10 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 861 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:40:36] [INFO ] Invariant cache hit.
[2023-03-22 08:40:37] [INFO ] After 978ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:40:39] [INFO ] [Nat]Absence check using 2000 positive place invariants in 677 ms returned sat
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 08:41:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 08:41:02] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 20 are kept as prefixes of interest. Removing 9980 places using SCC suffix rule.4 ms
Discarding 9980 places :
Also discarding 15968 output transitions
Drop transitions removed 15968 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 32
Applied a total of 2 rules in 13 ms. Remains 20 /10000 variables (removed 9980) and now considering 32/16001 (removed 15969) transitions.
// Phase 1: matrix 32 rows 20 cols
[2023-03-22 08:41:02] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 08:41:02] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 20/10000 places, 32/16001 transitions.
Incomplete random walk after 10734 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3578 ) properties (out of 1) seen :0
Finished Best-First random walk after 27 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 2586 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-22 08:41:05] [INFO ] Computed 2000 place invariants in 31 ms
[2023-03-22 08:41:06] [INFO ] Dead Transitions using invariants and state equation in 875 ms found 0 transitions.
[2023-03-22 08:41:06] [INFO ] Invariant cache hit.
[2023-03-22 08:41:07] [INFO ] Implicit Places using invariants in 1480 ms returned []
Implicit Place search using SMT only with invariants took 1481 ms to find 0 implicit places.
[2023-03-22 08:41:07] [INFO ] Invariant cache hit.
[2023-03-22 08:41:08] [INFO ] Dead Transitions using invariants and state equation in 879 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5823 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 11010 steps, including 2 resets, run finished after 951 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 1140 ms. (steps per millisecond=8 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 873 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:41:12] [INFO ] Invariant cache hit.
[2023-03-22 08:41:13] [INFO ] After 991ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:41:15] [INFO ] [Nat]Absence check using 2000 positive place invariants in 669 ms returned sat
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 08:41:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 08:41:39] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 20 are kept as prefixes of interest. Removing 9980 places using SCC suffix rule.3 ms
Discarding 9980 places :
Also discarding 15968 output transitions
Drop transitions removed 15968 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 32
Applied a total of 2 rules in 14 ms. Remains 20 /10000 variables (removed 9980) and now considering 32/16001 (removed 15969) transitions.
// Phase 1: matrix 32 rows 20 cols
[2023-03-22 08:41:39] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 08:41:39] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 20/10000 places, 32/16001 transitions.
Incomplete random walk after 11430 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2286 ) properties (out of 1) seen :0
Finished Best-First random walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 14700 steps with 1 reset in 10008 ms.
Product exploration timeout after 12290 steps with 0 reset in 10008 ms.
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 2336 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-22 08:42:01] [INFO ] Computed 2000 place invariants in 27 ms
[2023-03-22 08:42:02] [INFO ] Dead Transitions using invariants and state equation in 874 ms found 0 transitions.
[2023-03-22 08:42:02] [INFO ] Invariant cache hit.
[2023-03-22 08:42:04] [INFO ] Implicit Places using invariants in 1544 ms returned []
Implicit Place search using SMT only with invariants took 1545 ms to find 0 implicit places.
[2023-03-22 08:42:04] [INFO ] Invariant cache hit.
[2023-03-22 08:42:05] [INFO ] Dead Transitions using invariants and state equation in 865 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5640 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Treatment of property JoinFreeModules-PT-2000-LTLCardinality-07 finished in 118704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 2604 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-22 08:42:08] [INFO ] Invariant cache hit.
[2023-03-22 08:42:08] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
[2023-03-22 08:42:08] [INFO ] Invariant cache hit.
[2023-03-22 08:42:10] [INFO ] Implicit Places using invariants in 1505 ms returned []
Implicit Place search using SMT only with invariants took 1506 ms to find 0 implicit places.
[2023-03-22 08:42:10] [INFO ] Invariant cache hit.
[2023-03-22 08:42:11] [INFO ] Dead Transitions using invariants and state equation in 854 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5842 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s2771 s634)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 12860 steps with 0 reset in 10001 ms.
Product exploration timeout after 12680 steps with 0 reset in 10005 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Incomplete random walk after 11010 steps, including 2 resets, run finished after 823 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Finished Best-First random walk after 4001 steps, including 0 resets, run visited all 1 properties in 427 ms. (steps per millisecond=9 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 2377 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-22 08:42:36] [INFO ] Invariant cache hit.
[2023-03-22 08:42:37] [INFO ] Dead Transitions using invariants and state equation in 864 ms found 0 transitions.
[2023-03-22 08:42:37] [INFO ] Invariant cache hit.
[2023-03-22 08:42:38] [INFO ] Implicit Places using invariants in 1464 ms returned []
Implicit Place search using SMT only with invariants took 1466 ms to find 0 implicit places.
[2023-03-22 08:42:38] [INFO ] Invariant cache hit.
[2023-03-22 08:42:39] [INFO ] Dead Transitions using invariants and state equation in 847 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5569 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10009 steps, including 2 resets, run finished after 754 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Finished Best-First random walk after 4001 steps, including 0 resets, run visited all 1 properties in 336 ms. (steps per millisecond=11 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration timeout after 12710 steps with 0 reset in 10007 ms.
Stack based approach found an accepted trace after 8201 steps with 0 reset with depth 8202 and stack size 3623 in 6015 ms.
FORMULA JoinFreeModules-PT-2000-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-2000-LTLCardinality-08 finished in 52645 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)))&&X(X(G(p2)))))'
Support contains 6 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 883 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-22 08:42:58] [INFO ] Invariant cache hit.
[2023-03-22 08:42:59] [INFO ] Dead Transitions using invariants and state equation in 849 ms found 0 transitions.
[2023-03-22 08:42:59] [INFO ] Invariant cache hit.
[2023-03-22 08:43:01] [INFO ] Implicit Places using invariants in 1455 ms returned []
Implicit Place search using SMT only with invariants took 1456 ms to find 0 implicit places.
[2023-03-22 08:43:01] [INFO ] Invariant cache hit.
[2023-03-22 08:43:02] [INFO ] Dead Transitions using invariants and state equation in 865 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4055 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p2), true]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s1197 s1794), p1:(LEQ s5978 s1339), p2:(LEQ s3969 s9151)], 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1917 steps with 0 reset in 944 ms.
FORMULA JoinFreeModules-PT-2000-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLCardinality-11 finished in 5219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G((p1 U (!p0||X(G(p1))))))))'
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1020 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-22 08:43:04] [INFO ] Invariant cache hit.
[2023-03-22 08:43:05] [INFO ] Dead Transitions using invariants and state equation in 853 ms found 0 transitions.
[2023-03-22 08:43:05] [INFO ] Invariant cache hit.
[2023-03-22 08:43:06] [INFO ] Implicit Places using invariants in 1475 ms returned []
Implicit Place search using SMT only with invariants took 1476 ms to find 0 implicit places.
[2023-03-22 08:43:06] [INFO ] Invariant cache hit.
[2023-03-22 08:43:07] [INFO ] Dead Transitions using invariants and state equation in 874 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4227 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 5}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p0:(GT 3 s4796), p1:(LEQ 3 s9974)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-2000-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLCardinality-12 finished in 4455 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(X(G(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F((p1&&X((p1 U X(p1))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p0)&&F(G(p1)))))'
[2023-03-22 08:43:08] [INFO ] Flatten gal took : 344 ms
[2023-03-22 08:43:08] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-22 08:43:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 10000 places, 16001 transitions and 46000 arcs took 62 ms.
Total runtime 619308 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1659/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1659/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1659/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : JoinFreeModules-PT-2000-LTLCardinality-04
Could not compute solution for formula : JoinFreeModules-PT-2000-LTLCardinality-05
Could not compute solution for formula : JoinFreeModules-PT-2000-LTLCardinality-07

BK_STOP 1679474656834

--------------------
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 JoinFreeModules-PT-2000-LTLCardinality-04
ltl formula formula --ltl=/tmp/1659/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 10000 places, 16001 transitions and 46000 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1659/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1659/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.470 real 0.630 user 0.740 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1659/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1659/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 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 JoinFreeModules-PT-2000-LTLCardinality-05
ltl formula formula --ltl=/tmp/1659/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 10000 places, 16001 transitions and 46000 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1659/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1659/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1659/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 3.620 real 0.580 user 0.780 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1659/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
free(): double free detected in tcache 2
ltl formula name JoinFreeModules-PT-2000-LTLCardinality-07
ltl formula formula --ltl=/tmp/1659/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 10000 places, 16001 transitions and 46000 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.640 real 0.540 user 0.560 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1659/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1659/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1659/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1659/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-2000"
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 JoinFreeModules-PT-2000, 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 r233-tall-167856418600219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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