Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r219-smll-171649597900082.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is HirschbergSinclair-PT-50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r219-smll-171649597900082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 02:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 13 02:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 02:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 13 02:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 652K May 18 16:42 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 HirschbergSinclair-PT-50-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716655589758

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-50
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 16:46:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 16:46:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:46:32] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-05-25 16:46:32] [INFO ] Transformed 1208 places.
[2024-05-25 16:46:32] [INFO ] Transformed 1102 transitions.
[2024-05-25 16:46:32] [INFO ] Parsed PT model containing 1208 places and 1102 transitions and 3361 arcs in 280 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HirschbergSinclair-PT-50-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-50-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 1208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1208/1208 places, 1102/1102 transitions.
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 1159 transition count 1102
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 97 place count 1111 transition count 1054
Iterating global reduction 1 with 48 rules applied. Total rules applied 145 place count 1111 transition count 1054
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 189 place count 1067 transition count 1010
Iterating global reduction 1 with 44 rules applied. Total rules applied 233 place count 1067 transition count 1010
Applied a total of 233 rules in 549 ms. Remains 1067 /1208 variables (removed 141) and now considering 1010/1102 (removed 92) transitions.
// Phase 1: matrix 1010 rows 1067 cols
[2024-05-25 16:46:33] [INFO ] Computed 57 invariants in 45 ms
[2024-05-25 16:46:34] [INFO ] Implicit Places using invariants in 1252 ms returned []
[2024-05-25 16:46:34] [INFO ] Invariant cache hit.
[2024-05-25 16:46:39] [INFO ] Implicit Places using invariants and state equation in 4517 ms returned []
Implicit Place search using SMT with State Equation took 5831 ms to find 0 implicit places.
[2024-05-25 16:46:39] [INFO ] Invariant cache hit.
[2024-05-25 16:46:40] [INFO ] Dead Transitions using invariants and state equation in 1303 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1067/1208 places, 1010/1102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7689 ms. Remains : 1067/1208 places, 1010/1102 transitions.
Support contains 52 out of 1067 places after structural reductions.
[2024-05-25 16:46:41] [INFO ] Flatten gal took : 168 ms
[2024-05-25 16:46:41] [INFO ] Flatten gal took : 92 ms
[2024-05-25 16:46:41] [INFO ] Input system was already deterministic with 1010 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 587 ms. (steps per millisecond=17 ) properties (out of 30) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-25 16:46:42] [INFO ] Invariant cache hit.
[2024-05-25 16:46:42] [INFO ] After 358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-25 16:46:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-25 16:46:43] [INFO ] [Nat]Absence check using 1 positive and 56 generalized place invariants in 276 ms returned sat
[2024-05-25 16:46:44] [INFO ] After 1445ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
FORMULA HirschbergSinclair-PT-50-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-50-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-50-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1067 stabilizing places and 1010 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1067 transition count 1010
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1067 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Graph (complete) has 2026 edges and 1067 vertex of which 1066 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 48 places and 48 transitions.
Drop transitions removed 435 transitions
Trivial Post-agglo rules discarded 435 transitions
Performed 435 trivial Post agglomeration. Transition count delta: 435
Iterating post reduction 0 with 435 rules applied. Total rules applied 436 place count 1018 transition count 527
Reduce places removed 435 places and 0 transitions.
Iterating post reduction 1 with 435 rules applied. Total rules applied 871 place count 583 transition count 527
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 877 place count 577 transition count 521
Iterating global reduction 2 with 6 rules applied. Total rules applied 883 place count 577 transition count 521
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 887 place count 577 transition count 517
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 891 place count 573 transition count 517
Applied a total of 891 rules in 143 ms. Remains 573 /1067 variables (removed 494) and now considering 517/1010 (removed 493) transitions.
// Phase 1: matrix 517 rows 573 cols
[2024-05-25 16:46:44] [INFO ] Computed 56 invariants in 5 ms
[2024-05-25 16:46:45] [INFO ] Implicit Places using invariants in 1105 ms returned []
[2024-05-25 16:46:45] [INFO ] Invariant cache hit.
[2024-05-25 16:46:46] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:46:48] [INFO ] Implicit Places using invariants and state equation in 2664 ms returned []
Implicit Place search using SMT with State Equation took 3786 ms to find 0 implicit places.
[2024-05-25 16:46:48] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-25 16:46:48] [INFO ] Invariant cache hit.
[2024-05-25 16:46:49] [INFO ] Dead Transitions using invariants and state equation in 772 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 573/1067 places, 517/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4770 ms. Remains : 573/1067 places, 517/1010 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 341 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-01 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 s47 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 176 reset in 673 ms.
Product exploration explored 100000 steps with 176 reset in 476 ms.
Computed a total of 573 stabilizing places and 517 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 573 transition count 517
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 : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 84 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 517/517 transitions.
Applied a total of 0 rules in 39 ms. Remains 573 /573 variables (removed 0) and now considering 517/517 (removed 0) transitions.
[2024-05-25 16:46:51] [INFO ] Invariant cache hit.
[2024-05-25 16:46:52] [INFO ] Implicit Places using invariants in 741 ms returned []
[2024-05-25 16:46:52] [INFO ] Invariant cache hit.
[2024-05-25 16:46:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:46:55] [INFO ] Implicit Places using invariants and state equation in 3036 ms returned []
Implicit Place search using SMT with State Equation took 3781 ms to find 0 implicit places.
[2024-05-25 16:46:55] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-25 16:46:55] [INFO ] Invariant cache hit.
[2024-05-25 16:46:56] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4560 ms. Remains : 573/573 places, 517/517 transitions.
Computed a total of 573 stabilizing places and 517 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 573 transition count 517
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 : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 127 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=31 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 176 reset in 364 ms.
Product exploration explored 100000 steps with 176 reset in 435 ms.
Built C files in :
/tmp/ltsmin17477376749118066250
[2024-05-25 16:46:57] [INFO ] Computing symmetric may disable matrix : 517 transitions.
[2024-05-25 16:46:57] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:46:57] [INFO ] Computing symmetric may enable matrix : 517 transitions.
[2024-05-25 16:46:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:46:57] [INFO ] Computing Do-Not-Accords matrix : 517 transitions.
[2024-05-25 16:46:57] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:46:57] [INFO ] Built C files in 136ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17477376749118066250
Running compilation step : cd /tmp/ltsmin17477376749118066250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2132 ms.
Running link step : cd /tmp/ltsmin17477376749118066250;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin17477376749118066250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased618003687854734242.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 517/517 transitions.
Applied a total of 0 rules in 61 ms. Remains 573 /573 variables (removed 0) and now considering 517/517 (removed 0) transitions.
[2024-05-25 16:47:12] [INFO ] Invariant cache hit.
[2024-05-25 16:47:13] [INFO ] Implicit Places using invariants in 1097 ms returned []
[2024-05-25 16:47:13] [INFO ] Invariant cache hit.
[2024-05-25 16:47:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:47:16] [INFO ] Implicit Places using invariants and state equation in 2892 ms returned []
Implicit Place search using SMT with State Equation took 4001 ms to find 0 implicit places.
[2024-05-25 16:47:16] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-25 16:47:16] [INFO ] Invariant cache hit.
[2024-05-25 16:47:17] [INFO ] Dead Transitions using invariants and state equation in 793 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4869 ms. Remains : 573/573 places, 517/517 transitions.
Built C files in :
/tmp/ltsmin15819349501110322813
[2024-05-25 16:47:17] [INFO ] Computing symmetric may disable matrix : 517 transitions.
[2024-05-25 16:47:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:47:17] [INFO ] Computing symmetric may enable matrix : 517 transitions.
[2024-05-25 16:47:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:47:17] [INFO ] Computing Do-Not-Accords matrix : 517 transitions.
[2024-05-25 16:47:17] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:47:17] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15819349501110322813
Running compilation step : cd /tmp/ltsmin15819349501110322813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1788 ms.
Running link step : cd /tmp/ltsmin15819349501110322813;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15819349501110322813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8876181659575812762.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 16:47:32] [INFO ] Flatten gal took : 52 ms
[2024-05-25 16:47:32] [INFO ] Flatten gal took : 42 ms
[2024-05-25 16:47:32] [INFO ] Time to serialize gal into /tmp/LTL4536940846987108040.gal : 7 ms
[2024-05-25 16:47:32] [INFO ] Time to serialize properties into /tmp/LTL10608215103872595694.prop : 1 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4536940846987108040.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11544531486708561971.hoa' '-atoms' '/tmp/LTL10608215103872595694.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10608215103872595694.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11544531486708561971.hoa
Detected timeout of ITS tools.
[2024-05-25 16:47:48] [INFO ] Flatten gal took : 28 ms
[2024-05-25 16:47:48] [INFO ] Flatten gal took : 24 ms
[2024-05-25 16:47:48] [INFO ] Time to serialize gal into /tmp/LTL4032678922403504410.gal : 4 ms
[2024-05-25 16:47:48] [INFO ] Time to serialize properties into /tmp/LTL7072145872935732130.ltl : 3 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4032678922403504410.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7072145872935732130.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(newmsg46<=init10)"))))
Formula 0 simplified : GF!"(newmsg46<=init10)"
Detected timeout of ITS tools.
[2024-05-25 16:48:03] [INFO ] Flatten gal took : 22 ms
[2024-05-25 16:48:03] [INFO ] Applying decomposition
[2024-05-25 16:48:03] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1877269842828795597.txt' '-o' '/tmp/graph1877269842828795597.bin' '-w' '/tmp/graph1877269842828795597.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1877269842828795597.bin' '-l' '-1' '-v' '-w' '/tmp/graph1877269842828795597.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:48:03] [INFO ] Decomposing Gal with order
[2024-05-25 16:48:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:48:03] [INFO ] Removed a total of 360 redundant transitions.
[2024-05-25 16:48:03] [INFO ] Flatten gal took : 137 ms
[2024-05-25 16:48:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 43 ms.
[2024-05-25 16:48:04] [INFO ] Time to serialize gal into /tmp/LTL9532678325323622524.gal : 32 ms
[2024-05-25 16:48:04] [INFO ] Time to serialize properties into /tmp/LTL15038835068265511424.ltl : 1 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9532678325323622524.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15038835068265511424.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu0.newmsg46<=gu0.init10)"))))
Formula 0 simplified : GF!"(gu0.newmsg46<=gu0.init10)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7662765768068833036
[2024-05-25 16:48:19] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7662765768068833036
Running compilation step : cd /tmp/ltsmin7662765768068833036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1325 ms.
Running link step : cd /tmp/ltsmin7662765768068833036;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin7662765768068833036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-01 finished in 109808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0||G(p1)))&&F(p0))))'
Support contains 4 out of 1067 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1066 transition count 1010
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 1060 transition count 1004
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 1060 transition count 1004
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 1058 transition count 1002
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 1058 transition count 1002
Applied a total of 17 rules in 152 ms. Remains 1058 /1067 variables (removed 9) and now considering 1002/1010 (removed 8) transitions.
// Phase 1: matrix 1002 rows 1058 cols
[2024-05-25 16:48:34] [INFO ] Computed 56 invariants in 9 ms
[2024-05-25 16:48:35] [INFO ] Implicit Places using invariants in 1117 ms returned []
[2024-05-25 16:48:35] [INFO ] Invariant cache hit.
[2024-05-25 16:48:40] [INFO ] Implicit Places using invariants and state equation in 4715 ms returned []
Implicit Place search using SMT with State Equation took 5841 ms to find 0 implicit places.
[2024-05-25 16:48:40] [INFO ] Invariant cache hit.
[2024-05-25 16:48:41] [INFO ] Dead Transitions using invariants and state equation in 966 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1058/1067 places, 1002/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6962 ms. Remains : 1058/1067 places, 1002/1010 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s462 s355), p1:(LEQ s991 s249)], 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]]
Product exploration explored 100000 steps with 33333 reset in 1023 ms.
Product exploration explored 100000 steps with 33333 reset in 907 ms.
Computed a total of 1058 stabilizing places and 1002 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1058 transition count 1002
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 p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 122 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-50-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-02 finished in 9669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&G((p1&&(p1 U X(p2))))))))'
Support contains 5 out of 1067 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Graph (complete) has 2026 edges and 1067 vertex of which 1066 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 49 places and 49 transitions.
Drop transitions removed 440 transitions
Trivial Post-agglo rules discarded 440 transitions
Performed 440 trivial Post agglomeration. Transition count delta: 440
Iterating post reduction 0 with 440 rules applied. Total rules applied 441 place count 1017 transition count 521
Reduce places removed 440 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 442 rules applied. Total rules applied 883 place count 577 transition count 519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 885 place count 575 transition count 519
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 890 place count 570 transition count 514
Iterating global reduction 3 with 5 rules applied. Total rules applied 895 place count 570 transition count 514
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 898 place count 570 transition count 511
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 901 place count 567 transition count 511
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 903 place count 566 transition count 510
Applied a total of 903 rules in 153 ms. Remains 566 /1067 variables (removed 501) and now considering 510/1010 (removed 500) transitions.
// Phase 1: matrix 510 rows 566 cols
[2024-05-25 16:48:44] [INFO ] Computed 56 invariants in 4 ms
[2024-05-25 16:48:44] [INFO ] Implicit Places using invariants in 764 ms returned []
[2024-05-25 16:48:44] [INFO ] Invariant cache hit.
[2024-05-25 16:48:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:48:48] [INFO ] Implicit Places using invariants and state equation in 3596 ms returned []
Implicit Place search using SMT with State Equation took 4366 ms to find 0 implicit places.
[2024-05-25 16:48:48] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-25 16:48:48] [INFO ] Invariant cache hit.
[2024-05-25 16:48:49] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 566/1067 places, 510/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5076 ms. Remains : 566/1067 places, 510/1010 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 1 s112), p0:(GT s290 s224), p2:(LEQ s419 s268)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 345 reset in 518 ms.
Product exploration explored 100000 steps with 345 reset in 564 ms.
Computed a total of 566 stabilizing places and 510 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 566 transition count 510
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 (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 1507 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 17 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 16:48:52] [INFO ] Invariant cache hit.
[2024-05-25 16:48:52] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:48:53] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 148 ms returned sat
[2024-05-25 16:48:53] [INFO ] After 633ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:48:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:48:53] [INFO ] After 40ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 16:48:53] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2024-05-25 16:48:54] [INFO ] After 1232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 289 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=72 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 (NOT p0) (NOT p2))), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 8 factoid took 2189 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2024-05-25 16:48:56] [INFO ] Invariant cache hit.
[2024-05-25 16:48:57] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 368 ms returned sat
[2024-05-25 16:48:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:49:11] [INFO ] [Real]Absence check using state equation in 14058 ms returned unknown
Could not prove EG (NOT p0)
Support contains 5 out of 566 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 566/566 places, 510/510 transitions.
Applied a total of 0 rules in 33 ms. Remains 566 /566 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-05-25 16:49:11] [INFO ] Invariant cache hit.
[2024-05-25 16:49:12] [INFO ] Implicit Places using invariants in 1175 ms returned []
[2024-05-25 16:49:12] [INFO ] Invariant cache hit.
[2024-05-25 16:49:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:49:16] [INFO ] Implicit Places using invariants and state equation in 3546 ms returned []
Implicit Place search using SMT with State Equation took 4732 ms to find 0 implicit places.
[2024-05-25 16:49:16] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-25 16:49:16] [INFO ] Invariant cache hit.
[2024-05-25 16:49:16] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5344 ms. Remains : 566/566 places, 510/510 transitions.
Computed a total of 566 stabilizing places and 510 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 566 transition count 510
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 (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 9 factoid took 1236 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 17 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 16:49:18] [INFO ] Invariant cache hit.
[2024-05-25 16:49:18] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:49:19] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 148 ms returned sat
[2024-05-25 16:49:19] [INFO ] After 573ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:49:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:49:19] [INFO ] After 40ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 16:49:19] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-05-25 16:49:20] [INFO ] After 1025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 292 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=97 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 (NOT p0) (NOT p2))), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 9 factoid took 1950 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2024-05-25 16:49:22] [INFO ] Invariant cache hit.
[2024-05-25 16:49:23] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 247 ms returned sat
[2024-05-25 16:49:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:49:37] [INFO ] [Real]Absence check using state equation in 14095 ms returned sat
[2024-05-25 16:49:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:49:38] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 582 ms returned sat
[2024-05-25 16:49:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:49:41] [INFO ] [Nat]Absence check using state equation in 3297 ms returned sat
[2024-05-25 16:49:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:49:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 53 ms returned sat
[2024-05-25 16:49:41] [INFO ] Computed and/alt/rep : 414/428/414 causal constraints (skipped 0 transitions) in 32 ms.
[2024-05-25 16:49:47] [INFO ] Added : 202 causal constraints over 41 iterations in 5231 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 365 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 346 reset in 571 ms.
Product exploration explored 100000 steps with 346 reset in 564 ms.
Built C files in :
/tmp/ltsmin8388005872934412173
[2024-05-25 16:49:48] [INFO ] Computing symmetric may disable matrix : 510 transitions.
[2024-05-25 16:49:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:49:48] [INFO ] Computing symmetric may enable matrix : 510 transitions.
[2024-05-25 16:49:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:49:48] [INFO ] Computing Do-Not-Accords matrix : 510 transitions.
[2024-05-25 16:49:48] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:49:48] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8388005872934412173
Running compilation step : cd /tmp/ltsmin8388005872934412173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1791 ms.
Running link step : cd /tmp/ltsmin8388005872934412173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8388005872934412173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4234734141853384086.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 566 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 566/566 places, 510/510 transitions.
Applied a total of 0 rules in 28 ms. Remains 566 /566 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-05-25 16:50:03] [INFO ] Invariant cache hit.
[2024-05-25 16:50:04] [INFO ] Implicit Places using invariants in 889 ms returned []
[2024-05-25 16:50:04] [INFO ] Invariant cache hit.
[2024-05-25 16:50:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:50:08] [INFO ] Implicit Places using invariants and state equation in 3605 ms returned []
Implicit Place search using SMT with State Equation took 4512 ms to find 0 implicit places.
[2024-05-25 16:50:08] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-25 16:50:08] [INFO ] Invariant cache hit.
[2024-05-25 16:50:08] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5141 ms. Remains : 566/566 places, 510/510 transitions.
Built C files in :
/tmp/ltsmin3784191016842417051
[2024-05-25 16:50:08] [INFO ] Computing symmetric may disable matrix : 510 transitions.
[2024-05-25 16:50:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:50:08] [INFO ] Computing symmetric may enable matrix : 510 transitions.
[2024-05-25 16:50:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:50:08] [INFO ] Computing Do-Not-Accords matrix : 510 transitions.
[2024-05-25 16:50:08] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:50:08] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3784191016842417051
Running compilation step : cd /tmp/ltsmin3784191016842417051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1882 ms.
Running link step : cd /tmp/ltsmin3784191016842417051;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3784191016842417051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5080504519062277389.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 16:50:23] [INFO ] Flatten gal took : 49 ms
[2024-05-25 16:50:23] [INFO ] Flatten gal took : 47 ms
[2024-05-25 16:50:23] [INFO ] Time to serialize gal into /tmp/LTL10688046922095396074.gal : 6 ms
[2024-05-25 16:50:23] [INFO ] Time to serialize properties into /tmp/LTL1751641270570475300.prop : 1 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10688046922095396074.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14116411421253859310.hoa' '-atoms' '/tmp/LTL1751641270570475300.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1751641270570475300.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14116411421253859310.hoa
Detected timeout of ITS tools.
[2024-05-25 16:50:39] [INFO ] Flatten gal took : 27 ms
[2024-05-25 16:50:39] [INFO ] Flatten gal took : 58 ms
[2024-05-25 16:50:39] [INFO ] Time to serialize gal into /tmp/LTL1383240323873981882.gal : 4 ms
[2024-05-25 16:50:39] [INFO ] Time to serialize properties into /tmp/LTL10705108856481272872.ltl : 1 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1383240323873981882.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10705108856481272872.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(election_50_5_5_to_left_46>rcv_right_election_50_4_7_43)")))||((F("(election_50_5_5_to_left_46>rcv_right_election_50_4_7_4...308
Formula 0 simplified : G(FG!"(election_50_5_5_to_left_46>rcv_right_election_50_4_7_43)" & (G!"(election_50_5_5_to_left_46>rcv_right_election_50_4_7_43)" | ...295
Detected timeout of ITS tools.
[2024-05-25 16:50:54] [INFO ] Flatten gal took : 18 ms
[2024-05-25 16:50:54] [INFO ] Applying decomposition
[2024-05-25 16:50:54] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17883450484512084727.txt' '-o' '/tmp/graph17883450484512084727.bin' '-w' '/tmp/graph17883450484512084727.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17883450484512084727.bin' '-l' '-1' '-v' '-w' '/tmp/graph17883450484512084727.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:50:54] [INFO ] Decomposing Gal with order
[2024-05-25 16:50:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:50:54] [INFO ] Removed a total of 348 redundant transitions.
[2024-05-25 16:50:54] [INFO ] Flatten gal took : 66 ms
[2024-05-25 16:50:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 47 ms.
[2024-05-25 16:50:54] [INFO ] Time to serialize gal into /tmp/LTL5970966178264236691.gal : 10 ms
[2024-05-25 16:50:54] [INFO ] Time to serialize properties into /tmp/LTL15345914675128428404.ltl : 1 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5970966178264236691.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15345914675128428404.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(gu111.election_50_5_5_to_left_46>gu111.rcv_right_election_50_4_7_43)")))||((F("(gu111.election_50_5_5_to_left_46>gu111.rcv...392
Formula 0 simplified : G(FG!"(gu111.election_50_5_5_to_left_46>gu111.rcv_right_election_50_4_7_43)" & (G!"(gu111.election_50_5_5_to_left_46>gu111.rcv_right...379
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1790820721789906376
[2024-05-25 16:51:09] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1790820721789906376
Running compilation step : cd /tmp/ltsmin1790820721789906376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1342 ms.
Running link step : cd /tmp/ltsmin1790820721789906376;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1790820721789906376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&[](((LTLAPp1==true)&&((LTLAPp1==true) U X((LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-03 finished in 161036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X((p1||X(p2))))))'
Support contains 6 out of 1067 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1063 transition count 1006
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1063 transition count 1006
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1062 transition count 1005
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1062 transition count 1005
Applied a total of 10 rules in 137 ms. Remains 1062 /1067 variables (removed 5) and now considering 1005/1010 (removed 5) transitions.
// Phase 1: matrix 1005 rows 1062 cols
[2024-05-25 16:51:25] [INFO ] Computed 57 invariants in 8 ms
[2024-05-25 16:51:26] [INFO ] Implicit Places using invariants in 894 ms returned []
[2024-05-25 16:51:26] [INFO ] Invariant cache hit.
[2024-05-25 16:51:30] [INFO ] Implicit Places using invariants and state equation in 4670 ms returned []
Implicit Place search using SMT with State Equation took 5572 ms to find 0 implicit places.
[2024-05-25 16:51:30] [INFO ] Invariant cache hit.
[2024-05-25 16:51:31] [INFO ] Dead Transitions using invariants and state equation in 1041 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1062/1067 places, 1005/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6765 ms. Remains : 1062/1067 places, 1005/1010 transitions.
Stuttering acceptance computed with spot in 423 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s180 s257), p1:(LEQ s140 s239), p2:(LEQ s6 s80)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 400 steps with 15 reset in 4 ms.
FORMULA HirschbergSinclair-PT-50-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-04 finished in 7227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 1067 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Graph (complete) has 2026 edges and 1067 vertex of which 1066 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 50 places and 50 transitions.
Drop transitions removed 441 transitions
Trivial Post-agglo rules discarded 441 transitions
Performed 441 trivial Post agglomeration. Transition count delta: 441
Iterating post reduction 0 with 441 rules applied. Total rules applied 442 place count 1016 transition count 519
Reduce places removed 441 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 442 rules applied. Total rules applied 884 place count 575 transition count 518
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 885 place count 574 transition count 518
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 891 place count 568 transition count 512
Iterating global reduction 3 with 6 rules applied. Total rules applied 897 place count 568 transition count 512
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 901 place count 568 transition count 508
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 905 place count 564 transition count 508
Applied a total of 905 rules in 71 ms. Remains 564 /1067 variables (removed 503) and now considering 508/1010 (removed 502) transitions.
// Phase 1: matrix 508 rows 564 cols
[2024-05-25 16:51:32] [INFO ] Computed 56 invariants in 4 ms
[2024-05-25 16:51:33] [INFO ] Implicit Places using invariants in 751 ms returned []
[2024-05-25 16:51:33] [INFO ] Invariant cache hit.
[2024-05-25 16:51:36] [INFO ] Implicit Places using invariants and state equation in 3066 ms returned []
Implicit Place search using SMT with State Equation took 3834 ms to find 0 implicit places.
[2024-05-25 16:51:36] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-25 16:51:36] [INFO ] Invariant cache hit.
[2024-05-25 16:51:36] [INFO ] Dead Transitions using invariants and state equation in 817 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 564/1067 places, 508/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4737 ms. Remains : 564/1067 places, 508/1010 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 3 s229) (LEQ 2 s242) (LEQ s302 s81))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 257 reset in 453 ms.
Product exploration explored 100000 steps with 251 reset in 505 ms.
Computed a total of 564 stabilizing places and 508 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 564 transition count 508
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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-50-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-06 finished in 6223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1067 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1066 transition count 1010
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 1060 transition count 1004
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 1060 transition count 1004
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 1058 transition count 1002
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 1058 transition count 1002
Applied a total of 17 rules in 132 ms. Remains 1058 /1067 variables (removed 9) and now considering 1002/1010 (removed 8) transitions.
// Phase 1: matrix 1002 rows 1058 cols
[2024-05-25 16:51:38] [INFO ] Computed 56 invariants in 14 ms
[2024-05-25 16:51:39] [INFO ] Implicit Places using invariants in 977 ms returned []
[2024-05-25 16:51:39] [INFO ] Invariant cache hit.
[2024-05-25 16:51:44] [INFO ] Implicit Places using invariants and state equation in 4854 ms returned []
Implicit Place search using SMT with State Equation took 5833 ms to find 0 implicit places.
[2024-05-25 16:51:44] [INFO ] Invariant cache hit.
[2024-05-25 16:51:45] [INFO ] Dead Transitions using invariants and state equation in 1312 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1058/1067 places, 1002/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7280 ms. Remains : 1058/1067 places, 1002/1010 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-07 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 s565 s683)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 160 reset in 531 ms.
Product exploration explored 100000 steps with 160 reset in 639 ms.
Computed a total of 1058 stabilizing places and 1002 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1058 transition count 1002
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)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 627 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=125 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-25 16:51:47] [INFO ] Invariant cache hit.
[2024-05-25 16:51:48] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 313 ms returned sat
[2024-05-25 16:51:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:51:54] [INFO ] [Real]Absence check using state equation in 5773 ms returned sat
[2024-05-25 16:51:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:51:56] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 412 ms returned sat
[2024-05-25 16:51:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:51:57] [INFO ] [Nat]Absence check using state equation in 1360 ms returned sat
[2024-05-25 16:51:57] [INFO ] Computed and/alt/rep : 496/826/496 causal constraints (skipped 456 transitions) in 197 ms.
[2024-05-25 16:52:03] [INFO ] Added : 313 causal constraints over 63 iterations in 6251 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 1058 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1058/1058 places, 1002/1002 transitions.
Reduce places removed 50 places and 50 transitions.
Drop transitions removed 445 transitions
Trivial Post-agglo rules discarded 445 transitions
Performed 445 trivial Post agglomeration. Transition count delta: 445
Iterating post reduction 0 with 445 rules applied. Total rules applied 445 place count 1008 transition count 507
Reduce places removed 445 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 446 rules applied. Total rules applied 891 place count 563 transition count 506
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 892 place count 562 transition count 506
Applied a total of 892 rules in 50 ms. Remains 562 /1058 variables (removed 496) and now considering 506/1002 (removed 496) transitions.
// Phase 1: matrix 506 rows 562 cols
[2024-05-25 16:52:03] [INFO ] Computed 56 invariants in 3 ms
[2024-05-25 16:52:04] [INFO ] Implicit Places using invariants in 819 ms returned []
[2024-05-25 16:52:04] [INFO ] Invariant cache hit.
[2024-05-25 16:52:07] [INFO ] Implicit Places using invariants and state equation in 2926 ms returned []
Implicit Place search using SMT with State Equation took 3769 ms to find 0 implicit places.
[2024-05-25 16:52:07] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-25 16:52:07] [INFO ] Invariant cache hit.
[2024-05-25 16:52:08] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 562/1058 places, 506/1002 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4521 ms. Remains : 562/1058 places, 506/1002 transitions.
Computed a total of 562 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 562 transition count 506
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)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
Finished random walk after 308 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=102 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-25 16:52:09] [INFO ] Invariant cache hit.
[2024-05-25 16:52:10] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 230 ms returned sat
[2024-05-25 16:52:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:52:16] [INFO ] [Real]Absence check using state equation in 5886 ms returned sat
[2024-05-25 16:52:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:52:17] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 389 ms returned sat
[2024-05-25 16:52:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:52:17] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2024-05-25 16:52:17] [INFO ] Computed and/alt/rep : 407/414/407 causal constraints (skipped 0 transitions) in 40 ms.
[2024-05-25 16:52:19] [INFO ] Added : 198 causal constraints over 40 iterations in 1587 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 2019 steps with 5 reset in 10 ms.
FORMULA HirschbergSinclair-PT-50-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-07 finished in 40813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 1067 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Graph (complete) has 2026 edges and 1067 vertex of which 1066 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 50 places and 50 transitions.
Drop transitions removed 441 transitions
Trivial Post-agglo rules discarded 441 transitions
Performed 441 trivial Post agglomeration. Transition count delta: 441
Iterating post reduction 0 with 441 rules applied. Total rules applied 442 place count 1016 transition count 519
Reduce places removed 441 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 443 rules applied. Total rules applied 885 place count 575 transition count 517
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 887 place count 573 transition count 517
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 892 place count 568 transition count 512
Iterating global reduction 3 with 5 rules applied. Total rules applied 897 place count 568 transition count 512
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 901 place count 568 transition count 508
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 905 place count 564 transition count 508
Applied a total of 905 rules in 81 ms. Remains 564 /1067 variables (removed 503) and now considering 508/1010 (removed 502) transitions.
// Phase 1: matrix 508 rows 564 cols
[2024-05-25 16:52:19] [INFO ] Computed 56 invariants in 3 ms
[2024-05-25 16:52:20] [INFO ] Implicit Places using invariants in 822 ms returned []
[2024-05-25 16:52:20] [INFO ] Invariant cache hit.
[2024-05-25 16:52:23] [INFO ] Implicit Places using invariants and state equation in 2835 ms returned []
Implicit Place search using SMT with State Equation took 3691 ms to find 0 implicit places.
[2024-05-25 16:52:23] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-25 16:52:23] [INFO ] Invariant cache hit.
[2024-05-25 16:52:23] [INFO ] Dead Transitions using invariants and state equation in 676 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 564/1067 places, 508/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4478 ms. Remains : 564/1067 places, 508/1010 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-09 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 s162 s106), p0:(LEQ 1 s311)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 258 reset in 501 ms.
Product exploration explored 100000 steps with 250 reset in 542 ms.
Computed a total of 564 stabilizing places and 508 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 564 transition count 508
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 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (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 7 factoid took 195 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 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 182 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=36 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (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 (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 297 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 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 564 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 564/564 places, 508/508 transitions.
Applied a total of 0 rules in 20 ms. Remains 564 /564 variables (removed 0) and now considering 508/508 (removed 0) transitions.
[2024-05-25 16:52:26] [INFO ] Invariant cache hit.
[2024-05-25 16:52:27] [INFO ] Implicit Places using invariants in 946 ms returned []
[2024-05-25 16:52:27] [INFO ] Invariant cache hit.
[2024-05-25 16:52:29] [INFO ] Implicit Places using invariants and state equation in 2830 ms returned []
Implicit Place search using SMT with State Equation took 3815 ms to find 0 implicit places.
[2024-05-25 16:52:29] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-25 16:52:29] [INFO ] Invariant cache hit.
[2024-05-25 16:52:30] [INFO ] Dead Transitions using invariants and state equation in 675 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4531 ms. Remains : 564/564 places, 508/508 transitions.
Computed a total of 564 stabilizing places and 508 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 564 transition count 508
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 (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 183 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 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 177 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=44 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 291 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 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 244 reset in 438 ms.
Product exploration explored 100000 steps with 253 reset in 504 ms.
Built C files in :
/tmp/ltsmin5155732480141647745
[2024-05-25 16:52:32] [INFO ] Computing symmetric may disable matrix : 508 transitions.
[2024-05-25 16:52:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:52:32] [INFO ] Computing symmetric may enable matrix : 508 transitions.
[2024-05-25 16:52:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:52:32] [INFO ] Computing Do-Not-Accords matrix : 508 transitions.
[2024-05-25 16:52:32] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:52:32] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5155732480141647745
Running compilation step : cd /tmp/ltsmin5155732480141647745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1810 ms.
Running link step : cd /tmp/ltsmin5155732480141647745;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5155732480141647745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8411833712281612040.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 564 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 564/564 places, 508/508 transitions.
Applied a total of 0 rules in 21 ms. Remains 564 /564 variables (removed 0) and now considering 508/508 (removed 0) transitions.
[2024-05-25 16:52:47] [INFO ] Invariant cache hit.
[2024-05-25 16:52:48] [INFO ] Implicit Places using invariants in 957 ms returned []
[2024-05-25 16:52:48] [INFO ] Invariant cache hit.
[2024-05-25 16:52:51] [INFO ] Implicit Places using invariants and state equation in 3009 ms returned []
Implicit Place search using SMT with State Equation took 3971 ms to find 0 implicit places.
[2024-05-25 16:52:51] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-25 16:52:51] [INFO ] Invariant cache hit.
[2024-05-25 16:52:52] [INFO ] Dead Transitions using invariants and state equation in 768 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4773 ms. Remains : 564/564 places, 508/508 transitions.
Built C files in :
/tmp/ltsmin8437107357566495540
[2024-05-25 16:52:52] [INFO ] Computing symmetric may disable matrix : 508 transitions.
[2024-05-25 16:52:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:52:52] [INFO ] Computing symmetric may enable matrix : 508 transitions.
[2024-05-25 16:52:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:52:52] [INFO ] Computing Do-Not-Accords matrix : 508 transitions.
[2024-05-25 16:52:52] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:52:52] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8437107357566495540
Running compilation step : cd /tmp/ltsmin8437107357566495540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1811 ms.
Running link step : cd /tmp/ltsmin8437107357566495540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8437107357566495540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5331323634543437803.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 16:53:07] [INFO ] Flatten gal took : 17 ms
[2024-05-25 16:53:07] [INFO ] Flatten gal took : 16 ms
[2024-05-25 16:53:07] [INFO ] Time to serialize gal into /tmp/LTL9041015650785739439.gal : 4 ms
[2024-05-25 16:53:07] [INFO ] Time to serialize properties into /tmp/LTL566339482716549071.prop : 0 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9041015650785739439.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5344352824311468372.hoa' '-atoms' '/tmp/LTL566339482716549071.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL566339482716549071.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5344352824311468372.hoa
Detected timeout of ITS tools.
[2024-05-25 16:53:22] [INFO ] Flatten gal took : 18 ms
[2024-05-25 16:53:22] [INFO ] Flatten gal took : 17 ms
[2024-05-25 16:53:22] [INFO ] Time to serialize gal into /tmp/LTL631968318403141128.gal : 5 ms
[2024-05-25 16:53:22] [INFO ] Time to serialize properties into /tmp/LTL1140908629773528865.ltl : 1 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL631968318403141128.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1140908629773528865.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(F(("(election_50_5_27_to_left_24>=1)")||(G("(election_50_1_2_to_right_1<=rcv_left_reply_28_0_28)"))))))
Formula 0 simplified : G(F!"(election_50_1_2_to_right_1<=rcv_left_reply_28_0_28)" & FG!"(election_50_5_27_to_left_24>=1)")
Detected timeout of ITS tools.
[2024-05-25 16:53:37] [INFO ] Flatten gal took : 15 ms
[2024-05-25 16:53:37] [INFO ] Applying decomposition
[2024-05-25 16:53:37] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1100119451680554161.txt' '-o' '/tmp/graph1100119451680554161.bin' '-w' '/tmp/graph1100119451680554161.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1100119451680554161.bin' '-l' '-1' '-v' '-w' '/tmp/graph1100119451680554161.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:53:37] [INFO ] Decomposing Gal with order
[2024-05-25 16:53:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:53:37] [INFO ] Removed a total of 349 redundant transitions.
[2024-05-25 16:53:37] [INFO ] Flatten gal took : 40 ms
[2024-05-25 16:53:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 13 ms.
[2024-05-25 16:53:38] [INFO ] Time to serialize gal into /tmp/LTL13862133060801135518.gal : 8 ms
[2024-05-25 16:53:38] [INFO ] Time to serialize properties into /tmp/LTL8078801914833113661.ltl : 0 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13862133060801135518.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8078801914833113661.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("(gi3.gi1.gi2.gi1.gu124.election_50_5_27_to_left_24>=1)")||(G("(gu57.election_50_1_2_to_right_1<=gu57.rcv_left_reply_28_0_28)"...161
Formula 0 simplified : G(F!"(gu57.election_50_1_2_to_right_1<=gu57.rcv_left_reply_28_0_28)" & FG!"(gi3.gi1.gi2.gi1.gu124.election_50_5_27_to_left_24>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10499400152873839254
[2024-05-25 16:53:53] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10499400152873839254
Running compilation step : cd /tmp/ltsmin10499400152873839254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1297 ms.
Running link step : cd /tmp/ltsmin10499400152873839254;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10499400152873839254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-09 finished in 108938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&((p1 U X(p2))||G(F(p3)))))))'
Support contains 7 out of 1067 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1066 transition count 1010
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 1060 transition count 1004
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 1060 transition count 1004
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 1058 transition count 1002
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 1058 transition count 1002
Applied a total of 17 rules in 159 ms. Remains 1058 /1067 variables (removed 9) and now considering 1002/1010 (removed 8) transitions.
// Phase 1: matrix 1002 rows 1058 cols
[2024-05-25 16:54:08] [INFO ] Computed 56 invariants in 8 ms
[2024-05-25 16:54:09] [INFO ] Implicit Places using invariants in 1035 ms returned []
[2024-05-25 16:54:09] [INFO ] Invariant cache hit.
[2024-05-25 16:54:14] [INFO ] Implicit Places using invariants and state equation in 4748 ms returned []
Implicit Place search using SMT with State Equation took 5786 ms to find 0 implicit places.
[2024-05-25 16:54:14] [INFO ] Invariant cache hit.
[2024-05-25 16:54:15] [INFO ] Dead Transitions using invariants and state equation in 1308 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1058/1067 places, 1002/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7256 ms. Remains : 1058/1067 places, 1002/1010 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), true, (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(NOT p2), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p3), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 1 s546), p1:(LEQ s972 s447), p3:(GT s341 s558), p2:(LEQ s616 s556)], 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, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-50-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-10 finished in 7624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X(F(!p0))))))'
Support contains 2 out of 1067 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1066 transition count 1010
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 1060 transition count 1004
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 1060 transition count 1004
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 1058 transition count 1002
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 1058 transition count 1002
Applied a total of 17 rules in 171 ms. Remains 1058 /1067 variables (removed 9) and now considering 1002/1010 (removed 8) transitions.
[2024-05-25 16:54:15] [INFO ] Invariant cache hit.
[2024-05-25 16:54:17] [INFO ] Implicit Places using invariants in 1109 ms returned []
[2024-05-25 16:54:17] [INFO ] Invariant cache hit.
[2024-05-25 16:54:21] [INFO ] Implicit Places using invariants and state equation in 4523 ms returned []
Implicit Place search using SMT with State Equation took 5646 ms to find 0 implicit places.
[2024-05-25 16:54:21] [INFO ] Invariant cache hit.
[2024-05-25 16:54:22] [INFO ] Dead Transitions using invariants and state equation in 1050 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1058/1067 places, 1002/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6885 ms. Remains : 1058/1067 places, 1002/1010 transitions.
Stuttering acceptance computed with spot in 185 ms :[p0, false, false, p0, false]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=2, aps=[p0:(LEQ s264 s598)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 32907 reset in 1015 ms.
Product exploration explored 100000 steps with 32899 reset in 1077 ms.
Computed a total of 1058 stabilizing places and 1002 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1058 transition count 1002
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 : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[p0, false, false, false, p0]
Finished random walk after 49 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 249 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[p0, false, false, false, p0]
Stuttering acceptance computed with spot in 213 ms :[p0, false, false, false, p0]
Support contains 2 out of 1058 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1058/1058 places, 1002/1002 transitions.
Applied a total of 0 rules in 50 ms. Remains 1058 /1058 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
[2024-05-25 16:54:26] [INFO ] Invariant cache hit.
[2024-05-25 16:54:27] [INFO ] Implicit Places using invariants in 825 ms returned []
[2024-05-25 16:54:27] [INFO ] Invariant cache hit.
[2024-05-25 16:54:32] [INFO ] Implicit Places using invariants and state equation in 4671 ms returned []
Implicit Place search using SMT with State Equation took 5520 ms to find 0 implicit places.
[2024-05-25 16:54:32] [INFO ] Invariant cache hit.
[2024-05-25 16:54:33] [INFO ] Dead Transitions using invariants and state equation in 1050 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6633 ms. Remains : 1058/1058 places, 1002/1002 transitions.
Computed a total of 1058 stabilizing places and 1002 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1058 transition count 1002
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 : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[p0, false, false, false, p0]
Finished random walk after 36 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 212 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[p0, false, false, false, p0]
Stuttering acceptance computed with spot in 179 ms :[p0, false, false, false, p0]
Stuttering acceptance computed with spot in 182 ms :[p0, false, false, false, p0]
Product exploration explored 100000 steps with 32885 reset in 1008 ms.
Stuttering criterion allowed to conclude after 97894 steps with 31835 reset in 1035 ms.
FORMULA HirschbergSinclair-PT-50-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-13 finished in 21145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X((p1&&G((p0||X(X(p0))))))))))'
Support contains 3 out of 1067 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1066 transition count 1010
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 1060 transition count 1004
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 1060 transition count 1004
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 1058 transition count 1002
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 1058 transition count 1002
Applied a total of 17 rules in 126 ms. Remains 1058 /1067 variables (removed 9) and now considering 1002/1010 (removed 8) transitions.
[2024-05-25 16:54:37] [INFO ] Invariant cache hit.
[2024-05-25 16:54:37] [INFO ] Implicit Places using invariants in 831 ms returned []
[2024-05-25 16:54:37] [INFO ] Invariant cache hit.
[2024-05-25 16:54:42] [INFO ] Implicit Places using invariants and state equation in 4648 ms returned []
Implicit Place search using SMT with State Equation took 5493 ms to find 0 implicit places.
[2024-05-25 16:54:42] [INFO ] Invariant cache hit.
[2024-05-25 16:54:43] [INFO ] Dead Transitions using invariants and state equation in 1056 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1058/1067 places, 1002/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6679 ms. Remains : 1058/1067 places, 1002/1010 transitions.
Stuttering acceptance computed with spot in 664 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=(AND p0 p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 8}, { cond=p0, acceptance={0} source=4 dest: 9}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 9}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 10}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 11}, { cond=(AND p0 p1), acceptance={} source=7 dest: 12}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=9 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=10 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=11 dest: 4}, { cond=(NOT p0), acceptance={} source=11 dest: 5}], [{ cond=(NOT p0), acceptance={} source=12 dest: 5}, { cond=(NOT p0), acceptance={0} source=12 dest: 7}]], initial=0, aps=[p0:(LEQ 1 s813), p1:(LEQ s1038 s696)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1092 steps with 0 reset in 5 ms.
FORMULA HirschbergSinclair-PT-50-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-14 finished in 7392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0) U p1))||X(G(p2))))'
Support contains 6 out of 1067 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1066 transition count 1010
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 1061 transition count 1005
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 1061 transition count 1005
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 1059 transition count 1003
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 1059 transition count 1003
Applied a total of 15 rules in 157 ms. Remains 1059 /1067 variables (removed 8) and now considering 1003/1010 (removed 7) transitions.
// Phase 1: matrix 1003 rows 1059 cols
[2024-05-25 16:54:44] [INFO ] Computed 56 invariants in 7 ms
[2024-05-25 16:54:45] [INFO ] Implicit Places using invariants in 956 ms returned []
[2024-05-25 16:54:45] [INFO ] Invariant cache hit.
[2024-05-25 16:54:49] [INFO ] Implicit Places using invariants and state equation in 4513 ms returned []
Implicit Place search using SMT with State Equation took 5486 ms to find 0 implicit places.
[2024-05-25 16:54:50] [INFO ] Invariant cache hit.
[2024-05-25 16:54:51] [INFO ] Dead Transitions using invariants and state equation in 1031 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1059/1067 places, 1003/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6675 ms. Remains : 1059/1067 places, 1003/1010 transitions.
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LEQ 1 s294) (LEQ 1 s649)), p0:(LEQ s990 s628), p2:(GT s996 s705)], 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]]
Product exploration explored 100000 steps with 528 reset in 852 ms.
Product exploration explored 100000 steps with 528 reset in 919 ms.
Computed a total of 1059 stabilizing places and 1003 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1059 transition count 1003
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 (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 1653 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1)]
Finished random walk after 82 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 20 factoid took 2133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
[2024-05-25 16:54:57] [INFO ] Invariant cache hit.
[2024-05-25 16:54:58] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 299 ms returned sat
[2024-05-25 16:54:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:55:06] [INFO ] [Real]Absence check using state equation in 7294 ms returned sat
[2024-05-25 16:55:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:55:07] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 424 ms returned sat
[2024-05-25 16:55:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:55:21] [INFO ] [Nat]Absence check using state equation in 13568 ms returned unknown
Could not prove EG (NOT p1)
Support contains 2 out of 1059 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1059/1059 places, 1003/1003 transitions.
Reduce places removed 50 places and 50 transitions.
Drop transitions removed 440 transitions
Trivial Post-agglo rules discarded 440 transitions
Performed 440 trivial Post agglomeration. Transition count delta: 440
Iterating post reduction 0 with 440 rules applied. Total rules applied 440 place count 1009 transition count 513
Reduce places removed 440 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 441 rules applied. Total rules applied 881 place count 569 transition count 512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 882 place count 568 transition count 512
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 884 place count 567 transition count 511
Applied a total of 884 rules in 61 ms. Remains 567 /1059 variables (removed 492) and now considering 511/1003 (removed 492) transitions.
// Phase 1: matrix 511 rows 567 cols
[2024-05-25 16:55:21] [INFO ] Computed 56 invariants in 3 ms
[2024-05-25 16:55:22] [INFO ] Implicit Places using invariants in 800 ms returned []
[2024-05-25 16:55:22] [INFO ] Invariant cache hit.
[2024-05-25 16:55:25] [INFO ] Implicit Places using invariants and state equation in 2786 ms returned []
Implicit Place search using SMT with State Equation took 3588 ms to find 0 implicit places.
[2024-05-25 16:55:25] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-25 16:55:25] [INFO ] Invariant cache hit.
[2024-05-25 16:55:25] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 567/1059 places, 511/1003 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4327 ms. Remains : 567/1059 places, 511/1003 transitions.
Computed a total of 567 stabilizing places and 511 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 567 transition count 511
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 p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Finished random walk after 80 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
[2024-05-25 16:55:26] [INFO ] Invariant cache hit.
[2024-05-25 16:55:27] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 252 ms returned sat
[2024-05-25 16:55:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:55:36] [INFO ] [Real]Absence check using state equation in 9288 ms returned sat
[2024-05-25 16:55:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:55:37] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 233 ms returned sat
[2024-05-25 16:55:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:55:39] [INFO ] [Nat]Absence check using state equation in 1836 ms returned sat
[2024-05-25 16:55:39] [INFO ] Computed and/alt/rep : 412/419/412 causal constraints (skipped 0 transitions) in 33 ms.
[2024-05-25 16:55:42] [INFO ] Added : 241 causal constraints over 49 iterations in 2698 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1026 reset in 950 ms.
Product exploration explored 100000 steps with 1025 reset in 1030 ms.
Built C files in :
/tmp/ltsmin7114197347855921087
[2024-05-25 16:55:44] [INFO ] Computing symmetric may disable matrix : 511 transitions.
[2024-05-25 16:55:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:55:44] [INFO ] Computing symmetric may enable matrix : 511 transitions.
[2024-05-25 16:55:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:55:44] [INFO ] Computing Do-Not-Accords matrix : 511 transitions.
[2024-05-25 16:55:44] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:55:44] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7114197347855921087
Running compilation step : cd /tmp/ltsmin7114197347855921087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1791 ms.
Running link step : cd /tmp/ltsmin7114197347855921087;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7114197347855921087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4255986743938267348.hoa' '--buchi-type=spotba'
LTSmin run took 11537 ms.
FORMULA HirschbergSinclair-PT-50-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-15 finished in 73280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&G((p1&&(p1 U X(p2))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
[2024-05-25 16:55:58] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13168523265616014373
[2024-05-25 16:55:58] [INFO ] Computing symmetric may disable matrix : 1010 transitions.
[2024-05-25 16:55:58] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:55:58] [INFO ] Computing symmetric may enable matrix : 1010 transitions.
[2024-05-25 16:55:58] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:55:58] [INFO ] Applying decomposition
[2024-05-25 16:55:58] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10507086962035223539.txt' '-o' '/tmp/graph10507086962035223539.bin' '-w' '/tmp/graph10507086962035223539.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10507086962035223539.bin' '-l' '-1' '-v' '-w' '/tmp/graph10507086962035223539.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:55:58] [INFO ] Decomposing Gal with order
[2024-05-25 16:55:58] [INFO ] Computing Do-Not-Accords matrix : 1010 transitions.
[2024-05-25 16:55:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:55:58] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:55:58] [INFO ] Built C files in 199ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13168523265616014373
Running compilation step : cd /tmp/ltsmin13168523265616014373;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 16:55:58] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-25 16:55:58] [INFO ] Flatten gal took : 111 ms
[2024-05-25 16:55:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-25 16:55:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality13894115594993645051.gal : 13 ms
[2024-05-25 16:55:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality7496383941704187431.ltl : 1 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13894115594993645051.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7496383941704187431.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((F(G("(gu7.newmsg46<=gu7.init10)"))))
Formula 0 simplified : GF!"(gu7.newmsg46<=gu7.init10)"
Compilation finished in 4860 ms.
Running link step : cd /tmp/ltsmin13168523265616014373;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin13168523265616014373;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin13168523265616014373;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13168523265616014373;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>((LTLAPp1==true)))||(<>((LTLAPp1==true))&&[](((LTLAPp2==true)&&((LTLAPp2==true) U X((LTLAPp3==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 17:19:07] [INFO ] Flatten gal took : 62 ms
[2024-05-25 17:19:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality5639468327581972375.gal : 23 ms
[2024-05-25 17:19:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality1383463065279823971.ltl : 1 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5639468327581972375.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1383463065279823971.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 3 LTL properties
Checking formula 0 : !((F(G("(newmsg46<=init10)"))))
Formula 0 simplified : GF!"(newmsg46<=init10)"
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin13168523265616014373;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>((LTLAPp1==true)))||(<>((LTLAPp1==true))&&[](((LTLAPp2==true)&&((LTLAPp2==true) U X((LTLAPp3==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13168523265616014373;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp4==true)||[]((LTLAPp5==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 17:42:17] [INFO ] Flatten gal took : 115 ms
[2024-05-25 17:42:17] [INFO ] Input system was already deterministic with 1010 transitions.
[2024-05-25 17:42:17] [INFO ] Transformed 1067 places.
[2024-05-25 17:42:17] [INFO ] Transformed 1010 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 17:42:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality15539305433806176614.gal : 6 ms
[2024-05-25 17:42:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality15260057323171176090.ltl : 1 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15539305433806176614.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15260057323171176090.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(newmsg46<=init10)"))))
Formula 0 simplified : GF!"(newmsg46<=init10)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12200568 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16036268 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="HirschbergSinclair-PT-50"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is HirschbergSinclair-PT-50, 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 r219-smll-171649597900082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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