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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.1K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 11:55 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.7K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 11:55 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 1.6M 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-0500-LTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679438249790

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0500
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-21 22:37:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 22:37:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:37:31] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2023-03-21 22:37:31] [INFO ] Transformed 2501 places.
[2023-03-21 22:37:31] [INFO ] Transformed 4001 transitions.
[2023-03-21 22:37:31] [INFO ] Parsed PT model containing 2501 places and 4001 transitions and 11502 arcs in 259 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 334 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-21 22:37:32] [INFO ] Computed 500 place invariants in 41 ms
[2023-03-21 22:37:34] [INFO ] Dead Transitions using invariants and state equation in 2046 ms found 0 transitions.
[2023-03-21 22:37:34] [INFO ] Invariant cache hit.
[2023-03-21 22:37:34] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-21 22:37:34] [INFO ] Invariant cache hit.
[2023-03-21 22:37:36] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:37:36] [INFO ] Implicit Places using invariants and state equation in 1775 ms returned []
Implicit Place search using SMT with State Equation took 2179 ms to find 0 implicit places.
[2023-03-21 22:37:36] [INFO ] Invariant cache hit.
[2023-03-21 22:37:38] [INFO ] Dead Transitions using invariants and state equation in 1805 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6461 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Support contains 39 out of 2500 places after structural reductions.
[2023-03-21 22:37:38] [INFO ] Flatten gal took : 238 ms
[2023-03-21 22:37:38] [INFO ] Flatten gal took : 149 ms
[2023-03-21 22:37:38] [INFO ] Input system was already deterministic with 4001 transitions.
Support contains 38 out of 2500 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10114 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=36 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 20) seen :0
Probabilistic random walk after 52204 steps, saw 52125 distinct states, run finished after 3015 ms. (steps per millisecond=17 ) properties seen :3
Running SMT prover for 17 properties.
[2023-03-21 22:37:42] [INFO ] Invariant cache hit.
[2023-03-21 22:37:44] [INFO ] [Real]Absence check using 500 positive place invariants in 103 ms returned sat
[2023-03-21 22:37:44] [INFO ] After 1464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-21 22:37:45] [INFO ] [Nat]Absence check using 500 positive place invariants in 92 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-21 22:38:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 22:38:09] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:17
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 30 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 145 are kept as prefixes of interest. Removing 2355 places using SCC suffix rule.7 ms
Discarding 2355 places :
Also discarding 3768 output transitions
Drop transitions removed 3768 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 145 transition count 232
Applied a total of 2 rules in 40 ms. Remains 145 /2500 variables (removed 2355) and now considering 232/4001 (removed 3769) transitions.
// Phase 1: matrix 232 rows 145 cols
[2023-03-21 22:38:09] [INFO ] Computed 29 place invariants in 1 ms
[2023-03-21 22:38:09] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 145/2500 places, 232/4001 transitions.
Incomplete random walk after 10028 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=626 ) properties (out of 17) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2023-03-21 22:38:09] [INFO ] Invariant cache hit.
[2023-03-21 22:38:09] [INFO ] [Real]Absence check using 29 positive place invariants in 3 ms returned sat
[2023-03-21 22:38:09] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 22:38:09] [INFO ] [Nat]Absence check using 29 positive place invariants in 4 ms returned sat
[2023-03-21 22:38:09] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 22:38:09] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-21 22:38:10] [INFO ] After 25ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 22:38:10] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-21 22:38:10] [INFO ] After 279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 6779 steps, including 0 resets, run visited all 1 properties in 28 ms. (steps per millisecond=242 )
Parikh walk visited 2 properties in 105 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-11 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) U (X(p1)&&G(p2))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 51 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-21 22:38:10] [INFO ] Computed 500 place invariants in 18 ms
[2023-03-21 22:38:12] [INFO ] Dead Transitions using invariants and state equation in 1750 ms found 0 transitions.
[2023-03-21 22:38:12] [INFO ] Invariant cache hit.
[2023-03-21 22:38:12] [INFO ] Implicit Places using invariants in 448 ms returned []
[2023-03-21 22:38:12] [INFO ] Invariant cache hit.
[2023-03-21 22:38:14] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:38:14] [INFO ] Implicit Places using invariants and state equation in 1818 ms returned []
Implicit Place search using SMT with State Equation took 2268 ms to find 0 implicit places.
[2023-03-21 22:38:14] [INFO ] Invariant cache hit.
[2023-03-21 22:38:16] [INFO ] Dead Transitions using invariants and state equation in 1863 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5935 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 403 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p0), (AND p2 (NOT p1)), (NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p2 p0), acceptance={0} source=0 dest: 5}, { cond=(AND p2 p0), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 1}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ 1 s657), p0:(LEQ 2 s894), p1:(LEQ 1 s830)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 37160 steps with 2 reset in 10003 ms.
Product exploration timeout after 36160 steps with 2 reset in 10001 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 p2 (NOT p0) p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0))), (X p2), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p2 (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 942 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p2), (NOT p2)]
Incomplete random walk after 10029 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Probabilistic random walk after 94388 steps, saw 94235 distinct states, run finished after 3012 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:39:03] [INFO ] Invariant cache hit.
[2023-03-21 22:39:03] [INFO ] [Real]Absence check using 500 positive place invariants in 92 ms returned sat
[2023-03-21 22:39:05] [INFO ] After 1737ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:39:05] [INFO ] [Nat]Absence check using 500 positive place invariants in 88 ms returned sat
[2023-03-21 22:39:21] [INFO ] After 16326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:39:21] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:39:22] [INFO ] After 944ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:39:23] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-21 22:39:23] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-21 22:39:24] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-21 22:39:24] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-21 22:39:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1397 ms
[2023-03-21 22:39:24] [INFO ] After 2692ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 323 ms.
[2023-03-21 22:39:24] [INFO ] After 19741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2003 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 5 are kept as prefixes of interest. Removing 2495 places using SCC suffix rule.5 ms
Discarding 2495 places :
Also discarding 3992 output transitions
Drop transitions removed 3992 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 16 ms. Remains 5 /2500 variables (removed 2495) and now considering 8/4001 (removed 3993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-21 22:39:26] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-21 22:39:26] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 5/2500 places, 8/4001 transitions.
Finished random walk after 501 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=501 )
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0))), (X p2), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p2 (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (F (NOT p2))]
Knowledge based reduction with 21 factoid took 769 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p2), (NOT p2)]
Support contains 1 out of 2500 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 59 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-21 22:39:27] [INFO ] Computed 500 place invariants in 12 ms
[2023-03-21 22:39:29] [INFO ] Dead Transitions using invariants and state equation in 1746 ms found 0 transitions.
[2023-03-21 22:39:29] [INFO ] Invariant cache hit.
[2023-03-21 22:39:29] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-21 22:39:29] [INFO ] Invariant cache hit.
[2023-03-21 22:39:31] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:39:31] [INFO ] Implicit Places using invariants and state equation in 1660 ms returned []
Implicit Place search using SMT with State Equation took 2014 ms to find 0 implicit places.
[2023-03-21 22:39:31] [INFO ] Invariant cache hit.
[2023-03-21 22:39:33] [INFO ] Dead Transitions using invariants and state equation in 1709 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5531 ms. Remains : 2500/2500 places, 4001/4001 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 : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p2), (NOT p2)]
Incomplete random walk after 10280 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Probabilistic random walk after 96396 steps, saw 96239 distinct states, run finished after 3031 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:39:58] [INFO ] Invariant cache hit.
[2023-03-21 22:39:58] [INFO ] [Real]Absence check using 500 positive place invariants in 93 ms returned sat
[2023-03-21 22:40:00] [INFO ] After 1772ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:40:00] [INFO ] [Nat]Absence check using 500 positive place invariants in 90 ms returned sat
[2023-03-21 22:40:16] [INFO ] After 16233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:40:16] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:40:17] [INFO ] After 955ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:40:18] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-21 22:40:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-21 22:40:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:40:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:40:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1344 ms
[2023-03-21 22:40:19] [INFO ] After 2646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 328 ms.
[2023-03-21 22:40:19] [INFO ] After 19575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2002 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 5 are kept as prefixes of interest. Removing 2495 places using SCC suffix rule.1 ms
Discarding 2495 places :
Also discarding 3992 output transitions
Drop transitions removed 3992 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 7 ms. Remains 5 /2500 variables (removed 2495) and now considering 8/4001 (removed 3993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-21 22:40:21] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-21 22:40:21] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 5/2500 places, 8/4001 transitions.
Finished random walk after 501 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=250 )
Knowledge obtained : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 279 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p2), (NOT p2)]
Product exploration timeout after 40760 steps with 0 reset in 10003 ms.
Product exploration timeout after 39250 steps with 0 reset in 10001 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p2), (NOT p2)]
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 335 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-21 22:40:42] [INFO ] Computed 500 place invariants in 10 ms
[2023-03-21 22:40:44] [INFO ] Dead Transitions using invariants and state equation in 1700 ms found 0 transitions.
[2023-03-21 22:40:44] [INFO ] Redundant transitions in 217 ms returned []
[2023-03-21 22:40:44] [INFO ] Invariant cache hit.
[2023-03-21 22:40:46] [INFO ] Dead Transitions using invariants and state equation in 1700 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3967 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 67 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-21 22:40:46] [INFO ] Invariant cache hit.
[2023-03-21 22:40:48] [INFO ] Dead Transitions using invariants and state equation in 1709 ms found 0 transitions.
[2023-03-21 22:40:48] [INFO ] Invariant cache hit.
[2023-03-21 22:40:48] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-21 22:40:48] [INFO ] Invariant cache hit.
[2023-03-21 22:40:50] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:40:50] [INFO ] Implicit Places using invariants and state equation in 1645 ms returned []
Implicit Place search using SMT with State Equation took 1993 ms to find 0 implicit places.
[2023-03-21 22:40:50] [INFO ] Invariant cache hit.
[2023-03-21 22:40:51] [INFO ] Dead Transitions using invariants and state equation in 1662 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5434 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-00 finished in 161593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 204 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-21 22:40:52] [INFO ] Invariant cache hit.
[2023-03-21 22:40:53] [INFO ] Dead Transitions using invariants and state equation in 1643 ms found 0 transitions.
[2023-03-21 22:40:53] [INFO ] Invariant cache hit.
[2023-03-21 22:40:54] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-21 22:40:54] [INFO ] Invariant cache hit.
[2023-03-21 22:40:55] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:40:55] [INFO ] Implicit Places using invariants and state equation in 1579 ms returned []
Implicit Place search using SMT with State Equation took 1921 ms to find 0 implicit places.
[2023-03-21 22:40:56] [INFO ] Redundant transitions in 361 ms returned []
[2023-03-21 22:40:56] [INFO ] Invariant cache hit.
[2023-03-21 22:40:58] [INFO ] Dead Transitions using invariants and state equation in 1748 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5885 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (LEQ s20 s1370) (LEQ s2432 s700)), p1:(LEQ 1 s785)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 41090 steps with 0 reset in 10003 ms.
Stack based approach found an accepted trace after 3401 steps with 0 reset with depth 3402 and stack size 3161 in 515 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-01 finished in 16517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(!p0&&F(p0)))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 140 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-21 22:41:08] [INFO ] Invariant cache hit.
[2023-03-21 22:41:10] [INFO ] Dead Transitions using invariants and state equation in 1740 ms found 0 transitions.
[2023-03-21 22:41:10] [INFO ] Invariant cache hit.
[2023-03-21 22:41:10] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-21 22:41:10] [INFO ] Invariant cache hit.
[2023-03-21 22:41:12] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:41:12] [INFO ] Implicit Places using invariants and state equation in 1649 ms returned []
Implicit Place search using SMT with State Equation took 1999 ms to find 0 implicit places.
[2023-03-21 22:41:12] [INFO ] Redundant transitions in 123 ms returned []
[2023-03-21 22:41:12] [INFO ] Invariant cache hit.
[2023-03-21 22:41:14] [INFO ] Dead Transitions using invariants and state equation in 1725 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5734 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s881 s742)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 41160 steps with 0 reset in 10001 ms.
Product exploration timeout after 39600 steps with 0 reset in 10001 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10025 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Probabilistic random walk after 90371 steps, saw 90227 distinct states, run finished after 3052 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:41:59] [INFO ] Invariant cache hit.
[2023-03-21 22:41:59] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:41:59] [INFO ] [Nat]Absence check using 500 positive place invariants in 89 ms returned sat
[2023-03-21 22:42:16] [INFO ] After 16685ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:42:16] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:42:17] [INFO ] After 1246ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:42:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:42:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-21 22:42:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:42:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 860 ms
[2023-03-21 22:42:18] [INFO ] After 2493ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 336 ms.
[2023-03-21 22:42:19] [INFO ] After 19895ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2001 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 10 are kept as prefixes of interest. Removing 2490 places using SCC suffix rule.1 ms
Discarding 2490 places :
Also discarding 3984 output transitions
Drop transitions removed 3984 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 5 ms. Remains 10 /2500 variables (removed 2490) and now considering 16/4001 (removed 3985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-21 22:42:21] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-21 22:42:21] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 10/2500 places, 16/4001 transitions.
Finished random walk after 502 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=502 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 144 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-21 22:42:21] [INFO ] Computed 500 place invariants in 11 ms
[2023-03-21 22:42:23] [INFO ] Dead Transitions using invariants and state equation in 1689 ms found 0 transitions.
[2023-03-21 22:42:23] [INFO ] Invariant cache hit.
[2023-03-21 22:42:23] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-21 22:42:23] [INFO ] Invariant cache hit.
[2023-03-21 22:42:25] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:42:25] [INFO ] Implicit Places using invariants and state equation in 1624 ms returned []
Implicit Place search using SMT with State Equation took 1974 ms to find 0 implicit places.
[2023-03-21 22:42:25] [INFO ] Redundant transitions in 129 ms returned []
[2023-03-21 22:42:25] [INFO ] Invariant cache hit.
[2023-03-21 22:42:27] [INFO ] Dead Transitions using invariants and state equation in 1722 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5666 ms. Remains : 2500/2500 places, 4001/4001 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10114 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Probabilistic random walk after 91375 steps, saw 91230 distinct states, run finished after 3027 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:42:52] [INFO ] Invariant cache hit.
[2023-03-21 22:42:52] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:42:53] [INFO ] [Nat]Absence check using 500 positive place invariants in 89 ms returned sat
[2023-03-21 22:43:10] [INFO ] After 17050ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:43:10] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:43:11] [INFO ] After 1278ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:43:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:43:12] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:43:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:43:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 905 ms
[2023-03-21 22:43:12] [INFO ] After 2571ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 332 ms.
[2023-03-21 22:43:13] [INFO ] After 20323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2003 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 10 are kept as prefixes of interest. Removing 2490 places using SCC suffix rule.1 ms
Discarding 2490 places :
Also discarding 3984 output transitions
Drop transitions removed 3984 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 5 ms. Remains 10 /2500 variables (removed 2490) and now considering 16/4001 (removed 3985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-21 22:43:15] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-21 22:43:15] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 10/2500 places, 16/4001 transitions.
Finished random walk after 251 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=251 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 40540 steps with 0 reset in 10001 ms.
Product exploration timeout after 38960 steps with 0 reset in 10001 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 140 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-21 22:43:35] [INFO ] Computed 500 place invariants in 17 ms
[2023-03-21 22:43:37] [INFO ] Dead Transitions using invariants and state equation in 1888 ms found 0 transitions.
[2023-03-21 22:43:37] [INFO ] Invariant cache hit.
[2023-03-21 22:43:37] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-21 22:43:37] [INFO ] Invariant cache hit.
[2023-03-21 22:43:39] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:43:39] [INFO ] Implicit Places using invariants and state equation in 1644 ms returned []
Implicit Place search using SMT with State Equation took 1988 ms to find 0 implicit places.
[2023-03-21 22:43:39] [INFO ] Redundant transitions in 126 ms returned []
[2023-03-21 22:43:39] [INFO ] Invariant cache hit.
[2023-03-21 22:43:41] [INFO ] Dead Transitions using invariants and state equation in 1859 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6018 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-02 finished in 152923 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 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 154 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-21 22:43:41] [INFO ] Invariant cache hit.
[2023-03-21 22:43:43] [INFO ] Dead Transitions using invariants and state equation in 1839 ms found 0 transitions.
[2023-03-21 22:43:43] [INFO ] Invariant cache hit.
[2023-03-21 22:43:43] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-21 22:43:43] [INFO ] Invariant cache hit.
[2023-03-21 22:43:45] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:43:45] [INFO ] Implicit Places using invariants and state equation in 1650 ms returned []
Implicit Place search using SMT with State Equation took 2029 ms to find 0 implicit places.
[2023-03-21 22:43:45] [INFO ] Redundant transitions in 123 ms returned []
[2023-03-21 22:43:45] [INFO ] Invariant cache hit.
[2023-03-21 22:43:47] [INFO ] Dead Transitions using invariants and state equation in 1769 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5923 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-03 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 s1162 s1976)], 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 40340 steps with 0 reset in 10003 ms.
Product exploration timeout after 38610 steps with 0 reset in 10002 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 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 32 ms :[(NOT p0)]
Incomplete random walk after 10280 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Probabilistic random walk after 92379 steps, saw 92232 distinct states, run finished after 3015 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:44:31] [INFO ] Invariant cache hit.
[2023-03-21 22:44:32] [INFO ] [Real]Absence check using 500 positive place invariants in 95 ms returned sat
[2023-03-21 22:44:33] [INFO ] After 1772ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:44:33] [INFO ] [Nat]Absence check using 500 positive place invariants in 91 ms returned sat
[2023-03-21 22:44:50] [INFO ] After 16519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:44:50] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:44:51] [INFO ] After 691ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:44:51] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-21 22:44:52] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-21 22:44:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-21 22:44:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 826 ms
[2023-03-21 22:44:52] [INFO ] After 1931ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 373 ms.
[2023-03-21 22:44:52] [INFO ] After 19186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2002 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 10 are kept as prefixes of interest. Removing 2490 places using SCC suffix rule.1 ms
Discarding 2490 places :
Also discarding 3984 output transitions
Drop transitions removed 3984 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 4 ms. Remains 10 /2500 variables (removed 2490) and now considering 16/4001 (removed 3985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-21 22:44:54] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 22:44:54] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 10/2500 places, 16/4001 transitions.
Finished random walk after 251 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=251 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 208 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 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 142 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-21 22:44:55] [INFO ] Computed 500 place invariants in 14 ms
[2023-03-21 22:44:57] [INFO ] Dead Transitions using invariants and state equation in 1789 ms found 0 transitions.
[2023-03-21 22:44:57] [INFO ] Invariant cache hit.
[2023-03-21 22:44:57] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-21 22:44:57] [INFO ] Invariant cache hit.
[2023-03-21 22:44:58] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:44:59] [INFO ] Implicit Places using invariants and state equation in 1614 ms returned []
Implicit Place search using SMT with State Equation took 1995 ms to find 0 implicit places.
[2023-03-21 22:44:59] [INFO ] Redundant transitions in 128 ms returned []
[2023-03-21 22:44:59] [INFO ] Invariant cache hit.
[2023-03-21 22:45:00] [INFO ] Dead Transitions using invariants and state equation in 1750 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5816 ms. Remains : 2500/2500 places, 4001/4001 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 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 10029 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 1) seen :0
Probabilistic random walk after 79324 steps, saw 79201 distinct states, run finished after 3026 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:45:28] [INFO ] Invariant cache hit.
[2023-03-21 22:45:28] [INFO ] [Real]Absence check using 500 positive place invariants in 95 ms returned sat
[2023-03-21 22:45:30] [INFO ] After 1872ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:45:30] [INFO ] [Nat]Absence check using 500 positive place invariants in 94 ms returned sat
[2023-03-21 22:45:48] [INFO ] After 17716ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:45:48] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:45:49] [INFO ] After 726ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:45:49] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-21 22:45:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:45:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:45:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 826 ms
[2023-03-21 22:45:50] [INFO ] After 1997ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 399 ms.
[2023-03-21 22:45:50] [INFO ] After 20523ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2004 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 10 are kept as prefixes of interest. Removing 2490 places using SCC suffix rule.1 ms
Discarding 2490 places :
Also discarding 3984 output transitions
Drop transitions removed 3984 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 4 ms. Remains 10 /2500 variables (removed 2490) and now considering 16/4001 (removed 3985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-21 22:45:52] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-21 22:45:52] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 10/2500 places, 16/4001 transitions.
Finished random walk after 251 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=251 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 132 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 65 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration timeout after 40030 steps with 0 reset in 10001 ms.
Product exploration timeout after 38320 steps with 0 reset in 10001 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 178 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-21 22:46:13] [INFO ] Computed 500 place invariants in 14 ms
[2023-03-21 22:46:15] [INFO ] Dead Transitions using invariants and state equation in 1846 ms found 0 transitions.
[2023-03-21 22:46:15] [INFO ] Invariant cache hit.
[2023-03-21 22:46:15] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-21 22:46:15] [INFO ] Invariant cache hit.
[2023-03-21 22:46:17] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:46:17] [INFO ] Implicit Places using invariants and state equation in 1745 ms returned []
Implicit Place search using SMT with State Equation took 2147 ms to find 0 implicit places.
[2023-03-21 22:46:17] [INFO ] Redundant transitions in 130 ms returned []
[2023-03-21 22:46:17] [INFO ] Invariant cache hit.
[2023-03-21 22:46:19] [INFO ] Dead Transitions using invariants and state equation in 1752 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6064 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-03 finished in 157755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 56 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-21 22:46:19] [INFO ] Invariant cache hit.
[2023-03-21 22:46:21] [INFO ] Dead Transitions using invariants and state equation in 1827 ms found 0 transitions.
[2023-03-21 22:46:21] [INFO ] Invariant cache hit.
[2023-03-21 22:46:21] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-21 22:46:21] [INFO ] Invariant cache hit.
[2023-03-21 22:46:23] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:46:23] [INFO ] Implicit Places using invariants and state equation in 1801 ms returned []
Implicit Place search using SMT with State Equation took 2193 ms to find 0 implicit places.
[2023-03-21 22:46:23] [INFO ] Invariant cache hit.
[2023-03-21 22:46:25] [INFO ] Dead Transitions using invariants and state equation in 1842 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5919 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s2441)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 7026 steps with 0 reset in 1237 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-04 finished in 7278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 49 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-21 22:46:26] [INFO ] Invariant cache hit.
[2023-03-21 22:46:28] [INFO ] Dead Transitions using invariants and state equation in 1873 ms found 0 transitions.
[2023-03-21 22:46:28] [INFO ] Invariant cache hit.
[2023-03-21 22:46:28] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-21 22:46:28] [INFO ] Invariant cache hit.
[2023-03-21 22:46:30] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:46:30] [INFO ] Implicit Places using invariants and state equation in 1688 ms returned []
Implicit Place search using SMT with State Equation took 2091 ms to find 0 implicit places.
[2023-03-21 22:46:30] [INFO ] Invariant cache hit.
[2023-03-21 22:46:32] [INFO ] Dead Transitions using invariants and state equation in 1921 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5937 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s594)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-06 finished in 6042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 154 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-21 22:46:32] [INFO ] Invariant cache hit.
[2023-03-21 22:46:34] [INFO ] Dead Transitions using invariants and state equation in 1916 ms found 0 transitions.
[2023-03-21 22:46:34] [INFO ] Invariant cache hit.
[2023-03-21 22:46:35] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-21 22:46:35] [INFO ] Invariant cache hit.
[2023-03-21 22:46:36] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:46:36] [INFO ] Implicit Places using invariants and state equation in 1798 ms returned []
Implicit Place search using SMT with State Equation took 2194 ms to find 0 implicit places.
[2023-03-21 22:46:37] [INFO ] Redundant transitions in 130 ms returned []
[2023-03-21 22:46:37] [INFO ] Invariant cache hit.
[2023-03-21 22:46:38] [INFO ] Dead Transitions using invariants and state equation in 1838 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6243 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s488)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-08 finished in 6358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 51 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-21 22:46:39] [INFO ] Invariant cache hit.
[2023-03-21 22:46:40] [INFO ] Dead Transitions using invariants and state equation in 1751 ms found 0 transitions.
[2023-03-21 22:46:40] [INFO ] Invariant cache hit.
[2023-03-21 22:46:41] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-21 22:46:41] [INFO ] Invariant cache hit.
[2023-03-21 22:46:42] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:46:42] [INFO ] Implicit Places using invariants and state equation in 1718 ms returned []
Implicit Place search using SMT with State Equation took 2098 ms to find 0 implicit places.
[2023-03-21 22:46:42] [INFO ] Invariant cache hit.
[2023-03-21 22:46:44] [INFO ] Dead Transitions using invariants and state equation in 1872 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5775 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 1 s984), p0:(GT 3 s1593)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-10 finished in 5901 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X((p0 U X(p1))))))))'
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 50 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-21 22:46:44] [INFO ] Invariant cache hit.
[2023-03-21 22:46:46] [INFO ] Dead Transitions using invariants and state equation in 1841 ms found 0 transitions.
[2023-03-21 22:46:46] [INFO ] Invariant cache hit.
[2023-03-21 22:46:47] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-03-21 22:46:47] [INFO ] Invariant cache hit.
[2023-03-21 22:46:48] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:46:48] [INFO ] Implicit Places using invariants and state equation in 1760 ms returned []
Implicit Place search using SMT with State Equation took 2158 ms to find 0 implicit places.
[2023-03-21 22:46:48] [INFO ] Invariant cache hit.
[2023-03-21 22:46:50] [INFO ] Dead Transitions using invariants and state equation in 1811 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5861 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(LEQ s2177 s1215), p1:(AND (LEQ s2428 s1902) (LEQ s952 s1758))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-12 finished in 6082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 147 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-21 22:46:51] [INFO ] Invariant cache hit.
[2023-03-21 22:46:53] [INFO ] Dead Transitions using invariants and state equation in 1880 ms found 0 transitions.
[2023-03-21 22:46:53] [INFO ] Invariant cache hit.
[2023-03-21 22:46:53] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-21 22:46:53] [INFO ] Invariant cache hit.
[2023-03-21 22:46:54] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:46:55] [INFO ] Implicit Places using invariants and state equation in 1645 ms returned []
Implicit Place search using SMT with State Equation took 2022 ms to find 0 implicit places.
[2023-03-21 22:46:55] [INFO ] Redundant transitions in 132 ms returned []
[2023-03-21 22:46:55] [INFO ] Invariant cache hit.
[2023-03-21 22:46:56] [INFO ] Dead Transitions using invariants and state equation in 1720 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5916 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s1804)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-13 finished in 6006 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||F(p1)) U G(p2)))'
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 140 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-21 22:46:57] [INFO ] Invariant cache hit.
[2023-03-21 22:46:59] [INFO ] Dead Transitions using invariants and state equation in 1897 ms found 0 transitions.
[2023-03-21 22:46:59] [INFO ] Invariant cache hit.
[2023-03-21 22:46:59] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-21 22:46:59] [INFO ] Invariant cache hit.
[2023-03-21 22:47:00] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:47:01] [INFO ] Implicit Places using invariants and state equation in 1690 ms returned []
Implicit Place search using SMT with State Equation took 2069 ms to find 0 implicit places.
[2023-03-21 22:47:01] [INFO ] Redundant transitions in 126 ms returned []
[2023-03-21 22:47:01] [INFO ] Invariant cache hit.
[2023-03-21 22:47:03] [INFO ] Dead Transitions using invariants and state equation in 1907 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6152 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ s1044 s925), p0:(LEQ s1854 s461), p1:(LEQ s2293 s2295)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 43800 steps with 4 reset in 10001 ms.
Stack based approach found an accepted trace after 49622 steps with 8 reset with depth 16361 and stack size 2891 in 9407 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-14 finished in 25693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(((p1||X(p0)) U p2)))))'
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 49 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-21 22:47:22] [INFO ] Invariant cache hit.
[2023-03-21 22:47:24] [INFO ] Dead Transitions using invariants and state equation in 1753 ms found 0 transitions.
[2023-03-21 22:47:24] [INFO ] Invariant cache hit.
[2023-03-21 22:47:24] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-21 22:47:24] [INFO ] Invariant cache hit.
[2023-03-21 22:47:25] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:47:25] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 1102 ms to find 0 implicit places.
[2023-03-21 22:47:25] [INFO ] Invariant cache hit.
[2023-03-21 22:47:27] [INFO ] Dead Transitions using invariants and state equation in 1739 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4645 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(NOT p2), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s1783 s754), p2:(GT s1602 s1853), p1:(GT s1589 s2485)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 40180 steps with 0 reset in 10002 ms.
Product exploration timeout after 38900 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 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 438 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10275 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-21 22:48:10] [INFO ] Invariant cache hit.
[2023-03-21 22:48:10] [INFO ] [Real]Absence check using 500 positive place invariants in 94 ms returned sat
[2023-03-21 22:48:12] [INFO ] After 2047ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 22:48:12] [INFO ] [Nat]Absence check using 500 positive place invariants in 94 ms returned sat
[2023-03-21 22:48:35] [INFO ] After 22177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 22:48:35] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:48:37] [INFO ] After 2389ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:48:37] [INFO ] After 2390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-21 22:48:37] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4004 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 20 are kept as prefixes of interest. Removing 2480 places using SCC suffix rule.1 ms
Discarding 2480 places :
Also discarding 3968 output transitions
Drop transitions removed 3968 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 4 ms. Remains 20 /2500 variables (removed 2480) and now considering 32/4001 (removed 3969) transitions.
// Phase 1: matrix 32 rows 20 cols
[2023-03-21 22:48:41] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-21 22:48:41] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 20/2500 places, 32/4001 transitions.
Finished random walk after 752 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=752 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 450 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 53 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-21 22:48:42] [INFO ] Computed 500 place invariants in 14 ms
[2023-03-21 22:48:44] [INFO ] Dead Transitions using invariants and state equation in 1821 ms found 0 transitions.
[2023-03-21 22:48:44] [INFO ] Invariant cache hit.
[2023-03-21 22:48:44] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-21 22:48:44] [INFO ] Invariant cache hit.
[2023-03-21 22:48:46] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:48:46] [INFO ] Implicit Places using invariants and state equation in 1661 ms returned []
Implicit Place search using SMT with State Equation took 2010 ms to find 0 implicit places.
[2023-03-21 22:48:46] [INFO ] Invariant cache hit.
[2023-03-21 22:48:47] [INFO ] Dead Transitions using invariants and state equation in 1720 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5608 ms. Remains : 2500/2500 places, 4001/4001 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 (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 335 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10031 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-21 22:49:10] [INFO ] Invariant cache hit.
[2023-03-21 22:49:10] [INFO ] [Real]Absence check using 500 positive place invariants in 106 ms returned sat
[2023-03-21 22:49:12] [INFO ] After 1992ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 22:49:12] [INFO ] [Nat]Absence check using 500 positive place invariants in 93 ms returned sat
[2023-03-21 22:49:34] [INFO ] After 21686ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 22:49:34] [INFO ] State equation strengthened by 500 read => feed constraints.
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:644)
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-21 22:49:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 22:49:37] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 4003 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 20 are kept as prefixes of interest. Removing 2480 places using SCC suffix rule.1 ms
Discarding 2480 places :
Also discarding 3968 output transitions
Drop transitions removed 3968 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 4 ms. Remains 20 /2500 variables (removed 2480) and now considering 32/4001 (removed 3969) transitions.
// Phase 1: matrix 32 rows 20 cols
[2023-03-21 22:49:41] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-21 22:49:41] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 20/2500 places, 32/4001 transitions.
Finished random walk after 1807 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=903 )
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 411 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration timeout after 40730 steps with 0 reset in 10003 ms.
Product exploration timeout after 39020 steps with 0 reset in 10001 ms.
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 49 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-21 22:50:02] [INFO ] Computed 500 place invariants in 13 ms
[2023-03-21 22:50:03] [INFO ] Dead Transitions using invariants and state equation in 1755 ms found 0 transitions.
[2023-03-21 22:50:03] [INFO ] Invariant cache hit.
[2023-03-21 22:50:04] [INFO ] Implicit Places using invariants in 359 ms returned []
[2023-03-21 22:50:04] [INFO ] Invariant cache hit.
[2023-03-21 22:50:05] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:50:05] [INFO ] Implicit Places using invariants and state equation in 1658 ms returned []
Implicit Place search using SMT with State Equation took 2019 ms to find 0 implicit places.
[2023-03-21 22:50:05] [INFO ] Invariant cache hit.
[2023-03-21 22:50:07] [INFO ] Dead Transitions using invariants and state equation in 1688 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5513 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-15 finished in 165097 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) U (X(p1)&&G(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(!p0&&F(p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(((p1||X(p0)) U p2)))))'
Found a Lengthening insensitive property : JoinFreeModules-PT-0500-LTLCardinality-15
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 132 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-21 22:50:08] [INFO ] Invariant cache hit.
[2023-03-21 22:50:10] [INFO ] Dead Transitions using invariants and state equation in 1678 ms found 0 transitions.
[2023-03-21 22:50:10] [INFO ] Invariant cache hit.
[2023-03-21 22:50:10] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-21 22:50:10] [INFO ] Invariant cache hit.
[2023-03-21 22:50:11] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:50:12] [INFO ] Implicit Places using invariants and state equation in 1650 ms returned []
Implicit Place search using SMT with State Equation took 2020 ms to find 0 implicit places.
[2023-03-21 22:50:12] [INFO ] Invariant cache hit.
[2023-03-21 22:50:13] [INFO ] Dead Transitions using invariants and state equation in 1685 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5519 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(NOT p2), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s1783 s754), p2:(GT s1602 s1853), p1:(GT s1589 s2485)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 40660 steps with 0 reset in 10001 ms.
Product exploration timeout after 39230 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 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 340 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10028 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-21 22:50:55] [INFO ] Invariant cache hit.
[2023-03-21 22:50:56] [INFO ] [Real]Absence check using 500 positive place invariants in 90 ms returned sat
[2023-03-21 22:50:57] [INFO ] After 1976ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 22:50:58] [INFO ] [Nat]Absence check using 500 positive place invariants in 87 ms returned sat
[2023-03-21 22:51:17] [INFO ] After 19581ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 22:51:17] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:51:20] [INFO ] After 2507ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 22:51:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:51:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:51:21] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-21 22:51:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 723 ms
[2023-03-21 22:51:21] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-21 22:51:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2023-03-21 22:51:21] [INFO ] After 3926ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 748 ms.
[2023-03-21 22:51:22] [INFO ] After 24687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4003 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 20 are kept as prefixes of interest. Removing 2480 places using SCC suffix rule.1 ms
Discarding 2480 places :
Also discarding 3968 output transitions
Drop transitions removed 3968 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 3 ms. Remains 20 /2500 variables (removed 2480) and now considering 32/4001 (removed 3969) transitions.
// Phase 1: matrix 32 rows 20 cols
[2023-03-21 22:51:26] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-21 22:51:26] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 20/2500 places, 32/4001 transitions.
Finished random walk after 1401 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1401 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 389 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 50 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-21 22:51:27] [INFO ] Computed 500 place invariants in 13 ms
[2023-03-21 22:51:29] [INFO ] Dead Transitions using invariants and state equation in 1765 ms found 0 transitions.
[2023-03-21 22:51:29] [INFO ] Invariant cache hit.
[2023-03-21 22:51:29] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-03-21 22:51:29] [INFO ] Invariant cache hit.
[2023-03-21 22:51:30] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:51:31] [INFO ] Implicit Places using invariants and state equation in 1682 ms returned []
Implicit Place search using SMT with State Equation took 2046 ms to find 0 implicit places.
[2023-03-21 22:51:31] [INFO ] Invariant cache hit.
[2023-03-21 22:51:32] [INFO ] Dead Transitions using invariants and state equation in 1727 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5589 ms. Remains : 2500/2500 places, 4001/4001 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 (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 319 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10115 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-21 22:51:55] [INFO ] Invariant cache hit.
[2023-03-21 22:51:55] [INFO ] [Real]Absence check using 500 positive place invariants in 91 ms returned sat
[2023-03-21 22:51:57] [INFO ] After 2001ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 22:51:57] [INFO ] [Nat]Absence check using 500 positive place invariants in 93 ms returned sat
[2023-03-21 22:52:19] [INFO ] After 21548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 22:52:19] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:52:21] [INFO ] After 2744ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 22:52:24] [INFO ] Deduced a trap composed of 3 places in 1946 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 22:52:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 22:52:24] [INFO ] After 26990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 4000 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 20 are kept as prefixes of interest. Removing 2480 places using SCC suffix rule.1 ms
Discarding 2480 places :
Also discarding 3968 output transitions
Drop transitions removed 3968 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 6 ms. Remains 20 /2500 variables (removed 2480) and now considering 32/4001 (removed 3969) transitions.
// Phase 1: matrix 32 rows 20 cols
[2023-03-21 22:52:28] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-21 22:52:28] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 20/2500 places, 32/4001 transitions.
Finished random walk after 1839 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1839 )
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 417 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration timeout after 40300 steps with 0 reset in 10003 ms.
Product exploration timeout after 38950 steps with 0 reset in 10003 ms.
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 51 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-21 22:52:49] [INFO ] Computed 500 place invariants in 12 ms
[2023-03-21 22:52:50] [INFO ] Dead Transitions using invariants and state equation in 1710 ms found 0 transitions.
[2023-03-21 22:52:50] [INFO ] Invariant cache hit.
[2023-03-21 22:52:51] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-21 22:52:51] [INFO ] Invariant cache hit.
[2023-03-21 22:52:52] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-21 22:52:53] [INFO ] Implicit Places using invariants and state equation in 1692 ms returned []
Implicit Place search using SMT with State Equation took 2052 ms to find 0 implicit places.
[2023-03-21 22:52:53] [INFO ] Invariant cache hit.
[2023-03-21 22:52:54] [INFO ] Dead Transitions using invariants and state equation in 1719 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5537 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-15 finished in 166791 ms.
[2023-03-21 22:52:54] [INFO ] Flatten gal took : 112 ms
[2023-03-21 22:52:54] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-21 22:52:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 4001 transitions and 11500 arcs took 26 ms.
Total runtime 923803 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT JoinFreeModules-PT-0500
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLCardinality

FORMULA JoinFreeModules-PT-0500-LTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-LTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679439267608

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 14 (type EXCL) for 9 JoinFreeModules-PT-0500-LTLCardinality-15
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0500-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-15: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 3/719 11/32 JoinFreeModules-PT-0500-LTLCardinality-15 132616 m, 26523 m/sec, 198951 t fired, .

Time elapsed: 5 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0500-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-15: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 8/719 25/32 JoinFreeModules-PT-0500-LTLCardinality-15 316213 m, 36719 m/sec, 474501 t fired, .

Time elapsed: 10 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 14 (type EXCL) for JoinFreeModules-PT-0500-LTLCardinality-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0500-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-15: CONJ 0 1 0 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 1 (type EXCL) for 0 JoinFreeModules-PT-0500-LTLCardinality-00
lola: time limit : 896 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0500-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-15: CONJ 0 1 0 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/896 15/32 JoinFreeModules-PT-0500-LTLCardinality-00 190836 m, 38167 m/sec, 286375 t fired, .

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0500-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-15: CONJ 0 1 0 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/896 30/32 JoinFreeModules-PT-0500-LTLCardinality-00 381077 m, 38048 m/sec, 571803 t fired, .

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for JoinFreeModules-PT-0500-LTLCardinality-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0500-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
JoinFreeModules-PT-0500-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-15: CONJ 0 1 0 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 16 (type EXCL) for 9 JoinFreeModules-PT-0500-LTLCardinality-15
lola: time limit : 1190 sec
lola: memory limit: 32 pages
lola: FINISHED task # 16 (type EXCL) for JoinFreeModules-PT-0500-LTLCardinality-15
lola: result : false
lola: markings : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 JoinFreeModules-PT-0500-LTLCardinality-03
lola: time limit : 1785 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0500-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
JoinFreeModules-PT-0500-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-15: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1785 2/32 JoinFreeModules-PT-0500-LTLCardinality-03 27775 m, 5555 m/sec, 35997 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0500-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
JoinFreeModules-PT-0500-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-15: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1785 4/32 JoinFreeModules-PT-0500-LTLCardinality-03 55597 m, 5564 m/sec, 72082 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0500-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
JoinFreeModules-PT-0500-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-15: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1785 6/32 JoinFreeModules-PT-0500-LTLCardinality-03 83406 m, 5561 m/sec, 108152 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0500-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
JoinFreeModules-PT-0500-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-15: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/1785 8/32 JoinFreeModules-PT-0500-LTLCardinality-03 111131 m, 5545 m/sec, 144113 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0500-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
JoinFreeModules-PT-0500-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-15: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/1785 10/32 JoinFreeModules-PT-0500-LTLCardinality-03 138686 m, 5511 m/sec, 179849 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: FINISHED task # 7 (type EXCL) for JoinFreeModules-PT-0500-LTLCardinality-03
lola: result : false
lola: markings : 163586
lola: fired transitions : 212148
lola: time used : 30.000000
lola: memory pages used : 11
lola: LAUNCH task # 4 (type EXCL) for 3 JoinFreeModules-PT-0500-LTLCardinality-02
lola: time limit : 3540 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
JoinFreeModules-PT-0500-LTLCardinality-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0500-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
JoinFreeModules-PT-0500-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-15: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 0/3540 1/32 JoinFreeModules-PT-0500-LTLCardinality-02 2595 m, 519 m/sec, 3339 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
JoinFreeModules-PT-0500-LTLCardinality-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0500-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
JoinFreeModules-PT-0500-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-15: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3540 2/32 JoinFreeModules-PT-0500-LTLCardinality-02 29095 m, 5300 m/sec, 37710 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
JoinFreeModules-PT-0500-LTLCardinality-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0500-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
JoinFreeModules-PT-0500-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-15: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3540 3/32 JoinFreeModules-PT-0500-LTLCardinality-02 55376 m, 5256 m/sec, 71791 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
JoinFreeModules-PT-0500-LTLCardinality-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0500-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
JoinFreeModules-PT-0500-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-15: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3540 4/32 JoinFreeModules-PT-0500-LTLCardinality-02 81867 m, 5298 m/sec, 106148 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
JoinFreeModules-PT-0500-LTLCardinality-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0500-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
JoinFreeModules-PT-0500-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-15: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3540 5/32 JoinFreeModules-PT-0500-LTLCardinality-02 108320 m, 5290 m/sec, 140465 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
JoinFreeModules-PT-0500-LTLCardinality-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0500-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
JoinFreeModules-PT-0500-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-15: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3540 6/32 JoinFreeModules-PT-0500-LTLCardinality-02 134787 m, 5293 m/sec, 174794 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
JoinFreeModules-PT-0500-LTLCardinality-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0500-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
JoinFreeModules-PT-0500-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0500-LTLCardinality-15: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3540 6/32 JoinFreeModules-PT-0500-LTLCardinality-02 161363 m, 5315 m/sec, 209262 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: FINISHED task # 4 (type EXCL) for JoinFreeModules-PT-0500-LTLCardinality-02
lola: result : false
lola: markings : 163981
lola: fired transitions : 212659
lola: time used : 31.000000
lola: memory pages used : 6
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
JoinFreeModules-PT-0500-LTLCardinality-00: LTL unknown AGGR
JoinFreeModules-PT-0500-LTLCardinality-02: LTL false LTL model checker
JoinFreeModules-PT-0500-LTLCardinality-03: LTL false LTL model checker
JoinFreeModules-PT-0500-LTLCardinality-15: CONJ unknown CONJ


Time elapsed: 91 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is JoinFreeModules-PT-0500, 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 r231-tall-167856415700203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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