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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 66M
-rw-r--r-- 1 mcc users 1.2M Feb 26 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.5M Feb 26 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Feb 26 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.0M Feb 26 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 361K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.6M Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9M Feb 26 10:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 8.4M Feb 26 10:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4M Feb 26 09:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26M Feb 26 09:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 134K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 325K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.5M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679180042129

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN14
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 22:54:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 22:54:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 22:54:03] [INFO ] Load time of PNML (sax parser for PT used): 302 ms
[2023-03-18 22:54:03] [INFO ] Transformed 3332 places.
[2023-03-18 22:54:04] [INFO ] Transformed 2744 transitions.
[2023-03-18 22:54:04] [INFO ] Parsed PT model containing 3332 places and 2744 transitions and 10976 arcs in 510 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 183 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Sudoku-PT-AN14-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3332 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 35 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2023-03-18 22:54:04] [INFO ] Computed 588 place invariants in 36 ms
[2023-03-18 22:54:05] [INFO ] Implicit Places using invariants in 505 ms returned []
[2023-03-18 22:54:05] [INFO ] Invariant cache hit.
[2023-03-18 22:54:07] [INFO ] Implicit Places using invariants and state equation in 1913 ms returned []
Implicit Place search using SMT with State Equation took 2444 ms to find 0 implicit places.
[2023-03-18 22:54:07] [INFO ] Invariant cache hit.
[2023-03-18 22:54:08] [INFO ] Dead Transitions using invariants and state equation in 1611 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4096 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Support contains 3332 out of 3332 places after structural reductions.
[2023-03-18 22:54:09] [INFO ] Flatten gal took : 256 ms
[2023-03-18 22:54:09] [INFO ] Flatten gal took : 159 ms
[2023-03-18 22:54:09] [INFO ] Input system was already deterministic with 2744 transitions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 2660 ms. (steps per millisecond=3 ) properties (out of 19) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-18 22:54:14] [INFO ] Invariant cache hit.
[2023-03-18 22:54:15] [INFO ] After 882ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-18 22:54:16] [INFO ] [Nat]Absence check using 588 positive place invariants in 172 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 22:54:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 22:54:40] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 588 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.7 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 56 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 588/3332 places, 2744/2744 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 2422 ms. (steps per millisecond=4 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 172220 steps, run timeout after 12007 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 172220 steps, saw 172135 distinct states, run finished after 12008 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2744 rows 588 cols
[2023-03-18 22:54:57] [INFO ] Computed 41 place invariants in 218 ms
[2023-03-18 22:54:57] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 32 ms returned sat
[2023-03-18 22:54:57] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-18 22:54:57] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 28 ms returned sat
[2023-03-18 22:55:22] [INFO ] After 24762ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :4
[2023-03-18 22:55:22] [INFO ] After 24771ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-18 22:55:22] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :4
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 32 ms.
Support contains 197 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 94 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 588/588 places, 2744/2744 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 1797 ms. (steps per millisecond=5 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Probabilistic random walk after 199405 steps, saw 199306 distinct states, run finished after 6004 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-18 22:55:31] [INFO ] Invariant cache hit.
[2023-03-18 22:55:31] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 37 ms returned sat
[2023-03-18 22:55:31] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 22:55:31] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 35 ms returned sat
[2023-03-18 22:55:33] [INFO ] After 1537ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-18 22:55:34] [INFO ] After 2908ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 133 ms.
[2023-03-18 22:55:34] [INFO ] After 3207ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 196 steps, including 0 resets, run visited all 2 properties in 18 ms. (steps per millisecond=10 )
Parikh walk visited 2 properties in 19 ms.
FORMULA Sudoku-PT-AN14-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-PT-AN14-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 9 simplifications.
FORMULA Sudoku-PT-AN14-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 588 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2744 places and 0 transitions.
Iterating post reduction 0 with 2744 rules applied. Total rules applied 2744 place count 588 transition count 2744
Applied a total of 2744 rules in 28 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 22:55:34] [INFO ] Invariant cache hit.
[2023-03-18 22:55:34] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-18 22:55:34] [INFO ] Invariant cache hit.
[2023-03-18 22:55:35] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 784 ms to find 0 implicit places.
[2023-03-18 22:55:35] [INFO ] Invariant cache hit.
[2023-03-18 22:55:36] [INFO ] Dead Transitions using invariants and state equation in 804 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1617 ms. Remains : 588/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-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:(AND (GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 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][false, false]]
Stuttering criterion allowed to conclude after 174 steps with 0 reset in 41 ms.
FORMULA Sudoku-PT-AN14-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLCardinality-01 finished in 1880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 100 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2023-03-18 22:55:36] [INFO ] Computed 588 place invariants in 19 ms
[2023-03-18 22:55:38] [INFO ] Implicit Places using invariants in 1260 ms returned []
[2023-03-18 22:55:38] [INFO ] Invariant cache hit.
[2023-03-18 22:55:41] [INFO ] Implicit Places using invariants and state equation in 3449 ms returned []
Implicit Place search using SMT with State Equation took 4711 ms to find 0 implicit places.
[2023-03-18 22:55:41] [INFO ] Redundant transitions in 152 ms returned []
[2023-03-18 22:55:41] [INFO ] Invariant cache hit.
[2023-03-18 22:55:43] [INFO ] Dead Transitions using invariants and state equation in 1720 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6697 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 (ADD s2940 s2941 s2942 s2943 s2944 s2945 s2946 s2947 s2948 s2949 s2950 s2951 s2952 s2953 s2954 s2955 s2956 s2957 s2958 s2959 s2960 s2961 s2962 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 58620 steps with 340 reset in 10005 ms.
Product exploration timeout after 59830 steps with 347 reset in 10002 ms.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 1676 ms. (steps per millisecond=5 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 705 ms. (steps per millisecond=14 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 22:56:07] [INFO ] Invariant cache hit.
[2023-03-18 22:56:07] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:56:08] [INFO ] [Nat]Absence check using 588 positive place invariants in 157 ms returned sat
[2023-03-18 22:56:32] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 52 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 1680 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 711 ms. (steps per millisecond=14 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 347662 steps, run timeout after 6001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 347662 steps, saw 282912 distinct states, run finished after 6001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 22:56:41] [INFO ] Invariant cache hit.
[2023-03-18 22:56:41] [INFO ] After 321ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:56:42] [INFO ] [Nat]Absence check using 588 positive place invariants in 152 ms returned sat
[2023-03-18 22:57:07] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 49 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 43 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 22:57:07] [INFO ] Invariant cache hit.
[2023-03-18 22:57:08] [INFO ] Implicit Places using invariants in 1249 ms returned []
[2023-03-18 22:57:08] [INFO ] Invariant cache hit.
[2023-03-18 22:57:11] [INFO ] Implicit Places using invariants and state equation in 3535 ms returned []
Implicit Place search using SMT with State Equation took 4786 ms to find 0 implicit places.
[2023-03-18 22:57:11] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-18 22:57:11] [INFO ] Invariant cache hit.
[2023-03-18 22:57:13] [INFO ] Dead Transitions using invariants and state equation in 1683 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6591 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 41 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 22:57:13] [INFO ] Invariant cache hit.
[2023-03-18 22:57:14] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:57:14] [INFO ] [Nat]Absence check using 588 positive place invariants in 155 ms returned sat
[2023-03-18 23:00:59] [INFO ] After 225009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0)))]
Knowledge based reduction with 5 factoid took 270 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 46 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 23:00:59] [INFO ] Invariant cache hit.
[2023-03-18 23:01:01] [INFO ] Implicit Places using invariants in 1251 ms returned []
[2023-03-18 23:01:01] [INFO ] Invariant cache hit.
[2023-03-18 23:01:04] [INFO ] Implicit Places using invariants and state equation in 3701 ms returned []
Implicit Place search using SMT with State Equation took 4955 ms to find 0 implicit places.
[2023-03-18 23:01:05] [INFO ] Redundant transitions in 146 ms returned []
[2023-03-18 23:01:05] [INFO ] Invariant cache hit.
[2023-03-18 23:01:06] [INFO ] Dead Transitions using invariants and state equation in 1727 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6891 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 339 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 1703 ms. (steps per millisecond=5 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 719 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:01:10] [INFO ] Invariant cache hit.
[2023-03-18 23:01:11] [INFO ] After 320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:01:11] [INFO ] [Nat]Absence check using 588 positive place invariants in 160 ms returned sat
[2023-03-18 23:01:36] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 45 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 1663 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 707 ms. (steps per millisecond=14 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 359551 steps, run timeout after 6001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 359551 steps, saw 285147 distinct states, run finished after 6001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:01:44] [INFO ] Invariant cache hit.
[2023-03-18 23:01:45] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:01:45] [INFO ] [Nat]Absence check using 588 positive place invariants in 156 ms returned sat
[2023-03-18 23:02:10] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 59 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 38 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 23:02:10] [INFO ] Invariant cache hit.
[2023-03-18 23:02:11] [INFO ] Implicit Places using invariants in 1224 ms returned []
[2023-03-18 23:02:11] [INFO ] Invariant cache hit.
[2023-03-18 23:02:15] [INFO ] Implicit Places using invariants and state equation in 3549 ms returned []
Implicit Place search using SMT with State Equation took 4775 ms to find 0 implicit places.
[2023-03-18 23:02:15] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-18 23:02:15] [INFO ] Invariant cache hit.
[2023-03-18 23:02:16] [INFO ] Dead Transitions using invariants and state equation in 1668 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6564 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 43 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 23:02:16] [INFO ] Invariant cache hit.
[2023-03-18 23:02:17] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:02:17] [INFO ] [Nat]Absence check using 588 positive place invariants in 152 ms returned sat
[2023-03-18 23:06:02] [INFO ] After 225028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0)))]
Knowledge based reduction with 5 factoid took 248 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration timeout after 60040 steps with 348 reset in 10003 ms.
Product exploration timeout after 58790 steps with 340 reset in 10001 ms.
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 37 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 23:06:23] [INFO ] Invariant cache hit.
[2023-03-18 23:06:24] [INFO ] Implicit Places using invariants in 1240 ms returned []
[2023-03-18 23:06:24] [INFO ] Invariant cache hit.
[2023-03-18 23:06:27] [INFO ] Implicit Places using invariants and state equation in 3569 ms returned []
Implicit Place search using SMT with State Equation took 4811 ms to find 0 implicit places.
[2023-03-18 23:06:28] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-18 23:06:28] [INFO ] Invariant cache hit.
[2023-03-18 23:06:29] [INFO ] Dead Transitions using invariants and state equation in 1698 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6628 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Treatment of property Sudoku-PT-AN14-LTLCardinality-03 finished in 653458 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 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 41 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 23:06:30] [INFO ] Invariant cache hit.
[2023-03-18 23:06:31] [INFO ] Implicit Places using invariants in 1231 ms returned []
[2023-03-18 23:06:31] [INFO ] Invariant cache hit.
[2023-03-18 23:06:34] [INFO ] Implicit Places using invariants and state equation in 3540 ms returned []
Implicit Place search using SMT with State Equation took 4773 ms to find 0 implicit places.
[2023-03-18 23:06:34] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-18 23:06:34] [INFO ] Invariant cache hit.
[2023-03-18 23:06:36] [INFO ] Dead Transitions using invariants and state equation in 1701 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6600 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s196 s197 s198 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 174 steps with 0 reset in 55 ms.
FORMULA Sudoku-PT-AN14-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLCardinality-07 finished in 6723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p1 U X(G(!p1))))))'
Support contains 4 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2744 places and 0 transitions.
Iterating post reduction 0 with 2744 rules applied. Total rules applied 2744 place count 588 transition count 2744
Applied a total of 2744 rules in 61 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2023-03-18 23:06:37] [INFO ] Computed 41 place invariants in 132 ms
[2023-03-18 23:06:37] [INFO ] Implicit Places using invariants in 726 ms returned []
[2023-03-18 23:06:37] [INFO ] Invariant cache hit.
[2023-03-18 23:06:43] [INFO ] Implicit Places using invariants and state equation in 5416 ms returned []
Implicit Place search using SMT with State Equation took 6148 ms to find 0 implicit places.
[2023-03-18 23:06:43] [INFO ] Invariant cache hit.
[2023-03-18 23:06:43] [INFO ] Dead Transitions using invariants and state equation in 798 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7007 ms. Remains : 588/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 236 ms :[p1, p1, (OR (NOT p0) p1), (OR (NOT p0) p1), true]
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(GT s253 s400), p0:(LEQ s464 s56)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 456 steps with 2 reset in 87 ms.
FORMULA Sudoku-PT-AN14-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLCardinality-10 finished in 7348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2744 places and 0 transitions.
Iterating post reduction 0 with 2744 rules applied. Total rules applied 2744 place count 588 transition count 2744
Applied a total of 2744 rules in 67 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 23:06:44] [INFO ] Invariant cache hit.
[2023-03-18 23:06:44] [INFO ] Implicit Places using invariants in 605 ms returned []
[2023-03-18 23:06:44] [INFO ] Invariant cache hit.
[2023-03-18 23:06:53] [INFO ] Implicit Places using invariants and state equation in 8566 ms returned []
Implicit Place search using SMT with State Equation took 9174 ms to find 0 implicit places.
[2023-03-18 23:06:53] [INFO ] Invariant cache hit.
[2023-03-18 23:06:54] [INFO ] Dead Transitions using invariants and state equation in 793 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10035 ms. Remains : 588/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s516 s131)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 309 steps with 1 reset in 60 ms.
FORMULA Sudoku-PT-AN14-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLCardinality-11 finished in 10240 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((X(p1)||p0)))'
Support contains 5 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2742 places and 0 transitions.
Iterating post reduction 0 with 2742 rules applied. Total rules applied 2742 place count 590 transition count 2744
Applied a total of 2742 rules in 74 ms. Remains 590 /3332 variables (removed 2742) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 590 cols
[2023-03-18 23:06:54] [INFO ] Computed 41 place invariants in 177 ms
[2023-03-18 23:06:55] [INFO ] Implicit Places using invariants in 746 ms returned []
[2023-03-18 23:06:55] [INFO ] Invariant cache hit.
[2023-03-18 23:07:00] [INFO ] Implicit Places using invariants and state equation in 5456 ms returned []
Implicit Place search using SMT with State Equation took 6205 ms to find 0 implicit places.
[2023-03-18 23:07:00] [INFO ] Invariant cache hit.
[2023-03-18 23:07:01] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 590/3332 places, 2744/2744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7051 ms. Remains : 590/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GT 1 s531) (AND (LEQ s197 s502) (GT 1 s196))), p1:(OR (GT 1 s308) (GT 1 s531))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 9480 steps with 55 reset in 1521 ms.
FORMULA Sudoku-PT-AN14-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLCardinality-13 finished in 8677 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 1 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2743 places and 0 transitions.
Iterating post reduction 0 with 2743 rules applied. Total rules applied 2743 place count 589 transition count 2744
Applied a total of 2743 rules in 70 ms. Remains 589 /3332 variables (removed 2743) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 589 cols
[2023-03-18 23:07:03] [INFO ] Computed 41 place invariants in 113 ms
[2023-03-18 23:07:03] [INFO ] Implicit Places using invariants in 700 ms returned []
[2023-03-18 23:07:03] [INFO ] Invariant cache hit.
[2023-03-18 23:07:08] [INFO ] Implicit Places using invariants and state equation in 4441 ms returned []
Implicit Place search using SMT with State Equation took 5152 ms to find 0 implicit places.
[2023-03-18 23:07:08] [INFO ] Invariant cache hit.
[2023-03-18 23:07:09] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 589/3332 places, 2744/2744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5990 ms. Remains : 589/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s196)], 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]]
Stuttering criterion allowed to conclude after 4233 steps with 2031 reset in 1073 ms.
FORMULA Sudoku-PT-AN14-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLCardinality-15 finished in 7147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
[2023-03-18 23:07:10] [INFO ] Flatten gal took : 117 ms
[2023-03-18 23:07:10] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-18 23:07:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3332 places, 2744 transitions and 10976 arcs took 13 ms.
Total runtime 787027 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Sudoku-PT-AN14
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/377
LTLCardinality

BK_STOP 1679180902382

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/377/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/377/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/377/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 Sudoku-PT-AN14-LTLCardinality-03
lola: time limit : 3598 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/3598 3/32 Sudoku-PT-AN14-LTLCardinality-03 42831 m, 8566 m/sec, 232692 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/3598 7/32 Sudoku-PT-AN14-LTLCardinality-03 96370 m, 10707 m/sec, 548068 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/3598 10/32 Sudoku-PT-AN14-LTLCardinality-03 140660 m, 8858 m/sec, 867179 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/3598 12/32 Sudoku-PT-AN14-LTLCardinality-03 183279 m, 8523 m/sec, 1184657 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/3598 15/32 Sudoku-PT-AN14-LTLCardinality-03 234698 m, 10283 m/sec, 1493935 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/3598 17/32 Sudoku-PT-AN14-LTLCardinality-03 284429 m, 9946 m/sec, 1803177 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 34/3598 19/32 Sudoku-PT-AN14-LTLCardinality-03 325767 m, 8267 m/sec, 2118550 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 39/3598 22/32 Sudoku-PT-AN14-LTLCardinality-03 366656 m, 8177 m/sec, 2434693 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 44/3598 24/32 Sudoku-PT-AN14-LTLCardinality-03 406867 m, 8042 m/sec, 2750431 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 49/3598 25/32 Sudoku-PT-AN14-LTLCardinality-03 449166 m, 8459 m/sec, 3058049 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 54/3598 26/32 Sudoku-PT-AN14-LTLCardinality-03 495842 m, 9335 m/sec, 3364171 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 59/3598 28/32 Sudoku-PT-AN14-LTLCardinality-03 528505 m, 6532 m/sec, 3682857 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 64/3598 29/32 Sudoku-PT-AN14-LTLCardinality-03 557172 m, 5733 m/sec, 4005197 t fired, .

Time elapsed: 66 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for Sudoku-PT-AN14-LTLCardinality-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN14-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 71 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN14-LTLCardinality-03: LTL unknown AGGR


Time elapsed: 71 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Sudoku-PT-AN14, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r487-tall-167912702800267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN14.tgz
mv Sudoku-PT-AN14 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;