fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r485-tall-167912698900100
Last Updated
May 14, 2023

About the Execution of ITS-Tools for Sudoku-COL-AN13

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
14731.880 572306.00 1356151.00 2537.00 FFTTFFFFTTFTFFFT normal

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.r485-tall-167912698900100.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 itstools
Input is Sudoku-COL-AN13, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912698900100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 8.1K Feb 26 09:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 09:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 08:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 08:45 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 3.5K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 10:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 09:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 09:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K 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-COL-AN13-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679164689093

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN13
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-18 18:38:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 18:38:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 18:38:10] [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-18 18:38:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 18:38:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 400 ms
[2023-03-18 18:38:11] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 2704 PT places and 2197.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 18:38:11] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 5 ms.
[2023-03-18 18:38:11] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 2 properties that can be checked using skeleton over-approximation.
FORMULA Sudoku-COL-AN13-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2023-03-18 18:38:11] [INFO ] Flatten gal took : 12 ms
[2023-03-18 18:38:11] [INFO ] Flatten gal took : 0 ms
Domain [N(13), N(13)] of place Rows breaks symmetries in sort N
[2023-03-18 18:38:11] [INFO ] Unfolded HLPN to a Petri net with 2704 places and 2197 transitions 8788 arcs in 53 ms.
[2023-03-18 18:38:11] [INFO ] Unfolded 14 HLPN properties in 10 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-COL-AN13-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 507 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 47 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-18 18:38:13] [INFO ] Computed 38 place invariants in 118 ms
[2023-03-18 18:38:13] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-18 18:38:13] [INFO ] Invariant cache hit.
[2023-03-18 18:38:14] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
[2023-03-18 18:38:14] [INFO ] Invariant cache hit.
[2023-03-18 18:38:15] [INFO ] Dead Transitions using invariants and state equation in 767 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1894 ms. Remains : 507/2704 places, 2197/2197 transitions.
Support contains 507 out of 507 places after structural reductions.
[2023-03-18 18:38:16] [INFO ] Flatten gal took : 476 ms
[2023-03-18 18:38:19] [INFO ] Flatten gal took : 616 ms
[2023-03-18 18:38:21] [INFO ] Input system was already deterministic with 2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1398 ms. (steps per millisecond=7 ) properties (out of 3) seen :2
Interrupted Best-First random walk after 5361 steps, including 1 resets, run timeout after 5839 ms. (steps per millisecond=0 ) properties seen 0
Running SMT prover for 1 properties.
[2023-03-18 18:38:29] [INFO ] Invariant cache hit.
[2023-03-18 18:38:36] [INFO ] After 777ms 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 1 ms.
FORMULA Sudoku-COL-AN13-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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(p0))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:38:37] [INFO ] Invariant cache hit.
[2023-03-18 18:38:37] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-18 18:38:37] [INFO ] Invariant cache hit.
[2023-03-18 18:38:37] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2023-03-18 18:38:37] [INFO ] Invariant cache hit.
[2023-03-18 18:38:38] [INFO ] Dead Transitions using invariants and state equation in 773 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1385 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN13-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLFireability-00 finished in 1652 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 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 5 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:38:38] [INFO ] Invariant cache hit.
[2023-03-18 18:38:38] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-18 18:38:38] [INFO ] Invariant cache hit.
[2023-03-18 18:38:39] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2023-03-18 18:38:39] [INFO ] Invariant cache hit.
[2023-03-18 18:38:40] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1316 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 60 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], 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 timeout after 44000 steps with 22000 reset in 10002 ms.
Product exploration timeout after 44640 steps with 22320 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 : [(NOT p0), (X (NOT p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN13-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN13-LTLFireability-02 finished in 23098 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(X((G(p0)||G(F(!p0)))))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 5 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:39:01] [INFO ] Invariant cache hit.
[2023-03-18 18:39:01] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-18 18:39:01] [INFO ] Invariant cache hit.
[2023-03-18 18:39:02] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
[2023-03-18 18:39:02] [INFO ] Invariant cache hit.
[2023-03-18 18:39:03] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1221 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 222 ms :[false, false, false, false, p0, p0]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 149 steps with 0 reset in 27 ms.
FORMULA Sudoku-COL-AN13-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLFireability-04 finished in 1513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 5 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:39:03] [INFO ] Invariant cache hit.
[2023-03-18 18:39:03] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-18 18:39:03] [INFO ] Invariant cache hit.
[2023-03-18 18:39:03] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2023-03-18 18:39:03] [INFO ] Invariant cache hit.
[2023-03-18 18:39:04] [INFO ] Dead Transitions using invariants and state equation in 653 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1243 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, p0, p0]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 148 steps with 0 reset in 23 ms.
FORMULA Sudoku-COL-AN13-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLFireability-06 finished in 1379 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 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 3 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:39:04] [INFO ] Invariant cache hit.
[2023-03-18 18:39:04] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-18 18:39:04] [INFO ] Invariant cache hit.
[2023-03-18 18:39:05] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2023-03-18 18:39:05] [INFO ] Invariant cache hit.
[2023-03-18 18:39:05] [INFO ] Dead Transitions using invariants and state equation in 656 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1256 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], 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 timeout after 44280 steps with 22140 reset in 10001 ms.
Product exploration timeout after 43110 steps with 21555 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 : [(NOT p0), (X (NOT p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN13-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN13-LTLFireability-08 finished in 23008 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 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 20 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:39:27] [INFO ] Invariant cache hit.
[2023-03-18 18:39:27] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-18 18:39:27] [INFO ] Invariant cache hit.
[2023-03-18 18:39:28] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2023-03-18 18:39:28] [INFO ] Redundant transitions in 119 ms returned []
[2023-03-18 18:39:28] [INFO ] Invariant cache hit.
[2023-03-18 18:39:29] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1408 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 40 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], 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 147 steps with 0 reset in 24 ms.
FORMULA Sudoku-COL-AN13-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLFireability-10 finished in 1513 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 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 15 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:39:29] [INFO ] Invariant cache hit.
[2023-03-18 18:39:29] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-18 18:39:29] [INFO ] Invariant cache hit.
[2023-03-18 18:39:29] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2023-03-18 18:39:29] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-18 18:39:29] [INFO ] Invariant cache hit.
[2023-03-18 18:39:30] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1364 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-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:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 67720 steps with 456 reset in 10003 ms.
Product exploration timeout after 66900 steps with 451 reset in 10004 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 : [(NOT p0), (X (NOT p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN13-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN13-LTLFireability-11 finished in 23106 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(((p1||X(G(p1))) U (!p1&&(p1||X(G(p1))))))||p0))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:39:52] [INFO ] Invariant cache hit.
[2023-03-18 18:39:52] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-18 18:39:52] [INFO ] Invariant cache hit.
[2023-03-18 18:39:52] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2023-03-18 18:39:52] [INFO ] Invariant cache hit.
[2023-03-18 18:39:53] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1251 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=1, aps=[p1:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], 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]]
Stuttering criterion allowed to conclude after 147 steps with 0 reset in 26 ms.
FORMULA Sudoku-COL-AN13-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLFireability-13 finished in 1526 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))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 9 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:39:53] [INFO ] Invariant cache hit.
[2023-03-18 18:39:53] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-18 18:39:53] [INFO ] Invariant cache hit.
[2023-03-18 18:39:54] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2023-03-18 18:39:54] [INFO ] Invariant cache hit.
[2023-03-18 18:39:55] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1203 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 97 ms :[p0, p0, p0]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 34260 steps with 11420 reset in 10001 ms.
Product exploration timeout after 34020 steps with 11340 reset in 10006 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 : [(NOT p0), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[p0, p0, p0]
Finished random walk after 147 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 193 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 98 ms :[p0, p0, p0]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 5 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:40:17] [INFO ] Invariant cache hit.
[2023-03-18 18:40:17] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-18 18:40:17] [INFO ] Invariant cache hit.
[2023-03-18 18:40:18] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2023-03-18 18:40:18] [INFO ] Invariant cache hit.
[2023-03-18 18:40:18] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1316 ms. Remains : 507/507 places, 2197/2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 : [(NOT p0), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[p0, p0, p0]
Finished random walk after 147 steps, including 0 resets, run visited all 1 properties in 27 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 105 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 118 ms :[p0, p0, p0]
Product exploration timeout after 34410 steps with 11470 reset in 10005 ms.
Product exploration timeout after 34110 steps with 11370 reset in 10001 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 97 ms :[p0, p0, p0]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 22 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:40:41] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-18 18:40:41] [INFO ] Invariant cache hit.
[2023-03-18 18:40:42] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 732 ms. Remains : 507/507 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin1056255933354163362
[2023-03-18 18:40:42] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1056255933354163362
Running compilation step : cd /tmp/ltsmin1056255933354163362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1056255933354163362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1056255933354163362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:40:45] [INFO ] Invariant cache hit.
[2023-03-18 18:40:45] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-18 18:40:45] [INFO ] Invariant cache hit.
[2023-03-18 18:40:45] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2023-03-18 18:40:45] [INFO ] Invariant cache hit.
[2023-03-18 18:40:46] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1267 ms. Remains : 507/507 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin17423234218759752049
[2023-03-18 18:40:46] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17423234218759752049
Running compilation step : cd /tmp/ltsmin17423234218759752049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17423234218759752049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17423234218759752049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 18:40:50] [INFO ] Flatten gal took : 174 ms
[2023-03-18 18:40:50] [INFO ] Flatten gal took : 125 ms
[2023-03-18 18:40:50] [INFO ] Time to serialize gal into /tmp/LTL2105254110936355085.gal : 23 ms
[2023-03-18 18:40:50] [INFO ] Time to serialize properties into /tmp/LTL10002078935661551100.prop : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2105254110936355085.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17053079443498934404.hoa' '-atoms' '/tmp/LTL10002078935661551100.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10002078935661551100.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17053079443498934404.hoa
Detected timeout of ITS tools.
[2023-03-18 18:41:06] [INFO ] Flatten gal took : 94 ms
[2023-03-18 18:41:06] [INFO ] Flatten gal took : 98 ms
[2023-03-18 18:41:06] [INFO ] Time to serialize gal into /tmp/LTL13164820099565268059.gal : 18 ms
[2023-03-18 18:41:06] [INFO ] Time to serialize properties into /tmp/LTL10589988071610078450.ltl : 22 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13164820099565268059.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10589988071610078450.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((((((((((((((Rows_82>=1)&&(Cells_89>=1))&&(Columns_147>=1))||(((Rows_136>=1)&&(Cells_133>=1))&&(Columns_45>=1)))||((((Rows...116578
Formula 0 simplified : XXG!"(((((((((((((((Rows_82>=1)&&(Cells_89>=1))&&(Columns_147>=1))||(((Rows_136>=1)&&(Cells_133>=1))&&(Columns_45>=1)))||((((Rows_11...116570
Detected timeout of ITS tools.
[2023-03-18 18:41:21] [INFO ] Flatten gal took : 90 ms
[2023-03-18 18:41:21] [INFO ] Applying decomposition
[2023-03-18 18:41:21] [INFO ] Flatten gal took : 91 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11123064917213782543.txt' '-o' '/tmp/graph11123064917213782543.bin' '-w' '/tmp/graph11123064917213782543.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11123064917213782543.bin' '-l' '-1' '-v' '-w' '/tmp/graph11123064917213782543.weights' '-q' '0' '-e' '0.001'
[2023-03-18 18:41:21] [INFO ] Decomposing Gal with order
[2023-03-18 18:41:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 18:41:22] [INFO ] Removed a total of 6084 redundant transitions.
[2023-03-18 18:41:22] [INFO ] Flatten gal took : 509 ms
[2023-03-18 18:41:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2023-03-18 18:41:22] [INFO ] Time to serialize gal into /tmp/LTL10305073166438326078.gal : 15 ms
[2023-03-18 18:41:22] [INFO ] Time to serialize properties into /tmp/LTL1932827007708149869.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10305073166438326078.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1932827007708149869.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((((((((((((((u82.Rows_82>=1)&&(u258.Cells_89>=1))&&(u485.Columns_147>=1))||(((u136.Rows_136>=1)&&(u302.Cells_133>=1))&&(u3...148103
Formula 0 simplified : XXG!"(((((((((((((((u82.Rows_82>=1)&&(u258.Cells_89>=1))&&(u485.Columns_147>=1))||(((u136.Rows_136>=1)&&(u302.Cells_133>=1))&&(u383....148095
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9190946134400836256
[2023-03-18 18:41:37] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9190946134400836256
Running compilation step : cd /tmp/ltsmin9190946134400836256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9190946134400836256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9190946134400836256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Sudoku-COL-AN13-LTLFireability-15 finished in 106867 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))))'
Found a Shortening insensitive property : Sudoku-COL-AN13-LTLFireability-15
Stuttering acceptance computed with spot in 112 ms :[p0, p0, p0]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 14 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:41:40] [INFO ] Invariant cache hit.
[2023-03-18 18:41:41] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-18 18:41:41] [INFO ] Invariant cache hit.
[2023-03-18 18:41:41] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2023-03-18 18:41:41] [INFO ] Invariant cache hit.
[2023-03-18 18:41:42] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1247 ms. Remains : 507/507 places, 2197/2197 transitions.
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], 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, null][false, false, false]]
Product exploration timeout after 34540 steps with 11513 reset in 10001 ms.
Product exploration timeout after 34710 steps with 11570 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 : [(NOT p0), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[p0, p0, p0]
Finished random walk after 148 steps, including 0 resets, run visited all 1 properties in 24 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 97 ms :[p0, p0, p0]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 3 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:42:04] [INFO ] Invariant cache hit.
[2023-03-18 18:42:04] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-18 18:42:04] [INFO ] Invariant cache hit.
[2023-03-18 18:42:05] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2023-03-18 18:42:05] [INFO ] Invariant cache hit.
[2023-03-18 18:42:05] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1225 ms. Remains : 507/507 places, 2197/2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 : [(NOT p0), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[p0, p0, p0]
Finished random walk after 152 steps, including 0 resets, run visited all 1 properties in 22 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 96 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 108 ms :[p0, p0, p0]
Product exploration timeout after 34780 steps with 11593 reset in 10002 ms.
Product exploration timeout after 34570 steps with 11523 reset in 10003 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 102 ms :[p0, p0, p0]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 13 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:42:28] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-18 18:42:28] [INFO ] Invariant cache hit.
[2023-03-18 18:42:28] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 687 ms. Remains : 507/507 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin11630977426809832008
[2023-03-18 18:42:28] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11630977426809832008
Running compilation step : cd /tmp/ltsmin11630977426809832008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11630977426809832008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11630977426809832008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 9 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:42:31] [INFO ] Invariant cache hit.
[2023-03-18 18:42:31] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-18 18:42:31] [INFO ] Invariant cache hit.
[2023-03-18 18:42:32] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2023-03-18 18:42:32] [INFO ] Invariant cache hit.
[2023-03-18 18:42:33] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1195 ms. Remains : 507/507 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin7797235673179880939
[2023-03-18 18:42:33] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7797235673179880939
Running compilation step : cd /tmp/ltsmin7797235673179880939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7797235673179880939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7797235673179880939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 18:42:36] [INFO ] Flatten gal took : 75 ms
[2023-03-18 18:42:36] [INFO ] Flatten gal took : 71 ms
[2023-03-18 18:42:36] [INFO ] Time to serialize gal into /tmp/LTL3824918024782793236.gal : 11 ms
[2023-03-18 18:42:36] [INFO ] Time to serialize properties into /tmp/LTL10097468005458258755.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3824918024782793236.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1452054525521437784.hoa' '-atoms' '/tmp/LTL10097468005458258755.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10097468005458258755.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1452054525521437784.hoa
Detected timeout of ITS tools.
[2023-03-18 18:42:52] [INFO ] Flatten gal took : 82 ms
[2023-03-18 18:42:52] [INFO ] Flatten gal took : 85 ms
[2023-03-18 18:42:52] [INFO ] Time to serialize gal into /tmp/LTL5454389257579225151.gal : 9 ms
[2023-03-18 18:42:52] [INFO ] Time to serialize properties into /tmp/LTL5763895582605515091.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5454389257579225151.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5763895582605515091.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((((((((((((((Rows_82>=1)&&(Cells_89>=1))&&(Columns_147>=1))||(((Rows_136>=1)&&(Cells_133>=1))&&(Columns_45>=1)))||((((Rows...116578
Formula 0 simplified : XXG!"(((((((((((((((Rows_82>=1)&&(Cells_89>=1))&&(Columns_147>=1))||(((Rows_136>=1)&&(Cells_133>=1))&&(Columns_45>=1)))||((((Rows_11...116570
Detected timeout of ITS tools.
[2023-03-18 18:43:07] [INFO ] Flatten gal took : 82 ms
[2023-03-18 18:43:07] [INFO ] Applying decomposition
[2023-03-18 18:43:07] [INFO ] Flatten gal took : 181 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18445076794032096168.txt' '-o' '/tmp/graph18445076794032096168.bin' '-w' '/tmp/graph18445076794032096168.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18445076794032096168.bin' '-l' '-1' '-v' '-w' '/tmp/graph18445076794032096168.weights' '-q' '0' '-e' '0.001'
[2023-03-18 18:43:07] [INFO ] Decomposing Gal with order
[2023-03-18 18:43:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 18:43:07] [INFO ] Removed a total of 6084 redundant transitions.
[2023-03-18 18:43:07] [INFO ] Flatten gal took : 125 ms
[2023-03-18 18:43:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2023-03-18 18:43:07] [INFO ] Time to serialize gal into /tmp/LTL5870368401185950616.gal : 10 ms
[2023-03-18 18:43:07] [INFO ] Time to serialize properties into /tmp/LTL14445991151228674925.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5870368401185950616.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14445991151228674925.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((((((((((((((u82.Rows_82>=1)&&(u258.Cells_89>=1))&&(u485.Columns_147>=1))||(((u136.Rows_136>=1)&&(u302.Cells_133>=1))&&(u3...148103
Formula 0 simplified : XXG!"(((((((((((((((u82.Rows_82>=1)&&(u258.Cells_89>=1))&&(u485.Columns_147>=1))||(((u136.Rows_136>=1)&&(u302.Cells_133>=1))&&(u383....148095
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10855196366573992271
[2023-03-18 18:43:23] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10855196366573992271
Running compilation step : cd /tmp/ltsmin10855196366573992271;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10855196366573992271;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10855196366573992271;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Sudoku-COL-AN13-LTLFireability-15 finished in 105428 ms.
[2023-03-18 18:43:26] [INFO ] Flatten gal took : 81 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8300542165656696217
[2023-03-18 18:43:26] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2023-03-18 18:43:26] [INFO ] Applying decomposition
[2023-03-18 18:43:26] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8300542165656696217
Running compilation step : cd /tmp/ltsmin8300542165656696217;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-18 18:43:26] [INFO ] Flatten gal took : 81 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1564701870535269090.txt' '-o' '/tmp/graph1564701870535269090.bin' '-w' '/tmp/graph1564701870535269090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1564701870535269090.bin' '-l' '-1' '-v' '-w' '/tmp/graph1564701870535269090.weights' '-q' '0' '-e' '0.001'
[2023-03-18 18:43:26] [INFO ] Decomposing Gal with order
[2023-03-18 18:43:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 18:43:26] [INFO ] Removed a total of 6084 redundant transitions.
[2023-03-18 18:43:26] [INFO ] Flatten gal took : 117 ms
[2023-03-18 18:43:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2023-03-18 18:43:26] [INFO ] Time to serialize gal into /tmp/LTLFireability14527478793997195782.gal : 10 ms
[2023-03-18 18:43:26] [INFO ] Time to serialize properties into /tmp/LTLFireability1162958677835078569.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14527478793997195782.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1162958677835078569.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F(!("(((((((((((((((u82.Rows_82<1)||(u258.Cells_89<1))||(u485.Columns_147<1))&&(((u136.Rows_136<1)||(u302.Cells_133<1))||(u383....141515
Formula 0 simplified : XXG"(((((((((((((((u82.Rows_82<1)||(u258.Cells_89<1))||(u485.Columns_147<1))&&(((u136.Rows_136<1)||(u302.Cells_133<1))||(u383.Column...141503
Compilation finished in 5336 ms.
Running link step : cd /tmp/ltsmin8300542165656696217;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin8300542165656696217;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(!(LTLAPp0==true))))' '--buchi-type=spotba'
LTSmin run took 246503 ms.
FORMULA Sudoku-COL-AN13-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 567487 ms.

BK_STOP 1679165261399

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-COL-AN13"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Sudoku-COL-AN13, 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 r485-tall-167912698900100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN13.tgz
mv Sudoku-COL-AN13 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 ;