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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.7K Feb 25 13:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 13:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 13:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 13:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 25 13:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 13:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 27K 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 DatabaseWithMutex-COL-10-LTLFireability-00
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-01
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-02
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-03
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-04
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-05
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-06
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-07
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-08
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-09
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-10
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-11
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-12
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-13
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-14
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678413793998

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-COL-10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 02:03:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 02:03:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 02:03:15] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-10 02:03:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-10 02:03:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 650 ms
[2023-03-10 02:03:16] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 830 PT places and 800.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-10 02:03:16] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions 22 arcs in 5 ms.
[2023-03-10 02:03:16] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 168 steps, including 0 resets, run visited all 10 properties in 10 ms. (steps per millisecond=16 )
[2023-03-10 02:03:16] [INFO ] Flatten gal took : 14 ms
[2023-03-10 02:03:16] [INFO ] Flatten gal took : 2 ms
Transition Release forces synchronizations/join behavior on parameter s of sort site
Transition Acquire forces synchronizations/join behavior on parameter f of sort file
[2023-03-10 02:03:16] [INFO ] Unfolded HLPN to a Petri net with 830 places and 800 transitions 3800 arcs in 31 ms.
[2023-03-10 02:03:16] [INFO ] Unfolded 15 HLPN properties in 1 ms.
[2023-03-10 02:03:16] [INFO ] Reduced 90 identical enabling conditions.
Support contains 830 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 16 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2023-03-10 02:03:16] [INFO ] Computed 130 place invariants in 62 ms
[2023-03-10 02:03:17] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-10 02:03:17] [INFO ] Invariant cache hit.
[2023-03-10 02:03:17] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
[2023-03-10 02:03:17] [INFO ] Invariant cache hit.
[2023-03-10 02:03:17] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1283 ms. Remains : 830/830 places, 800/800 transitions.
Support contains 830 out of 830 places after structural reductions.
[2023-03-10 02:03:18] [INFO ] Flatten gal took : 121 ms
[2023-03-10 02:03:18] [INFO ] Flatten gal took : 108 ms
[2023-03-10 02:03:19] [INFO ] Input system was already deterministic with 800 transitions.
Finished random walk after 115 steps, including 0 resets, run visited all 13 properties in 23 ms. (steps per millisecond=5 )
FORMULA DatabaseWithMutex-COL-10-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DatabaseWithMutex-COL-10-LTLFireability-10 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' '!(X((X(G(p0)) U (p1 U p0))))'
Support contains 300 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 49 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-10 02:03:19] [INFO ] Invariant cache hit.
[2023-03-10 02:03:20] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-10 02:03:20] [INFO ] Invariant cache hit.
[2023-03-10 02:03:20] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 992 ms to find 0 implicit places.
[2023-03-10 02:03:20] [INFO ] Invariant cache hit.
[2023-03-10 02:03:21] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1516 ms. Remains : 830/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 312 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (AND (GEQ s202 1) (GEQ s522 1) (GEQ s532 1) (GEQ s542 1) (GEQ s552 1) (GEQ s562 1) (GEQ s572 1) (GEQ s582 1) (GEQ s592 1) (GEQ s602 1)) (AND (GEQ s...], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-00 finished in 1898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 110 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 43 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-10 02:03:21] [INFO ] Invariant cache hit.
[2023-03-10 02:03:22] [INFO ] Implicit Places using invariants in 506 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 510 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 25 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 578 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s520 1)) (AND (GEQ s60 1) (GEQ s526 1)) (AND (GEQ s36 1) (GEQ s523 1)) (AND (GEQ s74 1) (GEQ s527 1)) (AND (GEQ s15 1) (GEQ s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 6024 reset in 776 ms.
Product exploration explored 100000 steps with 6026 reset in 736 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
// Phase 1: matrix 800 rows 730 cols
[2023-03-10 02:03:24] [INFO ] Computed 30 place invariants in 35 ms
[2023-03-10 02:03:25] [INFO ] [Real]Absence check using 26 positive place invariants in 111 ms returned sat
[2023-03-10 02:03:25] [INFO ] [Real]Absence check using 26 positive and 4 generalized place invariants in 26 ms returned sat
[2023-03-10 02:03:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:03:28] [INFO ] [Real]Absence check using state equation in 3255 ms returned sat
[2023-03-10 02:03:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:03:29] [INFO ] [Nat]Absence check using 26 positive place invariants in 50 ms returned sat
[2023-03-10 02:03:30] [INFO ] [Nat]Absence check using 26 positive and 4 generalized place invariants in 130 ms returned sat
[2023-03-10 02:03:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:03:32] [INFO ] [Nat]Absence check using state equation in 2312 ms returned sat
[2023-03-10 02:03:32] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 3 ms to minimize.
[2023-03-10 02:03:32] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 1 ms to minimize.
[2023-03-10 02:03:32] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
[2023-03-10 02:03:33] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2023-03-10 02:03:33] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2023-03-10 02:03:33] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 0 ms to minimize.
[2023-03-10 02:03:33] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 1 ms to minimize.
[2023-03-10 02:03:33] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
[2023-03-10 02:03:34] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 1 ms to minimize.
[2023-03-10 02:03:34] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
[2023-03-10 02:03:34] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 1 ms to minimize.
[2023-03-10 02:03:34] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2079 ms
[2023-03-10 02:03:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2079 ms
[2023-03-10 02:03:34] [INFO ] Computed and/alt/rep : 700/2300/700 causal constraints (skipped 0 transitions) in 49 ms.
[2023-03-10 02:03:41] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
[2023-03-10 02:03:41] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 0 ms to minimize.
[2023-03-10 02:03:41] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 0 ms to minimize.
[2023-03-10 02:03:42] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 0 ms to minimize.
[2023-03-10 02:03:42] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 1 ms to minimize.
[2023-03-10 02:03:42] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 0 ms to minimize.
[2023-03-10 02:03:42] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 1 ms to minimize.
[2023-03-10 02:03:42] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 0 ms to minimize.
[2023-03-10 02:03:43] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 0 ms to minimize.
[2023-03-10 02:03:43] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 0 ms to minimize.
[2023-03-10 02:03:43] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 1 ms to minimize.
[2023-03-10 02:03:43] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2638 ms
[2023-03-10 02:03:43] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2639 ms
[2023-03-10 02:03:44] [INFO ] Deduced a trap composed of 11 places in 310 ms of which 0 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 02:03:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 110 out of 730 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 730/730 places, 800/800 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 730 transition count 700
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 630 transition count 700
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 200 place count 630 transition count 600
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 400 place count 530 transition count 600
Applied a total of 400 rules in 91 ms. Remains 530 /730 variables (removed 200) and now considering 600/800 (removed 200) transitions.
// Phase 1: matrix 600 rows 530 cols
[2023-03-10 02:03:44] [INFO ] Computed 30 place invariants in 21 ms
[2023-03-10 02:03:44] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-10 02:03:44] [INFO ] Invariant cache hit.
[2023-03-10 02:03:45] [INFO ] Implicit Places using invariants and state equation in 1095 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
[2023-03-10 02:03:45] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-10 02:03:45] [INFO ] Invariant cache hit.
[2023-03-10 02:03:46] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 530/730 places, 600/800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1824 ms. Remains : 530/730 places, 600/800 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-10 02:03:46] [INFO ] Invariant cache hit.
[2023-03-10 02:03:47] [INFO ] [Real]Absence check using 28 positive place invariants in 82 ms returned sat
[2023-03-10 02:03:47] [INFO ] [Real]Absence check using 28 positive and 2 generalized place invariants in 17 ms returned sat
[2023-03-10 02:03:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:03:50] [INFO ] [Real]Absence check using state equation in 2793 ms returned sat
[2023-03-10 02:03:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:03:51] [INFO ] [Nat]Absence check using 28 positive place invariants in 43 ms returned sat
[2023-03-10 02:03:51] [INFO ] [Nat]Absence check using 28 positive and 2 generalized place invariants in 41 ms returned sat
[2023-03-10 02:03:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:03:53] [INFO ] [Nat]Absence check using state equation in 1885 ms returned sat
[2023-03-10 02:03:53] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2023-03-10 02:03:53] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-10 02:03:53] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2023-03-10 02:03:53] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2023-03-10 02:03:53] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-10 02:03:53] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-10 02:03:54] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2023-03-10 02:03:54] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2023-03-10 02:03:54] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-10 02:03:54] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-10 02:03:54] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2023-03-10 02:03:54] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1277 ms
[2023-03-10 02:03:54] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1278 ms
[2023-03-10 02:03:54] [INFO ] Computed and/alt/rep : 500/2100/500 causal constraints (skipped 0 transitions) in 37 ms.
[2023-03-10 02:03:57] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2023-03-10 02:03:57] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-10 02:03:57] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2023-03-10 02:03:57] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-10 02:03:57] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2023-03-10 02:03:57] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2023-03-10 02:03:57] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-10 02:03:58] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2023-03-10 02:03:58] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2023-03-10 02:03:58] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2023-03-10 02:03:58] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-10 02:03:58] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1402 ms
[2023-03-10 02:03:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1403 ms
[2023-03-10 02:03:58] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2023-03-10 02:03:58] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-10 02:03:58] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2023-03-10 02:03:58] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-10 02:03:59] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2023-03-10 02:03:59] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2023-03-10 02:03:59] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2023-03-10 02:03:59] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2023-03-10 02:03:59] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-10 02:03:59] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2023-03-10 02:03:59] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2023-03-10 02:03:59] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1224 ms
[2023-03-10 02:03:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1229 ms
[2023-03-10 02:03:59] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 2 ms to minimize.
[2023-03-10 02:04:00] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2023-03-10 02:04:00] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2023-03-10 02:04:00] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-03-10 02:04:00] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2023-03-10 02:04:00] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2023-03-10 02:04:00] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2023-03-10 02:04:00] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2023-03-10 02:04:00] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2023-03-10 02:04:00] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2023-03-10 02:04:01] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-10 02:04:01] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1194 ms
[2023-03-10 02:04:01] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1194 ms
[2023-03-10 02:04:01] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
[2023-03-10 02:04:01] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-10 02:04:01] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2023-03-10 02:04:01] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2023-03-10 02:04:01] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2023-03-10 02:04:01] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-10 02:04:01] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2023-03-10 02:04:01] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2023-03-10 02:04:02] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-10 02:04:02] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2023-03-10 02:04:02] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2023-03-10 02:04:02] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1132 ms
[2023-03-10 02:04:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1132 ms
[2023-03-10 02:04:02] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-10 02:04:02] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2023-03-10 02:04:02] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-10 02:04:02] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2023-03-10 02:04:02] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2023-03-10 02:04:03] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2023-03-10 02:04:03] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2023-03-10 02:04:03] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2023-03-10 02:04:03] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-10 02:04:04] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-10 02:04:04] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2023-03-10 02:04:04] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2137 ms
[2023-03-10 02:04:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2138 ms
[2023-03-10 02:04:04] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-10 02:04:04] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-10 02:04:05] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 782 ms
[2023-03-10 02:04:05] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 1 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
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-10 02:04:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8189 reset in 747 ms.
Product exploration explored 100000 steps with 8210 reset in 737 ms.
Support contains 110 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 600/600 transitions.
Applied a total of 0 rules in 23 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2023-03-10 02:04:07] [INFO ] Invariant cache hit.
[2023-03-10 02:04:07] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-10 02:04:07] [INFO ] Invariant cache hit.
[2023-03-10 02:04:08] [INFO ] Implicit Places using invariants and state equation in 1310 ms returned []
Implicit Place search using SMT with State Equation took 1580 ms to find 0 implicit places.
[2023-03-10 02:04:08] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-10 02:04:08] [INFO ] Invariant cache hit.
[2023-03-10 02:04:09] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1923 ms. Remains : 530/530 places, 600/600 transitions.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-01 finished in 47707 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))'
Support contains 110 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 110 places and 0 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 1 with 310 rules applied. Total rules applied 410 place count 720 transition count 500
Reduce places removed 200 places and 0 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 2 with 300 rules applied. Total rules applied 710 place count 520 transition count 400
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 3 with 100 rules applied. Total rules applied 810 place count 420 transition count 400
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 100 Pre rules applied. Total rules applied 810 place count 420 transition count 300
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 4 with 200 rules applied. Total rules applied 1010 place count 320 transition count 300
Applied a total of 1010 rules in 43 ms. Remains 320 /830 variables (removed 510) and now considering 300/800 (removed 500) transitions.
// Phase 1: matrix 300 rows 320 cols
[2023-03-10 02:04:09] [INFO ] Computed 120 place invariants in 5 ms
[2023-03-10 02:04:10] [INFO ] Implicit Places using invariants in 789 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219]
[2023-03-10 02:04:10] [INFO ] Actually due to overlaps returned [120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 795 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 220/830 places, 300/800 transitions.
Applied a total of 0 rules in 5 ms. Remains 220 /220 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 844 ms. Remains : 220/830 places, 300/800 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s115 1) (GEQ s185 1)) (AND (GEQ s112 1) (GEQ s212 1)) (AND (GEQ s117 1) (GEQ s217 1)) (AND (GEQ s116 1) (GEQ s146 1)) (AND (GEQ s113 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 865 ms.
Product exploration explored 100000 steps with 50000 reset in 864 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 : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-03 finished in 2725 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))'
Support contains 10 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 830 transition count 600
Reduce places removed 210 places and 0 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 1 with 410 rules applied. Total rules applied 610 place count 620 transition count 400
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 2 with 200 rules applied. Total rules applied 810 place count 420 transition count 400
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 810 place count 420 transition count 300
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 1010 place count 320 transition count 300
Applied a total of 1010 rules in 46 ms. Remains 320 /830 variables (removed 510) and now considering 300/800 (removed 500) transitions.
// Phase 1: matrix 300 rows 320 cols
[2023-03-10 02:04:12] [INFO ] Computed 120 place invariants in 6 ms
[2023-03-10 02:04:12] [INFO ] Implicit Places using invariants in 714 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219]
[2023-03-10 02:04:12] [INFO ] Actually due to overlaps returned [120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 717 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 220/830 places, 300/800 transitions.
Applied a total of 0 rules in 13 ms. Remains 220 /220 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 776 ms. Remains : 220/830 places, 300/800 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s1 1) (LT s0 1) (LT s3 1) (LT s2 1) (LT s6 1) (LT s4 1) (LT s7 1) (LT s5 1) (LT s8 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7679 reset in 345 ms.
Stack based approach found an accepted trace after 3692 steps with 282 reset with depth 14 and stack size 14 in 14 ms.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-04 finished in 1183 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((G(F(p0))||(F(p1)&&G(!p2))))))'
Support contains 400 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 830 transition count 700
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 730 transition count 700
Applied a total of 200 rules in 40 ms. Remains 730 /830 variables (removed 100) and now considering 700/800 (removed 100) transitions.
// Phase 1: matrix 700 rows 730 cols
[2023-03-10 02:04:13] [INFO ] Computed 130 place invariants in 11 ms
[2023-03-10 02:04:13] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-10 02:04:13] [INFO ] Invariant cache hit.
[2023-03-10 02:04:14] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
[2023-03-10 02:04:14] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-10 02:04:14] [INFO ] Invariant cache hit.
[2023-03-10 02:04:14] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 730/830 places, 700/800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1333 ms. Remains : 730/830 places, 700/800 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LT s291 1) (LT s226 1) (LT s287 1) (LT s222 1) (LT s299 1) (LT s234 1) (LT s295 1) (LT s230 1) (LT s307 1) (LT s242 1) (LT s303 1) (LT s238 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1685 reset in 847 ms.
Product exploration explored 100000 steps with 1691 reset in 830 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 p1 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 6 factoid took 314 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2)]
Finished random walk after 181 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p0))), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 6 factoid took 331 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2)]
Support contains 400 out of 730 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 730/730 places, 700/700 transitions.
Applied a total of 0 rules in 15 ms. Remains 730 /730 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2023-03-10 02:04:17] [INFO ] Invariant cache hit.
[2023-03-10 02:04:17] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-10 02:04:17] [INFO ] Invariant cache hit.
[2023-03-10 02:04:18] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
[2023-03-10 02:04:18] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 02:04:18] [INFO ] Invariant cache hit.
[2023-03-10 02:04:18] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1240 ms. Remains : 730/730 places, 700/700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 6 factoid took 344 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) p2)]
Finished random walk after 229 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 6 factoid took 341 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 1721 reset in 831 ms.
Product exploration explored 100000 steps with 1633 reset in 830 ms.
Support contains 400 out of 730 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 730/730 places, 700/700 transitions.
Applied a total of 0 rules in 18 ms. Remains 730 /730 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2023-03-10 02:04:21] [INFO ] Invariant cache hit.
[2023-03-10 02:04:21] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-10 02:04:21] [INFO ] Invariant cache hit.
[2023-03-10 02:04:22] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
[2023-03-10 02:04:22] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-10 02:04:22] [INFO ] Invariant cache hit.
[2023-03-10 02:04:22] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1253 ms. Remains : 730/730 places, 700/700 transitions.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-05 finished in 9851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!((p0 U p1) U (p0 U (X(X(G(p0))) U p2))))'
Support contains 310 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 9 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2023-03-10 02:04:23] [INFO ] Computed 130 place invariants in 10 ms
[2023-03-10 02:04:23] [INFO ] Implicit Places using invariants in 552 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 554 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 5 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 569 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, p0, (AND p0 p2), p2, (AND p0 p2)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s161 1) (GEQ s157 1) (GEQ s169 1) (GEQ s165 1) (GEQ s177 1) (GEQ s173 1) (GEQ s185 1) (GEQ s181 1) (GEQ s120 1) (GEQ s193 1) (GEQ s124 1) (GEQ...], 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]]
Product exploration explored 100000 steps with 33333 reset in 1447 ms.
Product exploration explored 100000 steps with 33333 reset in 1484 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT p2))), true, (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p0 p2))))
Knowledge based reduction with 11 factoid took 270 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-06 finished in 4221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0||F((!p1||X(!p0))))))'
Support contains 210 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 730 transition count 700
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 200 place count 730 transition count 500
Deduced a syphon composed of 200 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 600 place count 530 transition count 500
Applied a total of 600 rules in 41 ms. Remains 530 /830 variables (removed 300) and now considering 500/800 (removed 300) transitions.
// Phase 1: matrix 500 rows 530 cols
[2023-03-10 02:04:27] [INFO ] Computed 130 place invariants in 10 ms
[2023-03-10 02:04:27] [INFO ] Implicit Places using invariants in 389 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 391 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 430/830 places, 500/800 transitions.
Applied a total of 0 rules in 11 ms. Remains 430 /430 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 443 ms. Remains : 430/830 places, 500/800 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND p0 p1), (AND p0 p1)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s251 1) (GEQ s312 1) (GEQ s255 1) (GEQ s316 1) (GEQ s243 1) (GEQ s304 1) (GEQ s247 1) (GEQ s308 1) (GEQ s267 1) (GEQ s328 1) (GEQ s271 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2143 reset in 755 ms.
Product exploration explored 100000 steps with 2120 reset in 753 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND p0 p1), (AND p0 p1)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 83 ms :[(AND p0 p1), (AND p0 p1)]
Support contains 210 out of 430 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 430/430 places, 500/500 transitions.
Applied a total of 0 rules in 14 ms. Remains 430 /430 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 430 cols
[2023-03-10 02:04:29] [INFO ] Computed 30 place invariants in 7 ms
[2023-03-10 02:04:30] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-10 02:04:30] [INFO ] Invariant cache hit.
[2023-03-10 02:04:31] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned []
Implicit Place search using SMT with State Equation took 1809 ms to find 0 implicit places.
[2023-03-10 02:04:31] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 02:04:31] [INFO ] Invariant cache hit.
[2023-03-10 02:04:32] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2207 ms. Remains : 430/430 places, 500/500 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 p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND p0 p1), (AND p0 p1)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 81 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 81 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 2120 reset in 714 ms.
Product exploration explored 100000 steps with 2127 reset in 743 ms.
Support contains 210 out of 430 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 430/430 places, 500/500 transitions.
Applied a total of 0 rules in 6 ms. Remains 430 /430 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-10 02:04:34] [INFO ] Invariant cache hit.
[2023-03-10 02:04:34] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-10 02:04:34] [INFO ] Invariant cache hit.
[2023-03-10 02:04:35] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 933 ms to find 0 implicit places.
[2023-03-10 02:04:35] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-10 02:04:35] [INFO ] Invariant cache hit.
[2023-03-10 02:04:35] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1181 ms. Remains : 430/430 places, 500/500 transitions.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-07 finished in 8348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((F(!p1)&&F(G(!p2))))||p0))))'
Support contains 310 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 9 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2023-03-10 02:04:35] [INFO ] Computed 130 place invariants in 7 ms
[2023-03-10 02:04:35] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-10 02:04:35] [INFO ] Invariant cache hit.
[2023-03-10 02:04:36] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
[2023-03-10 02:04:36] [INFO ] Invariant cache hit.
[2023-03-10 02:04:36] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1059 ms. Remains : 830/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND (NOT p0) p2), (AND (NOT p0) p1)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s620 1)) (AND (GEQ s60 1) (GEQ s626 1)) (AND (GEQ s36 1) (GEQ s623 1)) (AND (GEQ s74 1) (GEQ s627 1)) (AND (GEQ s15 1) (GEQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6051 reset in 1882 ms.
Product exploration explored 100000 steps with 6014 reset in 1870 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 295 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND (NOT p0) p2), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 02:04:41] [INFO ] Invariant cache hit.
[2023-03-10 02:04:41] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p0)))), (F p0), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 9 factoid took 418 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND p2 (NOT p0)), (AND p2 (NOT p0)), (AND p2 (NOT p0))]
Stuttering acceptance computed with spot in 112 ms :[(AND p2 (NOT p0)), (AND p2 (NOT p0)), (AND p2 (NOT p0))]
Support contains 310 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 7 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-10 02:04:42] [INFO ] Invariant cache hit.
[2023-03-10 02:04:42] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-10 02:04:42] [INFO ] Invariant cache hit.
[2023-03-10 02:04:43] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
[2023-03-10 02:04:43] [INFO ] Invariant cache hit.
[2023-03-10 02:04:43] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1055 ms. Remains : 830/830 places, 800/800 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 p2) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Finished random walk after 248 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=62 )
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 5 factoid took 333 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 6018 reset in 1618 ms.
Product exploration explored 100000 steps with 6035 reset in 1641 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 310 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 47 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-10 02:04:48] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-10 02:04:48] [INFO ] Invariant cache hit.
[2023-03-10 02:04:48] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 499 ms. Remains : 830/830 places, 800/800 transitions.
Support contains 310 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 8 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-10 02:04:48] [INFO ] Invariant cache hit.
[2023-03-10 02:04:48] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-10 02:04:48] [INFO ] Invariant cache hit.
[2023-03-10 02:04:49] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
[2023-03-10 02:04:49] [INFO ] Invariant cache hit.
[2023-03-10 02:04:49] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1054 ms. Remains : 830/830 places, 800/800 transitions.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-08 finished in 14165 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(X((X(p1) U p2)))||p0)) U !X(p1)))'
Support contains 410 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 10 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-10 02:04:49] [INFO ] Invariant cache hit.
[2023-03-10 02:04:49] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-10 02:04:49] [INFO ] Invariant cache hit.
[2023-03-10 02:04:50] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
[2023-03-10 02:04:50] [INFO ] Invariant cache hit.
[2023-03-10 02:04:50] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1168 ms. Remains : 830/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 186 ms :[p1, (AND (NOT p2) p0 p1), p1, (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s202 1) (GEQ s522 1) (GEQ s532 1) (GEQ s542 1) (GEQ s552 1) (GEQ s562 1) (GEQ s572 1) (GEQ s582 1) (GEQ s592 1) (GEQ s602 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1228 ms.
Product exploration explored 100000 steps with 50000 reset in 1245 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 8 factoid took 223 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-10-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-09 finished in 4197 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 100 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 730 transition count 700
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 200 place count 730 transition count 500
Deduced a syphon composed of 200 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 600 place count 530 transition count 500
Applied a total of 600 rules in 39 ms. Remains 530 /830 variables (removed 300) and now considering 500/800 (removed 300) transitions.
// Phase 1: matrix 500 rows 530 cols
[2023-03-10 02:04:54] [INFO ] Computed 130 place invariants in 8 ms
[2023-03-10 02:04:54] [INFO ] Implicit Places using invariants in 444 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 450 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 430/830 places, 500/800 transitions.
Applied a total of 0 rules in 7 ms. Remains 430 /430 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 498 ms. Remains : 430/830 places, 500/800 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s251 1) (GEQ s312 1) (GEQ s255 1) (GEQ s316 1) (GEQ s243 1) (GEQ s304 1) (GEQ s247 1) (GEQ s308 1) (GEQ s267 1) (GEQ s328 1) (GEQ s271 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 560 ms.
Product exploration explored 100000 steps with 0 reset in 680 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 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 29 ms :[(NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 153 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 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 500 rows 430 cols
[2023-03-10 02:04:56] [INFO ] Computed 30 place invariants in 16 ms
[2023-03-10 02:04:56] [INFO ] [Real]Absence check using 28 positive place invariants in 51 ms returned sat
[2023-03-10 02:04:56] [INFO ] [Real]Absence check using 28 positive and 2 generalized place invariants in 25 ms returned sat
[2023-03-10 02:04:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:04:58] [INFO ] [Real]Absence check using state equation in 1527 ms returned sat
[2023-03-10 02:04:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:04:58] [INFO ] [Nat]Absence check using 28 positive place invariants in 34 ms returned sat
[2023-03-10 02:04:58] [INFO ] [Nat]Absence check using 28 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-10 02:04:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:05:00] [INFO ] [Nat]Absence check using state equation in 2199 ms returned sat
[2023-03-10 02:05:00] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
[2023-03-10 02:05:00] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2023-03-10 02:05:01] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2023-03-10 02:05:01] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2023-03-10 02:05:01] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2023-03-10 02:05:01] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2023-03-10 02:05:01] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2023-03-10 02:05:01] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 0 ms to minimize.
[2023-03-10 02:05:01] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2023-03-10 02:05:01] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2023-03-10 02:05:01] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2023-03-10 02:05:01] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1299 ms
[2023-03-10 02:05:01] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1300 ms
[2023-03-10 02:05:01] [INFO ] Computed and/alt/rep : 400/2000/400 causal constraints (skipped 0 transitions) in 28 ms.
[2023-03-10 02:05:05] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2023-03-10 02:05:06] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2023-03-10 02:05:06] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2023-03-10 02:05:06] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2023-03-10 02:05:06] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2023-03-10 02:05:06] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2023-03-10 02:05:06] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2023-03-10 02:05:06] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2023-03-10 02:05:07] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2023-03-10 02:05:07] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2023-03-10 02:05:07] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 0 ms to minimize.
[2023-03-10 02:05:07] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1491 ms
[2023-03-10 02:05:07] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1491 ms
[2023-03-10 02:05:08] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2023-03-10 02:05:08] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2023-03-10 02:05:08] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2023-03-10 02:05:08] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2023-03-10 02:05:08] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 0 ms to minimize.
[2023-03-10 02:05:08] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2023-03-10 02:05:09] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2023-03-10 02:05:09] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 0 ms to minimize.
[2023-03-10 02:05:09] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2023-03-10 02:05:09] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2023-03-10 02:05:09] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2023-03-10 02:05:09] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1521 ms
[2023-03-10 02:05:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1522 ms
[2023-03-10 02:05:09] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2023-03-10 02:05:10] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2023-03-10 02:05:10] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 0 ms to minimize.
[2023-03-10 02:05:10] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2023-03-10 02:05:10] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2023-03-10 02:05:10] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2023-03-10 02:05:10] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2023-03-10 02:05:10] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 0 ms to minimize.
[2023-03-10 02:05:11] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 0 ms to minimize.
[2023-03-10 02:05:11] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 0 ms to minimize.
[2023-03-10 02:05:11] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2023-03-10 02:05:11] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1698 ms
[2023-03-10 02:05:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1698 ms
[2023-03-10 02:05:11] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2023-03-10 02:05:11] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2023-03-10 02:05:13] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 0 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 02:05:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 100 out of 430 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 430/430 places, 500/500 transitions.
Applied a total of 0 rules in 7 ms. Remains 430 /430 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-10 02:05:13] [INFO ] Invariant cache hit.
[2023-03-10 02:05:13] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-10 02:05:13] [INFO ] Invariant cache hit.
[2023-03-10 02:05:14] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
[2023-03-10 02:05:14] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 02:05:14] [INFO ] Invariant cache hit.
[2023-03-10 02:05:14] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1544 ms. Remains : 430/430 places, 500/500 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 138 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)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
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 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-10 02:05:15] [INFO ] Invariant cache hit.
[2023-03-10 02:05:15] [INFO ] [Real]Absence check using 28 positive place invariants in 32 ms returned sat
[2023-03-10 02:05:15] [INFO ] [Real]Absence check using 28 positive and 2 generalized place invariants in 20 ms returned sat
[2023-03-10 02:05:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:05:17] [INFO ] [Real]Absence check using state equation in 1329 ms returned sat
[2023-03-10 02:05:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:05:17] [INFO ] [Nat]Absence check using 28 positive place invariants in 35 ms returned sat
[2023-03-10 02:05:17] [INFO ] [Nat]Absence check using 28 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-10 02:05:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:05:19] [INFO ] [Nat]Absence check using state equation in 1904 ms returned sat
[2023-03-10 02:05:19] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2023-03-10 02:05:19] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2023-03-10 02:05:19] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2023-03-10 02:05:19] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2023-03-10 02:05:19] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2023-03-10 02:05:19] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2023-03-10 02:05:20] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2023-03-10 02:05:20] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2023-03-10 02:05:20] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2023-03-10 02:05:20] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 0 ms to minimize.
[2023-03-10 02:05:20] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2023-03-10 02:05:20] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1332 ms
[2023-03-10 02:05:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1333 ms
[2023-03-10 02:05:20] [INFO ] Computed and/alt/rep : 400/2000/400 causal constraints (skipped 0 transitions) in 25 ms.
[2023-03-10 02:05:24] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 0 ms to minimize.
[2023-03-10 02:05:24] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2023-03-10 02:05:24] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2023-03-10 02:05:24] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2023-03-10 02:05:24] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2023-03-10 02:05:24] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2023-03-10 02:05:24] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2023-03-10 02:05:25] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2023-03-10 02:05:25] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 0 ms to minimize.
[2023-03-10 02:05:25] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2023-03-10 02:05:25] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2023-03-10 02:05:25] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1510 ms
[2023-03-10 02:05:25] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1510 ms
[2023-03-10 02:05:25] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2023-03-10 02:05:25] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2023-03-10 02:05:26] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2023-03-10 02:05:26] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2023-03-10 02:05:26] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2023-03-10 02:05:26] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2023-03-10 02:05:26] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
[2023-03-10 02:05:26] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2023-03-10 02:05:26] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2023-03-10 02:05:27] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2023-03-10 02:05:27] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2023-03-10 02:05:27] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1472 ms
[2023-03-10 02:05:27] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1472 ms
[2023-03-10 02:05:27] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 0 ms to minimize.
[2023-03-10 02:05:27] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
[2023-03-10 02:05:27] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2023-03-10 02:05:27] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2023-03-10 02:05:27] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2023-03-10 02:05:27] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2023-03-10 02:05:28] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2023-03-10 02:05:28] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2023-03-10 02:05:28] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2023-03-10 02:05:29] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2023-03-10 02:05:29] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2023-03-10 02:05:29] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2355 ms
[2023-03-10 02:05:29] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2355 ms
[2023-03-10 02:05:29] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2023-03-10 02:05:29] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2023-03-10 02:05:30] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2023-03-10 02:05:30] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2023-03-10 02:05:30] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2023-03-10 02:05:30] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2023-03-10 02:05:30] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 0 ms to minimize.
[2023-03-10 02:05:30] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2023-03-10 02:05:30] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2023-03-10 02:05:30] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 0 ms to minimize.
[2023-03-10 02:05:31] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2023-03-10 02:05:31] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1435 ms
[2023-03-10 02:05:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1436 ms
[2023-03-10 02:05:31] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 0 ms to minimize.
[2023-03-10 02:05:31] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2023-03-10 02:05:31] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2023-03-10 02:05:32] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
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-10 02:05:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 547 ms.
Product exploration explored 100000 steps with 0 reset in 662 ms.
Support contains 100 out of 430 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 430/430 places, 500/500 transitions.
Applied a total of 0 rules in 8 ms. Remains 430 /430 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-10 02:05:33] [INFO ] Invariant cache hit.
[2023-03-10 02:05:33] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-10 02:05:33] [INFO ] Invariant cache hit.
[2023-03-10 02:05:34] [INFO ] Implicit Places using invariants and state equation in 963 ms returned []
Implicit Place search using SMT with State Equation took 1243 ms to find 0 implicit places.
[2023-03-10 02:05:34] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 02:05:34] [INFO ] Invariant cache hit.
[2023-03-10 02:05:34] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1491 ms. Remains : 430/430 places, 500/500 transitions.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-11 finished in 40972 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)))||(F(!p1)&&X((p2 U (!p1||G(p2)))))))'
Support contains 400 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 8 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2023-03-10 02:05:34] [INFO ] Computed 130 place invariants in 9 ms
[2023-03-10 02:05:35] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-10 02:05:35] [INFO ] Invariant cache hit.
[2023-03-10 02:05:35] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 973 ms to find 0 implicit places.
[2023-03-10 02:05:35] [INFO ] Invariant cache hit.
[2023-03-10 02:05:36] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1436 ms. Remains : 830/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 229 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), p0]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=(AND p1 p2 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=1 dest: 5}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 p2 p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 5}]], initial=2, aps=[p1:(OR (AND (GEQ s202 1) (GEQ s522 1) (GEQ s532 1) (GEQ s542 1) (GEQ s552 1) (GEQ s562 1) (GEQ s572 1) (GEQ s582 1) (GEQ s592 1) (GEQ s602 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1380 ms.
Product exploration explored 100000 steps with 50000 reset in 1401 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p2))))
Knowledge based reduction with 6 factoid took 109 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-10-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-12 finished in 4678 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) U X((p1 U G(!p2)))))'
Support contains 510 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 4 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-10 02:05:39] [INFO ] Invariant cache hit.
[2023-03-10 02:05:39] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-10 02:05:39] [INFO ] Invariant cache hit.
[2023-03-10 02:05:40] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2023-03-10 02:05:40] [INFO ] Invariant cache hit.
[2023-03-10 02:05:40] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1047 ms. Remains : 830/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) p2 (NOT p1)), p2, (NOT p0), (AND (NOT p0) p2 p1)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s620 1)) (AND (GEQ s60 1) (GEQ s626 1)) (AND (GEQ s36 1) (GEQ s623 1)) (AND (GEQ s74 1) (GEQ s627 1)) (AND (GEQ s15 1) (GEQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6030 reset in 854 ms.
Product exploration explored 100000 steps with 6026 reset in 869 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p2 (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 494 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Finished random walk after 3560 steps, including 1 resets, run visited all 6 properties in 36 ms. (steps per millisecond=98 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p2 (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (NOT p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 11 factoid took 689 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
[2023-03-10 02:05:44] [INFO ] Invariant cache hit.
[2023-03-10 02:05:45] [INFO ] [Real]Absence check using 29 positive place invariants in 22 ms returned sat
[2023-03-10 02:05:45] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 223 ms returned sat
[2023-03-10 02:05:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:05:48] [INFO ] [Real]Absence check using state equation in 2881 ms returned sat
[2023-03-10 02:05:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:05:48] [INFO ] [Nat]Absence check using 29 positive place invariants in 25 ms returned sat
[2023-03-10 02:05:49] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 186 ms returned sat
[2023-03-10 02:05:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:05:51] [INFO ] [Nat]Absence check using state equation in 2380 ms returned sat
[2023-03-10 02:05:51] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 45 ms.
[2023-03-10 02:05:56] [INFO ] Added : 360 causal constraints over 72 iterations in 4776 ms. Result :sat
Could not prove EG p2
Support contains 510 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 5 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-10 02:05:56] [INFO ] Invariant cache hit.
[2023-03-10 02:05:56] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-10 02:05:56] [INFO ] Invariant cache hit.
[2023-03-10 02:05:56] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2023-03-10 02:05:56] [INFO ] Invariant cache hit.
[2023-03-10 02:05:57] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1049 ms. Remains : 830/830 places, 800/800 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 p0) (NOT p1) p2), (X p2), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 460 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Finished random walk after 1194 steps, including 0 resets, run visited all 6 properties in 14 ms. (steps per millisecond=85 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (NOT p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 11 factoid took 625 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
[2023-03-10 02:05:59] [INFO ] Invariant cache hit.
[2023-03-10 02:05:59] [INFO ] [Real]Absence check using 29 positive place invariants in 20 ms returned sat
[2023-03-10 02:06:00] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 205 ms returned sat
[2023-03-10 02:06:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:02] [INFO ] [Real]Absence check using state equation in 2702 ms returned sat
[2023-03-10 02:06:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:06:03] [INFO ] [Nat]Absence check using 29 positive place invariants in 32 ms returned sat
[2023-03-10 02:06:03] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 169 ms returned sat
[2023-03-10 02:06:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:05] [INFO ] [Nat]Absence check using state equation in 2215 ms returned sat
[2023-03-10 02:06:05] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 40 ms.
[2023-03-10 02:06:10] [INFO ] Added : 360 causal constraints over 72 iterations in 4570 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Product exploration explored 100000 steps with 6021 reset in 807 ms.
Product exploration explored 100000 steps with 6004 reset in 834 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Support contains 510 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 16 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-10 02:06:12] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-10 02:06:12] [INFO ] Invariant cache hit.
[2023-03-10 02:06:12] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 443 ms. Remains : 830/830 places, 800/800 transitions.
Support contains 510 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 4 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-10 02:06:12] [INFO ] Invariant cache hit.
[2023-03-10 02:06:12] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-10 02:06:12] [INFO ] Invariant cache hit.
[2023-03-10 02:06:13] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2023-03-10 02:06:13] [INFO ] Invariant cache hit.
[2023-03-10 02:06:13] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1048 ms. Remains : 830/830 places, 800/800 transitions.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-13 finished in 34329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(((p1 U p2)&&p0))||G(!p1))))'
Support contains 200 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 12 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-10 02:06:13] [INFO ] Invariant cache hit.
[2023-03-10 02:06:14] [INFO ] Implicit Places using invariants in 523 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 525 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 5 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 544 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(OR (GEQ s161 1) (GEQ s157 1) (GEQ s169 1) (GEQ s165 1) (GEQ s177 1) (GEQ s173 1) (GEQ s185 1) (GEQ s181 1) (GEQ s120 1) (GEQ s193 1) (GEQ s124 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 594 ms.
Product exploration explored 100000 steps with 0 reset in 700 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) p1))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (OR (NOT p0) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 360 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 800 rows 730 cols
[2023-03-10 02:06:17] [INFO ] Computed 30 place invariants in 19 ms
[2023-03-10 02:06:17] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) p1))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (OR (NOT p0) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (G (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 12 factoid took 510 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 80 ms :[true, p1, p1]
Support contains 100 out of 730 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 730/730 places, 800/800 transitions.
Applied a total of 0 rules in 10 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-10 02:06:18] [INFO ] Invariant cache hit.
[2023-03-10 02:06:18] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-10 02:06:18] [INFO ] Invariant cache hit.
[2023-03-10 02:06:20] [INFO ] Implicit Places using invariants and state equation in 1571 ms returned []
Implicit Place search using SMT with State Equation took 1910 ms to find 0 implicit places.
[2023-03-10 02:06:20] [INFO ] Invariant cache hit.
[2023-03-10 02:06:20] [INFO ] Dead Transitions using invariants and state equation in 465 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2386 ms. Remains : 730/730 places, 800/800 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 : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 145 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 89 ms :[true, p1, p1]
Finished random walk after 26 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 165 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 85 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 88 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 92 ms :[true, p1, p1]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-14 finished in 7379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : DatabaseWithMutex-COL-10-LTLFireability-01
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 110 out of 830 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 730 transition count 700
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 200 place count 730 transition count 600
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 400 place count 630 transition count 600
Applied a total of 400 rules in 33 ms. Remains 630 /830 variables (removed 200) and now considering 600/800 (removed 200) transitions.
// Phase 1: matrix 600 rows 630 cols
[2023-03-10 02:06:21] [INFO ] Computed 130 place invariants in 11 ms
[2023-03-10 02:06:22] [INFO ] Implicit Places using invariants in 461 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 462 ms to find 100 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 530/830 places, 600/800 transitions.
Applied a total of 0 rules in 7 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 502 ms. Remains : 530/830 places, 600/800 transitions.
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s320 1)) (AND (GEQ s60 1) (GEQ s326 1)) (AND (GEQ s36 1) (GEQ s323 1)) (AND (GEQ s74 1) (GEQ s327 1)) (AND (GEQ s15 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 8203 reset in 672 ms.
Product exploration explored 100000 steps with 8207 reset in 698 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
// Phase 1: matrix 600 rows 530 cols
[2023-03-10 02:06:23] [INFO ] Computed 30 place invariants in 14 ms
[2023-03-10 02:06:24] [INFO ] [Real]Absence check using 28 positive place invariants in 74 ms returned sat
[2023-03-10 02:06:24] [INFO ] [Real]Absence check using 28 positive and 2 generalized place invariants in 19 ms returned sat
[2023-03-10 02:06:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:26] [INFO ] [Real]Absence check using state equation in 1959 ms returned sat
[2023-03-10 02:06:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:06:27] [INFO ] [Nat]Absence check using 28 positive place invariants in 38 ms returned sat
[2023-03-10 02:06:27] [INFO ] [Nat]Absence check using 28 positive and 2 generalized place invariants in 36 ms returned sat
[2023-03-10 02:06:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:29] [INFO ] [Nat]Absence check using state equation in 1449 ms returned sat
[2023-03-10 02:06:29] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2023-03-10 02:06:29] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2023-03-10 02:06:29] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2023-03-10 02:06:29] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2023-03-10 02:06:30] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2023-03-10 02:06:30] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2023-03-10 02:06:30] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2023-03-10 02:06:30] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2023-03-10 02:06:30] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 0 ms to minimize.
[2023-03-10 02:06:30] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2023-03-10 02:06:30] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 0 ms to minimize.
[2023-03-10 02:06:31] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2023-03-10 02:06:31] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2023-03-10 02:06:31] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2023-03-10 02:06:31] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2023-03-10 02:06:31] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2023-03-10 02:06:32] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2023-03-10 02:06:32] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2023-03-10 02:06:32] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2023-03-10 02:06:32] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2023-03-10 02:06:32] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 0 ms to minimize.
[2023-03-10 02:06:32] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2023-03-10 02:06:32] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 1 ms to minimize.
[2023-03-10 02:06:32] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 0 ms to minimize.
[2023-03-10 02:06:33] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2023-03-10 02:06:33] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2023-03-10 02:06:33] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2023-03-10 02:06:33] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 0 ms to minimize.
[2023-03-10 02:06:33] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 0 ms to minimize.
[2023-03-10 02:06:33] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2023-03-10 02:06:33] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
[2023-03-10 02:06:34] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 0 ms to minimize.
[2023-03-10 02:06:34] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 0 ms to minimize.
[2023-03-10 02:06:34] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2023-03-10 02:06:34] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 0 ms to minimize.
[2023-03-10 02:06:34] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2023-03-10 02:06:34] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2023-03-10 02:06:34] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-10 02:06:35] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-10 02:06:35] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2023-03-10 02:06:35] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2023-03-10 02:06:35] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-10 02:06:35] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2023-03-10 02:06:35] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2023-03-10 02:06:35] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-10 02:06:35] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-10 02:06:35] [INFO ] Trap strengthening procedure interrupted after too many repetitions 6546 ms
[2023-03-10 02:06:35] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 6546 ms
[2023-03-10 02:06:35] [INFO ] Computed and/alt/rep : 500/2100/500 causal constraints (skipped 0 transitions) in 29 ms.
[2023-03-10 02:06:40] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-10 02:06:40] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2023-03-10 02:06:40] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2023-03-10 02:06:40] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2023-03-10 02:06:40] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2023-03-10 02:06:40] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2023-03-10 02:06:41] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2023-03-10 02:06:41] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2023-03-10 02:06:41] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2023-03-10 02:06:41] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2023-03-10 02:06:41] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2023-03-10 02:06:41] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1305 ms
[2023-03-10 02:06:41] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1305 ms
[2023-03-10 02:06:41] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
[2023-03-10 02:06:41] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 100 ms
[2023-03-10 02:06:42] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 1 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 02:06:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 110 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 600/600 transitions.
Applied a total of 0 rules in 9 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2023-03-10 02:06:42] [INFO ] Invariant cache hit.
[2023-03-10 02:06:42] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-10 02:06:42] [INFO ] Invariant cache hit.
[2023-03-10 02:06:43] [INFO ] Implicit Places using invariants and state equation in 1334 ms returned []
Implicit Place search using SMT with State Equation took 1617 ms to find 0 implicit places.
[2023-03-10 02:06:43] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 02:06:43] [INFO ] Invariant cache hit.
[2023-03-10 02:06:44] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1924 ms. Remains : 530/530 places, 600/600 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-10 02:06:44] [INFO ] Invariant cache hit.
[2023-03-10 02:06:45] [INFO ] [Real]Absence check using 28 positive place invariants in 79 ms returned sat
[2023-03-10 02:06:45] [INFO ] [Real]Absence check using 28 positive and 2 generalized place invariants in 18 ms returned sat
[2023-03-10 02:06:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:48] [INFO ] [Real]Absence check using state equation in 2790 ms returned sat
[2023-03-10 02:06:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:06:49] [INFO ] [Nat]Absence check using 28 positive place invariants in 42 ms returned sat
[2023-03-10 02:06:49] [INFO ] [Nat]Absence check using 28 positive and 2 generalized place invariants in 40 ms returned sat
[2023-03-10 02:06:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:51] [INFO ] [Nat]Absence check using state equation in 1896 ms returned sat
[2023-03-10 02:06:51] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2023-03-10 02:06:51] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2023-03-10 02:06:51] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-10 02:06:51] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2023-03-10 02:06:51] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-10 02:06:51] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2023-03-10 02:06:52] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-10 02:06:52] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-10 02:06:52] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-10 02:06:52] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-10 02:06:52] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-10 02:06:52] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1241 ms
[2023-03-10 02:06:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1241 ms
[2023-03-10 02:06:52] [INFO ] Computed and/alt/rep : 500/2100/500 causal constraints (skipped 0 transitions) in 25 ms.
[2023-03-10 02:06:54] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-10 02:06:54] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-10 02:06:55] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-10 02:06:55] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-10 02:06:55] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2023-03-10 02:06:55] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-10 02:06:55] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-10 02:06:55] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-10 02:06:55] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-10 02:06:55] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-10 02:06:56] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-10 02:06:56] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1375 ms
[2023-03-10 02:06:56] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1375 ms
[2023-03-10 02:06:56] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2023-03-10 02:06:56] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-10 02:06:56] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-10 02:06:56] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-10 02:06:56] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-10 02:06:56] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2023-03-10 02:06:56] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-10 02:06:57] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2023-03-10 02:06:57] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-10 02:06:57] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2023-03-10 02:06:57] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-10 02:06:57] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1197 ms
[2023-03-10 02:06:57] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1197 ms
[2023-03-10 02:06:57] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-03-10 02:06:57] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2023-03-10 02:06:57] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2023-03-10 02:06:57] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2023-03-10 02:06:58] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-10 02:06:58] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2023-03-10 02:06:58] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-10 02:06:58] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2023-03-10 02:06:58] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2023-03-10 02:06:58] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2023-03-10 02:06:58] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-10 02:06:58] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1179 ms
[2023-03-10 02:06:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1179 ms
[2023-03-10 02:06:58] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-10 02:06:58] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-03-10 02:06:59] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-10 02:06:59] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2023-03-10 02:06:59] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2023-03-10 02:06:59] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-10 02:06:59] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-10 02:06:59] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-10 02:06:59] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-10 02:06:59] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2023-03-10 02:06:59] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2023-03-10 02:06:59] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1066 ms
[2023-03-10 02:06:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1066 ms
[2023-03-10 02:07:00] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-10 02:07:00] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2023-03-10 02:07:00] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-10 02:07:00] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2023-03-10 02:07:00] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2023-03-10 02:07:00] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-10 02:07:00] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2023-03-10 02:07:01] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2023-03-10 02:07:01] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-10 02:07:01] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2023-03-10 02:07:02] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-10 02:07:02] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2133 ms
[2023-03-10 02:07:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2133 ms
[2023-03-10 02:07:02] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2023-03-10 02:07:02] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2023-03-10 02:07:03] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-03-10 02:07:03] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 1120 ms
[2023-03-10 02:07:03] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 1 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
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-10 02:07:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8204 reset in 716 ms.
Product exploration explored 100000 steps with 8200 reset in 726 ms.
Support contains 110 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 600/600 transitions.
Applied a total of 0 rules in 8 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2023-03-10 02:07:05] [INFO ] Invariant cache hit.
[2023-03-10 02:07:05] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-10 02:07:05] [INFO ] Invariant cache hit.
[2023-03-10 02:07:06] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned []
Implicit Place search using SMT with State Equation took 1407 ms to find 0 implicit places.
[2023-03-10 02:07:06] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 02:07:06] [INFO ] Invariant cache hit.
[2023-03-10 02:07:06] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1707 ms. Remains : 530/530 places, 600/600 transitions.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-01 finished in 45485 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((G(F(p0))||(F(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' '!(G((!p0||F((!p1||X(!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' '!(X(F((G((F(!p1)&&F(G(!p2))))||p0))))'
Found a Shortening insensitive property : DatabaseWithMutex-COL-10-LTLFireability-08
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND (NOT p0) p2), (AND (NOT p0) p1)]
Support contains 310 out of 830 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 11 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2023-03-10 02:07:07] [INFO ] Computed 130 place invariants in 13 ms
[2023-03-10 02:07:07] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-10 02:07:07] [INFO ] Invariant cache hit.
[2023-03-10 02:07:07] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
[2023-03-10 02:07:07] [INFO ] Invariant cache hit.
[2023-03-10 02:07:08] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1072 ms. Remains : 830/830 places, 800/800 transitions.
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s620 1)) (AND (GEQ s60 1) (GEQ s626 1)) (AND (GEQ s36 1) (GEQ s623 1)) (AND (GEQ s74 1) (GEQ s627 1)) (AND (GEQ s15 1) (GEQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6034 reset in 1836 ms.
Product exploration explored 100000 steps with 6013 reset in 1860 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 356 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND (NOT p0) p2), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 02:07:13] [INFO ] Invariant cache hit.
[2023-03-10 02:07:13] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p0)))), (F p0), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 9 factoid took 399 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND p2 (NOT p0)), (AND p2 (NOT p0)), (AND p2 (NOT p0))]
Stuttering acceptance computed with spot in 93 ms :[(AND p2 (NOT p0)), (AND p2 (NOT p0)), (AND p2 (NOT p0))]
Support contains 310 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 6 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-10 02:07:13] [INFO ] Invariant cache hit.
[2023-03-10 02:07:14] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-10 02:07:14] [INFO ] Invariant cache hit.
[2023-03-10 02:07:14] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2023-03-10 02:07:14] [INFO ] Invariant cache hit.
[2023-03-10 02:07:14] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1024 ms. Remains : 830/830 places, 800/800 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 p2) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Finished random walk after 299 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=99 )
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 5 factoid took 258 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 6041 reset in 1517 ms.
Product exploration explored 100000 steps with 6019 reset in 1533 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 310 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 16 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-10 02:07:19] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-10 02:07:19] [INFO ] Invariant cache hit.
[2023-03-10 02:07:19] [INFO ] Dead Transitions using invariants and state equation in 448 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 479 ms. Remains : 830/830 places, 800/800 transitions.
Support contains 310 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 6 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-10 02:07:19] [INFO ] Invariant cache hit.
[2023-03-10 02:07:19] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-10 02:07:19] [INFO ] Invariant cache hit.
[2023-03-10 02:07:20] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2023-03-10 02:07:20] [INFO ] Invariant cache hit.
[2023-03-10 02:07:20] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1049 ms. Remains : 830/830 places, 800/800 transitions.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-08 finished in 13778 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)))'
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) U X((p1 U G(!p2)))))'
Found a Lengthening insensitive property : DatabaseWithMutex-COL-10-LTLFireability-13
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) p2 (NOT p1)), p2, (NOT p0), (AND (NOT p0) p2 p1)]
Support contains 510 out of 830 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 11 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-10 02:07:21] [INFO ] Invariant cache hit.
[2023-03-10 02:07:21] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-10 02:07:21] [INFO ] Invariant cache hit.
[2023-03-10 02:07:21] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
[2023-03-10 02:07:21] [INFO ] Invariant cache hit.
[2023-03-10 02:07:22] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1073 ms. Remains : 830/830 places, 800/800 transitions.
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s620 1)) (AND (GEQ s60 1) (GEQ s626 1)) (AND (GEQ s36 1) (GEQ s623 1)) (AND (GEQ s74 1) (GEQ s627 1)) (AND (GEQ s15 1) (GEQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6027 reset in 779 ms.
Product exploration explored 100000 steps with 6018 reset in 793 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p2 (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 531 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Finished random walk after 1040 steps, including 0 resets, run visited all 6 properties in 13 ms. (steps per millisecond=80 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p2 (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (NOT p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 11 factoid took 664 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
[2023-03-10 02:07:25] [INFO ] Invariant cache hit.
[2023-03-10 02:07:26] [INFO ] [Real]Absence check using 29 positive place invariants in 20 ms returned sat
[2023-03-10 02:07:26] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 205 ms returned sat
[2023-03-10 02:07:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:07:29] [INFO ] [Real]Absence check using state equation in 2621 ms returned sat
[2023-03-10 02:07:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:07:29] [INFO ] [Nat]Absence check using 29 positive place invariants in 23 ms returned sat
[2023-03-10 02:07:30] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 174 ms returned sat
[2023-03-10 02:07:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:07:32] [INFO ] [Nat]Absence check using state equation in 2210 ms returned sat
[2023-03-10 02:07:32] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 43 ms.
[2023-03-10 02:07:37] [INFO ] Added : 360 causal constraints over 72 iterations in 4814 ms. Result :sat
Could not prove EG p2
Support contains 510 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 4 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-10 02:07:37] [INFO ] Invariant cache hit.
[2023-03-10 02:07:37] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-10 02:07:37] [INFO ] Invariant cache hit.
[2023-03-10 02:07:37] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2023-03-10 02:07:37] [INFO ] Invariant cache hit.
[2023-03-10 02:07:38] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1035 ms. Remains : 830/830 places, 800/800 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 p0) (NOT p1) p2), (X p2), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 531 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Finished random walk after 2264 steps, including 0 resets, run visited all 6 properties in 28 ms. (steps per millisecond=80 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (NOT p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 11 factoid took 617 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
[2023-03-10 02:07:40] [INFO ] Invariant cache hit.
[2023-03-10 02:07:40] [INFO ] [Real]Absence check using 29 positive place invariants in 20 ms returned sat
[2023-03-10 02:07:41] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 213 ms returned sat
[2023-03-10 02:07:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:07:43] [INFO ] [Real]Absence check using state equation in 2802 ms returned sat
[2023-03-10 02:07:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:07:44] [INFO ] [Nat]Absence check using 29 positive place invariants in 23 ms returned sat
[2023-03-10 02:07:44] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 173 ms returned sat
[2023-03-10 02:07:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:07:46] [INFO ] [Nat]Absence check using state equation in 2284 ms returned sat
[2023-03-10 02:07:47] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 44 ms.
[2023-03-10 02:07:51] [INFO ] Added : 360 causal constraints over 72 iterations in 4768 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Product exploration explored 100000 steps with 6034 reset in 836 ms.
Product exploration explored 100000 steps with 6037 reset in 874 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Support contains 510 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 13 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-10 02:07:53] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-10 02:07:53] [INFO ] Invariant cache hit.
[2023-03-10 02:07:54] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 488 ms. Remains : 830/830 places, 800/800 transitions.
Support contains 510 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 4 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-10 02:07:54] [INFO ] Invariant cache hit.
[2023-03-10 02:07:54] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-10 02:07:54] [INFO ] Invariant cache hit.
[2023-03-10 02:07:54] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2023-03-10 02:07:54] [INFO ] Invariant cache hit.
[2023-03-10 02:07:55] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1040 ms. Remains : 830/830 places, 800/800 transitions.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-13 finished in 34603 ms.
[2023-03-10 02:07:55] [INFO ] Flatten gal took : 73 ms
[2023-03-10 02:07:55] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 11 ms.
[2023-03-10 02:07:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 830 places, 800 transitions and 3800 arcs took 4 ms.
Total runtime 280142 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3922/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3922/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 595 seconds
MemTotal: 16393232 kB
MemFree: 10909132 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16122748 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3922/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3922/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 595 seconds
MemTotal: 16393232 kB
MemFree: 8127660 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16117344 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3922/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3922/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 595 seconds
MemTotal: 16393232 kB
MemFree: 10933964 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16112248 kB
Could not compute solution for formula : DatabaseWithMutex-COL-10-LTLFireability-01
Could not compute solution for formula : DatabaseWithMutex-COL-10-LTLFireability-05
Could not compute solution for formula : DatabaseWithMutex-COL-10-LTLFireability-07
Could not compute solution for formula : DatabaseWithMutex-COL-10-LTLFireability-08
Could not compute solution for formula : DatabaseWithMutex-COL-10-LTLFireability-11
Could not compute solution for formula : DatabaseWithMutex-COL-10-LTLFireability-13

BK_STOP 1678415881872

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name DatabaseWithMutex-COL-10-LTLFireability-01
ltl formula formula --ltl=/tmp/3922/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 830 places, 800 transitions and 3800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.170 real 0.020 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3922/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3922/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3922/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3922/ltl_0_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name DatabaseWithMutex-COL-10-LTLFireability-05
ltl formula formula --ltl=/tmp/3922/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 830 places, 800 transitions and 3800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.020 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3922/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3922/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3922/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3922/ltl_1_
Killing (15) : 3934 3935 3936 3937 3938
Killing (9) : 3934 3935 3936 3937 3938
ltl formula name DatabaseWithMutex-COL-10-LTLFireability-07
ltl formula formula --ltl=/tmp/3922/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 830 places, 800 transitions and 3800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.030 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3922/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3922/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3922/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3922/ltl_2_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name DatabaseWithMutex-COL-10-LTLFireability-08
ltl formula formula --ltl=/tmp/3922/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 830 places, 800 transitions and 3800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.020 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3922/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3922/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3922/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3922/ltl_3_
Killing (15) : 3958 3959 3960 3961 3962
Killing (9) : 3958 3959 3960 3961 3962
ltl formula name DatabaseWithMutex-COL-10-LTLFireability-11
ltl formula formula --ltl=/tmp/3922/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 830 places, 800 transitions and 3800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.010 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3922/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3922/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3922/ltl_4_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3922/ltl_4_
ltl formula name DatabaseWithMutex-COL-10-LTLFireability-13
ltl formula formula --ltl=/tmp/3922/ltl_5_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 830 places, 800 transitions and 3800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.170 real 0.030 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3922/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3922/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3922/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3922/ltl_5_
Killing (15) : 3980 3981 3982 3983 3984
Killing (9) : 3980 3981 3982 3983 3984

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="DatabaseWithMutex-COL-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is DatabaseWithMutex-COL-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814482001036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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