Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r165-tall-167838850400427.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is FamilyReunion-PT-L00200M0020C010P010G005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850400427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 152M
-rw-r--r-- 1 mcc users 1.4M Feb 26 17:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 7.4M Feb 26 17:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7M Feb 26 15:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 13M Feb 26 15:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 608K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1018K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.8M Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9M Feb 26 21:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17M Feb 26 21:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0M Feb 26 20:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32M Feb 26 20:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 126K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 367K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 62M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679491716615

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00200M0020C010P010G005
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-22 13:28:38] [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]
[2023-03-22 13:28:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:28:40] [INFO ] Load time of PNML (sax parser for PT used): 1952 ms
[2023-03-22 13:28:40] [INFO ] Transformed 143908 places.
[2023-03-22 13:28:40] [INFO ] Transformed 134279 transitions.
[2023-03-22 13:28:40] [INFO ] Parsed PT model containing 143908 places and 134279 transitions and 411469 arcs in 2617 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 60041 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Reduce places removed 56 places and 0 transitions.
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19914 out of 143852 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143852/143852 places, 134279/134279 transitions.
Reduce places removed 674 places and 0 transitions.
Discarding 25325 places :
Implicit places reduction removed 25325 places
Iterating post reduction 0 with 25999 rules applied. Total rules applied 25999 place count 117853 transition count 134279
Applied a total of 25999 rules in 8349 ms. Remains 117853 /143852 variables (removed 25999) and now considering 134279/134279 (removed 0) transitions.
// Phase 1: matrix 134279 rows 117853 cols
[2023-03-22 13:30:23] [INFO ] Computed 4830 place invariants in 31881 ms
[2023-03-22 13:30:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:30:32] [INFO ] Implicit Places using invariants in 41651 ms returned []
Implicit Place search using SMT only with invariants took 41679 ms to find 0 implicit places.
[2023-03-22 13:30:32] [INFO ] Invariant cache hit.
[2023-03-22 13:30:41] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:30:41] [INFO ] Dead Transitions using invariants and state equation in 8713 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117853/143852 places, 134279/134279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58760 ms. Remains : 117853/143852 places, 134279/134279 transitions.
Support contains 19914 out of 117853 places after structural reductions.
[2023-03-22 13:30:46] [INFO ] Flatten gal took : 3506 ms
[2023-03-22 13:30:49] [INFO ] Flatten gal took : 2908 ms
[2023-03-22 13:30:56] [INFO ] Input system was already deterministic with 134279 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2683 ms. (steps per millisecond=3 ) properties (out of 22) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=13 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-22 13:31:01] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:611)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 13:31:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 13:31:26] [INFO ] After 25050ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10867 out of 117853 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Graph (complete) has 172862 edges and 117853 vertex of which 116636 are kept as prefixes of interest. Removing 1217 places using SCC suffix rule.171 ms
Discarding 1217 places :
Also discarding 1016 output transitions
Drop transitions removed 1016 transitions
Ensure Unique test removed 1206 transitions
Reduce isomorphic transitions removed 1206 transitions.
Drop transitions removed 65915 transitions
Trivial Post-agglo rules discarded 65915 transitions
Performed 65915 trivial Post agglomeration. Transition count delta: 65915
Iterating post reduction 0 with 67121 rules applied. Total rules applied 67122 place count 116636 transition count 66142
Reduce places removed 65915 places and 0 transitions.
Performed 1607 Post agglomeration using F-continuation condition.Transition count delta: 1607
Iterating post reduction 1 with 67522 rules applied. Total rules applied 134644 place count 50721 transition count 64535
Reduce places removed 1607 places and 0 transitions.
Iterating post reduction 2 with 1607 rules applied. Total rules applied 136251 place count 49114 transition count 64535
Performed 3217 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3217 Pre rules applied. Total rules applied 136251 place count 49114 transition count 61318
Deduced a syphon composed of 3217 places in 68 ms
Ensure Unique test removed 403 places
Reduce places removed 3620 places and 0 transitions.
Iterating global reduction 3 with 6837 rules applied. Total rules applied 143088 place count 45494 transition count 61318
Discarding 2412 places :
Implicit places reduction removed 2412 places
Performed 2211 Post agglomeration using F-continuation condition.Transition count delta: 2211
Iterating post reduction 3 with 4623 rules applied. Total rules applied 147711 place count 43082 transition count 59107
Reduce places removed 2211 places and 0 transitions.
Iterating post reduction 4 with 2211 rules applied. Total rules applied 149922 place count 40871 transition count 59107
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 200 Pre rules applied. Total rules applied 149922 place count 40871 transition count 58907
Deduced a syphon composed of 200 places in 59 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 5 with 400 rules applied. Total rules applied 150322 place count 40671 transition count 58907
Performed 5627 Post agglomeration using F-continuation condition.Transition count delta: 5627
Deduced a syphon composed of 5627 places in 34 ms
Reduce places removed 5627 places and 0 transitions.
Iterating global reduction 5 with 11254 rules applied. Total rules applied 161576 place count 35044 transition count 53280
Free-agglomeration rule (complex) applied 4625 times.
Iterating global reduction 5 with 4625 rules applied. Total rules applied 166201 place count 35044 transition count 53655
Ensure Unique test removed 401 places
Reduce places removed 5026 places and 0 transitions.
Iterating post reduction 5 with 5026 rules applied. Total rules applied 171227 place count 30018 transition count 53655
Discarding 1019 places :
Symmetric choice reduction at 6 with 1019 rule applications. Total rules 172246 place count 28999 transition count 43836
Iterating global reduction 6 with 1019 rules applied. Total rules applied 173265 place count 28999 transition count 43836
Applied a total of 173265 rules in 41215 ms. Remains 28999 /117853 variables (removed 88854) and now considering 43836/134279 (removed 90443) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41217 ms. Remains : 28999/117853 places, 43836/134279 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1307 ms. (steps per millisecond=7 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 742 ms. (steps per millisecond=13 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 43836 rows 28999 cols
[2023-03-22 13:32:13] [INFO ] Computed 1413 place invariants in 3378 ms
[2023-03-22 13:32:19] [INFO ] After 6637ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 13:32:29] [INFO ] [Nat]Absence check using 0 positive and 1413 generalized place invariants in 3293 ms returned sat
[2023-03-22 13:32:44] [INFO ] After 12255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 13:32:44] [INFO ] After 12307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-22 13:32:44] [INFO ] After 25091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4833 out of 28999 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28999/28999 places, 43836/43836 transitions.
Graph (complete) has 71395 edges and 28999 vertex of which 27385 are kept as prefixes of interest. Removing 1614 places using SCC suffix rule.16 ms
Discarding 1614 places :
Also discarding 2205 output transitions
Drop transitions removed 2205 transitions
Drop transitions removed 1209 transitions
Reduce isomorphic transitions removed 1209 transitions.
Drop transitions removed 2403 transitions
Trivial Post-agglo rules discarded 2403 transitions
Performed 2403 trivial Post agglomeration. Transition count delta: 2403
Iterating post reduction 0 with 3612 rules applied. Total rules applied 3613 place count 27385 transition count 38019
Reduce places removed 2403 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 2414 rules applied. Total rules applied 6027 place count 24982 transition count 38008
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 6038 place count 24971 transition count 38008
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6038 place count 24971 transition count 38007
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6040 place count 24970 transition count 38007
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: 201
Deduced a syphon composed of 201 places in 16 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 6442 place count 24769 transition count 37806
Free-agglomeration rule (complex) applied 4624 times.
Iterating global reduction 3 with 4624 rules applied. Total rules applied 11066 place count 24769 transition count 33242
Ensure Unique test removed 401 places
Reduce places removed 5025 places and 0 transitions.
Iterating post reduction 3 with 5025 rules applied. Total rules applied 16091 place count 19744 transition count 33242
Discarding 220 places :
Symmetric choice reduction at 4 with 220 rule applications. Total rules 16311 place count 19524 transition count 28962
Iterating global reduction 4 with 220 rules applied. Total rules applied 16531 place count 19524 transition count 28962
Free-agglomeration rule (complex) applied 202 times.
Iterating global reduction 4 with 202 rules applied. Total rules applied 16733 place count 19524 transition count 28760
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 4 with 202 rules applied. Total rules applied 16935 place count 19322 transition count 28760
Partial Free-agglomeration rule applied 2182 times.
Drop transitions removed 2182 transitions
Iterating global reduction 5 with 2182 rules applied. Total rules applied 19117 place count 19322 transition count 28760
Applied a total of 19117 rules in 7180 ms. Remains 19322 /28999 variables (removed 9677) and now considering 28760/43836 (removed 15076) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7180 ms. Remains : 19322/28999 places, 28760/43836 transitions.
Computed a total of 117853 stabilizing places and 134279 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 117853 transition count 134279
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 402 out of 117853 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Graph (complete) has 172862 edges and 117853 vertex of which 112409 are kept as prefixes of interest. Removing 5444 places using SCC suffix rule.214 ms
Discarding 5444 places :
Also discarding 7247 output transitions
Drop transitions removed 7247 transitions
Reduce places removed 201 places and 201 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 70752 transitions
Trivial Post-agglo rules discarded 70752 transitions
Performed 70752 trivial Post agglomeration. Transition count delta: 70752
Iterating post reduction 0 with 70753 rules applied. Total rules applied 70754 place count 112207 transition count 56079
Reduce places removed 70752 places and 0 transitions.
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: 201
Iterating post reduction 1 with 70953 rules applied. Total rules applied 141707 place count 41455 transition count 55878
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 2 with 201 rules applied. Total rules applied 141908 place count 41254 transition count 55878
Performed 5427 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5427 Pre rules applied. Total rules applied 141908 place count 41254 transition count 50451
Deduced a syphon composed of 5427 places in 32 ms
Ensure Unique test removed 2613 places
Reduce places removed 8040 places and 0 transitions.
Iterating global reduction 3 with 13467 rules applied. Total rules applied 155375 place count 33214 transition count 50451
Discarding 201 places :
Implicit places reduction removed 201 places
Drop transitions removed 2211 transitions
Trivial Post-agglo rules discarded 2211 transitions
Performed 2211 trivial Post agglomeration. Transition count delta: 2211
Iterating post reduction 3 with 2412 rules applied. Total rules applied 157787 place count 33013 transition count 48240
Reduce places removed 2211 places and 0 transitions.
Iterating post reduction 4 with 2211 rules applied. Total rules applied 159998 place count 30802 transition count 48240
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 201 Pre rules applied. Total rules applied 159998 place count 30802 transition count 48039
Deduced a syphon composed of 201 places in 27 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 5 with 402 rules applied. Total rules applied 160400 place count 30601 transition count 48039
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 160405 place count 30596 transition count 47034
Iterating global reduction 5 with 5 rules applied. Total rules applied 160410 place count 30596 transition count 47034
Performed 5427 Post agglomeration using F-continuation condition.Transition count delta: 5427
Deduced a syphon composed of 5427 places in 30 ms
Reduce places removed 5427 places and 0 transitions.
Iterating global reduction 5 with 10854 rules applied. Total rules applied 171264 place count 25169 transition count 41607
Applied a total of 171264 rules in 17677 ms. Remains 25169 /117853 variables (removed 92684) and now considering 41607/134279 (removed 92672) transitions.
// Phase 1: matrix 41607 rows 25169 cols
[2023-03-22 13:33:13] [INFO ] Computed 1612 place invariants in 2267 ms
[2023-03-22 13:33:15] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:33:15] [INFO ] Implicit Places using invariants in 4408 ms returned []
Implicit Place search using SMT only with invariants took 4416 ms to find 0 implicit places.
[2023-03-22 13:33:15] [INFO ] Invariant cache hit.
[2023-03-22 13:33:17] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:33:17] [INFO ] Dead Transitions using invariants and state equation in 2188 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25169/117853 places, 41607/134279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24288 ms. Remains : 25169/117853 places, 41607/134279 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-01 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:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 ...], 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 120 reset in 9645 ms.
Product exploration explored 100000 steps with 120 reset in 9846 ms.
Computed a total of 25169 stabilizing places and 41607 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25169 transition count 41607
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 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 80 ms :[(NOT p0), (NOT p0)]
Finished random walk after 818 steps, including 0 resets, run visited all 1 properties in 80 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 148 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 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2023-03-22 13:35:11] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 402 out of 25169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25169/25169 places, 41607/41607 transitions.
Applied a total of 0 rules in 1070 ms. Remains 25169 /25169 variables (removed 0) and now considering 41607/41607 (removed 0) transitions.
[2023-03-22 13:35:27] [INFO ] Invariant cache hit.
[2023-03-22 13:35:29] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:35:29] [INFO ] Implicit Places using invariants in 1945 ms returned []
Implicit Place search using SMT only with invariants took 1946 ms to find 0 implicit places.
[2023-03-22 13:35:29] [INFO ] Invariant cache hit.
[2023-03-22 13:35:31] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:35:31] [INFO ] Dead Transitions using invariants and state equation in 2006 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5046 ms. Remains : 25169/25169 places, 41607/41607 transitions.
Computed a total of 25169 stabilizing places and 41607 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25169 transition count 41607
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 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 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 831 steps, including 0 resets, run visited all 1 properties in 80 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 124 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 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2023-03-22 13:36:53] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 116 reset in 9384 ms.
Product exploration explored 100000 steps with 119 reset in 9679 ms.
Built C files in :
/tmp/ltsmin9503308913040731856
[2023-03-22 13:37:27] [INFO ] Too many transitions (41607) to apply POR reductions. Disabling POR matrices.
[2023-03-22 13:37:28] [INFO ] Built C files in 447ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9503308913040731856
Running compilation step : cd /tmp/ltsmin9503308913040731856;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9503308913040731856;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9503308913040731856;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 402 out of 25169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25169/25169 places, 41607/41607 transitions.
Applied a total of 0 rules in 1129 ms. Remains 25169 /25169 variables (removed 0) and now considering 41607/41607 (removed 0) transitions.
[2023-03-22 13:37:32] [INFO ] Invariant cache hit.
[2023-03-22 13:37:34] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:37:34] [INFO ] Implicit Places using invariants in 2018 ms returned []
Implicit Place search using SMT only with invariants took 2030 ms to find 0 implicit places.
[2023-03-22 13:37:34] [INFO ] Invariant cache hit.
[2023-03-22 13:37:36] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:37:36] [INFO ] Dead Transitions using invariants and state equation in 2001 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5179 ms. Remains : 25169/25169 places, 41607/41607 transitions.
Built C files in :
/tmp/ltsmin1687286242918588376
[2023-03-22 13:37:36] [INFO ] Too many transitions (41607) to apply POR reductions. Disabling POR matrices.
[2023-03-22 13:37:36] [INFO ] Built C files in 415ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1687286242918588376
Running compilation step : cd /tmp/ltsmin1687286242918588376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1687286242918588376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1687286242918588376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-22 13:37:43] [INFO ] Flatten gal took : 1121 ms
[2023-03-22 13:37:45] [INFO ] Flatten gal took : 1106 ms
[2023-03-22 13:37:45] [INFO ] Time to serialize gal into /tmp/LTL10954083609111999001.gal : 217 ms
[2023-03-22 13:37:45] [INFO ] Time to serialize properties into /tmp/LTL15716286236346166978.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10954083609111999001.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9602820958246620645.hoa' '-atoms' '/tmp/LTL15716286236346166978.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15716286236346166978.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9602820958246620645.hoa
Detected timeout of ITS tools.
[2023-03-22 13:38:03] [INFO ] Flatten gal took : 1162 ms
[2023-03-22 13:38:04] [INFO ] Flatten gal took : 1129 ms
[2023-03-22 13:38:04] [INFO ] Time to serialize gal into /tmp/LTL6999593135859115579.gal : 159 ms
[2023-03-22 13:38:04] [INFO ] Time to serialize properties into /tmp/LTL13777261141041862622.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6999593135859115579.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13777261141041862622.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((l27_0+l27_1)+(l27_2+l27_3))+((l27_4+l27_5)+(l27_6+l27_7)))+(((l27_8+l27_9)+(l27_10+l27_11))+((l27_12+l27_13)+(l27_14+...3831
Formula 0 simplified : FG!"(((((((((l27_0+l27_1)+(l27_2+l27_3))+((l27_4+l27_5)+(l27_6+l27_7)))+(((l27_8+l27_9)+(l27_10+l27_11))+((l27_12+l27_13)+(l27_14+l2...3825
Detected timeout of ITS tools.
[2023-03-22 13:38:21] [INFO ] Flatten gal took : 1124 ms
[2023-03-22 13:38:21] [INFO ] Applying decomposition
[2023-03-22 13:38:22] [INFO ] Flatten gal took : 1276 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16223559057763284316.txt' '-o' '/tmp/graph16223559057763284316.bin' '-w' '/tmp/graph16223559057763284316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16223559057763284316.bin' '-l' '-1' '-v' '-w' '/tmp/graph16223559057763284316.weights' '-q' '0' '-e' '0.001'
[2023-03-22 13:38:26] [INFO ] Decomposing Gal with order
[2023-03-22 13:38:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 13:39:01] [INFO ] Removed a total of 53769 redundant transitions.
[2023-03-22 13:39:02] [INFO ] Flatten gal took : 4375 ms
[2023-03-22 13:39:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 16349 labels/synchronizations in 1670 ms.
[2023-03-22 13:39:12] [INFO ] Time to serialize gal into /tmp/LTL11054898411769814862.gal : 380 ms
[2023-03-22 13:39:12] [INFO ] Time to serialize properties into /tmp/LTL6453714821465559095.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11054898411769814862.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6453714821465559095.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((gu1768.l27_0+gu1768.l27_1)+(gu1768.l27_2+gu1768.l27_3))+((gu1768.l27_4+gu1768.l27_5)+(gu1768.l27_6+gu1768.l27_7)))+((...6645
Formula 0 simplified : FG!"(((((((((gu1768.l27_0+gu1768.l27_1)+(gu1768.l27_2+gu1768.l27_3))+((gu1768.l27_4+gu1768.l27_5)+(gu1768.l27_6+gu1768.l27_7)))+(((g...6639
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4578528078892640823
[2023-03-22 13:39:27] [INFO ] Built C files in 528ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4578528078892640823
Running compilation step : cd /tmp/ltsmin4578528078892640823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4578528078892640823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4578528078892640823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-01 finished in 397835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(p1))))'
Support contains 1407 out of 117853 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 117852 transition count 134279
Applied a total of 1 rules in 2158 ms. Remains 117852 /117853 variables (removed 1) and now considering 134279/134279 (removed 0) transitions.
// Phase 1: matrix 134279 rows 117852 cols
[2023-03-22 13:39:58] [INFO ] Computed 4829 place invariants in 24906 ms
[2023-03-22 13:40:07] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:40:07] [INFO ] Implicit Places using invariants in 34494 ms returned []
Implicit Place search using SMT only with invariants took 34495 ms to find 0 implicit places.
[2023-03-22 13:40:07] [INFO ] Invariant cache hit.
[2023-03-22 13:40:17] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:40:17] [INFO ] Dead Transitions using invariants and state equation in 9571 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117852/117853 places, 134279/134279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46234 ms. Remains : 117852/117853 places, 134279/134279 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT 2 (ADD s74212 s74214 s74215 s74216 s74217 s74218 s74219 s74220 s74221 s74222 s74223 s74224 s74225 s74226 s74227 s74228 s74229 s74230 s74231 s74232 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9034 steps with 0 reset in 1193 ms.
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-03 finished in 48393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((G((p1||X(G(p1)))) U (p0&&G((p1||X(G(p1))))))))))'
Support contains 8643 out of 117853 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 117852 transition count 134279
Discarding 1005 places :
Symmetric choice reduction at 1 with 1005 rule applications. Total rules 1006 place count 116847 transition count 132269
Iterating global reduction 1 with 1005 rules applied. Total rules applied 2011 place count 116847 transition count 132269
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 2016 place count 116842 transition count 131264
Iterating global reduction 1 with 5 rules applied. Total rules applied 2021 place count 116842 transition count 131264
Applied a total of 2021 rules in 7185 ms. Remains 116842 /117853 variables (removed 1011) and now considering 131264/134279 (removed 3015) transitions.
// Phase 1: matrix 131264 rows 116842 cols
[2023-03-22 13:40:52] [INFO ] Computed 4829 place invariants in 26293 ms
[2023-03-22 13:41:02] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:41:02] [INFO ] Implicit Places using invariants in 36100 ms returned []
Implicit Place search using SMT only with invariants took 36103 ms to find 0 implicit places.
[2023-03-22 13:41:02] [INFO ] Invariant cache hit.
[2023-03-22 13:41:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:41:12] [INFO ] Dead Transitions using invariants and state equation in 9485 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116842/117853 places, 131264/134279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52778 ms. Remains : 116842/117853 places, 131264/134279 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), true]
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 2 (ADD s55688 s55689 s55690 s55691 s55692 s55693 s55694 s55695 s55696 s55697 s55698 s55699 s55700 s55701 s55702 s55703 s55704 s55705 s55706 s55707...], 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]]
Entered a terminal (fully accepting) state of product in 8641 steps with 0 reset in 2553 ms.
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-04 finished in 56152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&G((p1 U p2))) U G(p3)))'
Support contains 5025 out of 117853 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Graph (complete) has 172862 edges and 117853 vertex of which 104553 are kept as prefixes of interest. Removing 13300 places using SCC suffix rule.169 ms
Discarding 13300 places :
Also discarding 17699 output transitions
Drop transitions removed 17699 transitions
Reduce places removed 201 places and 201 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 66129 transitions
Trivial Post-agglo rules discarded 66129 transitions
Performed 66129 trivial Post agglomeration. Transition count delta: 66129
Iterating post reduction 0 with 66130 rules applied. Total rules applied 66131 place count 104351 transition count 50250
Reduce places removed 66129 places and 0 transitions.
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: 201
Iterating post reduction 1 with 66330 rules applied. Total rules applied 132461 place count 38222 transition count 50049
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 2 with 201 rules applied. Total rules applied 132662 place count 38021 transition count 50049
Performed 3417 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3417 Pre rules applied. Total rules applied 132662 place count 38021 transition count 46632
Deduced a syphon composed of 3417 places in 25 ms
Ensure Unique test removed 603 places
Reduce places removed 4020 places and 0 transitions.
Iterating global reduction 3 with 7437 rules applied. Total rules applied 140099 place count 34001 transition count 46632
Discarding 2211 places :
Implicit places reduction removed 2211 places
Performed 2211 Post agglomeration using F-continuation condition.Transition count delta: 2211
Iterating post reduction 3 with 4422 rules applied. Total rules applied 144521 place count 31790 transition count 44421
Reduce places removed 2211 places and 0 transitions.
Iterating post reduction 4 with 2211 rules applied. Total rules applied 146732 place count 29579 transition count 44421
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 201 Pre rules applied. Total rules applied 146732 place count 29579 transition count 44220
Deduced a syphon composed of 201 places in 23 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 5 with 402 rules applied. Total rules applied 147134 place count 29378 transition count 44220
Performed 5025 Post agglomeration using F-continuation condition.Transition count delta: 5025
Deduced a syphon composed of 5025 places in 18 ms
Reduce places removed 5025 places and 0 transitions.
Iterating global reduction 5 with 10050 rules applied. Total rules applied 157184 place count 24353 transition count 39195
Applied a total of 157184 rules in 17600 ms. Remains 24353 /117853 variables (removed 93500) and now considering 39195/134279 (removed 95084) transitions.
// Phase 1: matrix 39195 rows 24353 cols
[2023-03-22 13:41:35] [INFO ] Computed 1208 place invariants in 2028 ms
[2023-03-22 13:41:36] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:41:37] [INFO ] Implicit Places using invariants in 3959 ms returned []
Implicit Place search using SMT only with invariants took 3972 ms to find 0 implicit places.
[2023-03-22 13:41:37] [INFO ] Invariant cache hit.
[2023-03-22 13:41:39] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:41:39] [INFO ] Dead Transitions using invariants and state equation in 2082 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24353/117853 places, 39195/134279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23658 ms. Remains : 24353/117853 places, 39195/134279 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p3)]
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 (NOT p0) p2) (AND p3 (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p3 p0) (AND p3 (NOT p2) (NOT p1))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR p2 p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(OR (LEQ (ADD s11679 s11680 s11681 s11682 s11683 s11684 s11685 s11686 s11687 s11688 s11689 s11690 s11691 s11692 s11693 s11694 s11695 s11696 s11697 s116...], 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]]
Entered a terminal (fully accepting) state of product in 228 steps with 0 reset in 47 ms.
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-05 finished in 24110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1&&X((p1 U (p2||G(p1)))))))))'
Support contains 6633 out of 117853 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 117852 transition count 134279
Discarding 1005 places :
Symmetric choice reduction at 1 with 1005 rule applications. Total rules 1006 place count 116847 transition count 132269
Iterating global reduction 1 with 1005 rules applied. Total rules applied 2011 place count 116847 transition count 132269
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 2016 place count 116842 transition count 131264
Iterating global reduction 1 with 5 rules applied. Total rules applied 2021 place count 116842 transition count 131264
Applied a total of 2021 rules in 5316 ms. Remains 116842 /117853 variables (removed 1011) and now considering 131264/134279 (removed 3015) transitions.
// Phase 1: matrix 131264 rows 116842 cols
[2023-03-22 13:42:13] [INFO ] Computed 4829 place invariants in 28519 ms
[2023-03-22 13:42:22] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:42:22] [INFO ] Implicit Places using invariants in 37467 ms returned []
Implicit Place search using SMT only with invariants took 37468 ms to find 0 implicit places.
[2023-03-22 13:42:22] [INFO ] Invariant cache hit.
[2023-03-22 13:42:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:42:32] [INFO ] Dead Transitions using invariants and state equation in 9698 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116842/117853 places, 131264/134279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52488 ms. Remains : 116842/117853 places, 131264/134279 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 3 (ADD s51467 s51468 s51469 s51470 s51471 s51472 s51473 s51474 s51475 s51476 s51477 s51478 s51479 s51480 s51481 s51482 s51483 s51484 s51485 s51486 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 13930 steps with 4706 reset in 10005 ms.
Product exploration timeout after 13320 steps with 4470 reset in 10007 ms.
Computed a total of 116842 stabilizing places and 131264 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 116842 transition count 131264
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)...)
Could not satisfy deadlock states : solver returned unknown
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 696 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1562 ms. (steps per millisecond=6 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 13:43:24] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2347)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:618)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 13:43:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 13:43:50] [INFO ] After 25046ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2412 out of 116842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116842/116842 places, 131264/131264 transitions.
Graph (complete) has 168840 edges and 116842 vertex of which 109990 are kept as prefixes of interest. Removing 6852 places using SCC suffix rule.59 ms
Discarding 6852 places :
Also discarding 7649 output transitions
Drop transitions removed 7649 transitions
Drop transitions removed 66531 transitions
Trivial Post-agglo rules discarded 66531 transitions
Performed 66531 trivial Post agglomeration. Transition count delta: 66531
Iterating post reduction 0 with 66531 rules applied. Total rules applied 66532 place count 109990 transition count 57084
Reduce places removed 66531 places and 0 transitions.
Performed 4221 Post agglomeration using F-continuation condition.Transition count delta: 4221
Iterating post reduction 1 with 70752 rules applied. Total rules applied 137284 place count 43459 transition count 52863
Reduce places removed 4221 places and 0 transitions.
Iterating post reduction 2 with 4221 rules applied. Total rules applied 141505 place count 39238 transition count 52863
Performed 5829 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5829 Pre rules applied. Total rules applied 141505 place count 39238 transition count 47034
Deduced a syphon composed of 5829 places in 37 ms
Ensure Unique test removed 2814 places
Reduce places removed 8643 places and 0 transitions.
Iterating global reduction 3 with 14472 rules applied. Total rules applied 155977 place count 30595 transition count 47034
Drop transitions removed 2412 transitions
Trivial Post-agglo rules discarded 2412 transitions
Performed 2412 trivial Post agglomeration. Transition count delta: 2412
Iterating post reduction 3 with 2412 rules applied. Total rules applied 158389 place count 30595 transition count 44622
Reduce places removed 2412 places and 0 transitions.
Iterating post reduction 4 with 2412 rules applied. Total rules applied 160801 place count 28183 transition count 44622
Performed 1407 Post agglomeration using F-continuation condition.Transition count delta: 1407
Deduced a syphon composed of 1407 places in 25 ms
Reduce places removed 1407 places and 0 transitions.
Iterating global reduction 5 with 2814 rules applied. Total rules applied 163615 place count 26776 transition count 43215
Free-agglomeration rule applied 2211 times.
Iterating global reduction 5 with 2211 rules applied. Total rules applied 165826 place count 26776 transition count 41004
Ensure Unique test removed 201 places
Reduce places removed 2412 places and 0 transitions.
Ensure Unique test removed 2010 transitions
Reduce isomorphic transitions removed 2010 transitions.
Iterating post reduction 5 with 4422 rules applied. Total rules applied 170248 place count 24364 transition count 38994
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 201 Pre rules applied. Total rules applied 170248 place count 24364 transition count 38793
Deduced a syphon composed of 201 places in 15 ms
Ensure Unique test removed 201 places
Reduce places removed 402 places and 0 transitions.
Iterating global reduction 6 with 603 rules applied. Total rules applied 170851 place count 23962 transition count 38793
Free-agglomeration rule (complex) applied 2613 times.
Iterating global reduction 6 with 2613 rules applied. Total rules applied 173464 place count 23962 transition count 96480
Ensure Unique test removed 201 places
Reduce places removed 2814 places and 0 transitions.
Iterating post reduction 6 with 2814 rules applied. Total rules applied 176278 place count 21148 transition count 96480
Discarding 4030 places :
Symmetric choice reduction at 7 with 4030 rule applications. Total rules 180308 place count 17118 transition count 30150
Iterating global reduction 7 with 4030 rules applied. Total rules applied 184338 place count 17118 transition count 30150
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 184358 place count 17098 transition count 26130
Iterating global reduction 7 with 20 rules applied. Total rules applied 184378 place count 17098 transition count 26130
Free-agglomeration rule (complex) applied 201 times.
Iterating global reduction 7 with 201 rules applied. Total rules applied 184579 place count 17098 transition count 46029
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 7 with 201 rules applied. Total rules applied 184780 place count 16897 transition count 46029
Discarding 2010 places :
Symmetric choice reduction at 8 with 2010 rule applications. Total rules 186790 place count 14887 transition count 23919
Ensure Unique test removed 201 places
Iterating global reduction 8 with 2211 rules applied. Total rules applied 189001 place count 14686 transition count 23919
Ensure Unique test removed 2010 transitions
Reduce isomorphic transitions removed 2010 transitions.
Iterating post reduction 8 with 2010 rules applied. Total rules applied 191011 place count 14686 transition count 21909
Applied a total of 191011 rules in 42307 ms. Remains 14686 /116842 variables (removed 102156) and now considering 21909/131264 (removed 109355) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42307 ms. Remains : 14686/116842 places, 21909/131264 transitions.
Finished random walk after 1708 steps, including 0 resets, run visited all 2 properties in 227 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F (NOT (AND p0 p2 p1))), (F (AND (NOT p2) p1)), (F (NOT p0)), (F (AND (NOT p0) p2 p1)), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 734 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter insensitive) to 6 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), false, false]
Support contains 6633 out of 116842 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116842/116842 places, 131264/131264 transitions.
Graph (complete) has 168840 edges and 116842 vertex of which 109990 are kept as prefixes of interest. Removing 6852 places using SCC suffix rule.133 ms
Discarding 6852 places :
Also discarding 7649 output transitions
Drop transitions removed 7649 transitions
Reduce places removed 201 places and 201 transitions.
Drop transitions removed 53868 transitions
Trivial Post-agglo rules discarded 53868 transitions
Performed 53868 trivial Post agglomeration. Transition count delta: 53868
Iterating post reduction 0 with 53868 rules applied. Total rules applied 53869 place count 109789 transition count 69546
Reduce places removed 53868 places and 0 transitions.
Performed 8442 Post agglomeration using F-continuation condition.Transition count delta: 8442
Iterating post reduction 1 with 62310 rules applied. Total rules applied 116179 place count 55921 transition count 61104
Reduce places removed 8442 places and 0 transitions.
Iterating post reduction 2 with 8442 rules applied. Total rules applied 124621 place count 47479 transition count 61104
Performed 5829 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5829 Pre rules applied. Total rules applied 124621 place count 47479 transition count 55275
Deduced a syphon composed of 5829 places in 42 ms
Ensure Unique test removed 2814 places
Reduce places removed 8643 places and 0 transitions.
Iterating global reduction 3 with 14472 rules applied. Total rules applied 139093 place count 38836 transition count 55275
Drop transitions removed 2412 transitions
Trivial Post-agglo rules discarded 2412 transitions
Performed 2412 trivial Post agglomeration. Transition count delta: 2412
Iterating post reduction 3 with 2412 rules applied. Total rules applied 141505 place count 38836 transition count 52863
Reduce places removed 2412 places and 0 transitions.
Iterating post reduction 4 with 2412 rules applied. Total rules applied 143917 place count 36424 transition count 52863
Performed 1206 Post agglomeration using F-continuation condition.Transition count delta: 1206
Deduced a syphon composed of 1206 places in 44 ms
Reduce places removed 1206 places and 0 transitions.
Iterating global reduction 5 with 2412 rules applied. Total rules applied 146329 place count 35218 transition count 51657
Applied a total of 146329 rules in 23668 ms. Remains 35218 /116842 variables (removed 81624) and now considering 51657/131264 (removed 79607) transitions.
// Phase 1: matrix 51657 rows 35218 cols
[2023-03-22 13:45:01] [INFO ] Computed 1611 place invariants in 3757 ms
[2023-03-22 13:45:04] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:45:04] [INFO ] Implicit Places using invariants in 6792 ms returned []
Implicit Place search using SMT only with invariants took 6794 ms to find 0 implicit places.
[2023-03-22 13:45:04] [INFO ] Invariant cache hit.
[2023-03-22 13:45:07] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:45:07] [INFO ] Dead Transitions using invariants and state equation in 3041 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35218/116842 places, 51657/131264 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33509 ms. Remains : 35218/116842 places, 51657/131264 transitions.
Computed a total of 35218 stabilizing places and 51657 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 35218 transition count 51657
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)...)
Solver returned unknown.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p2 p1)), (X p1), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 402 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false, false]
Finished random walk after 1137 steps, including 0 resets, run visited all 5 properties in 203 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p2 p1)), (X p1), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (NOT (AND p1 p2 p0))), (F (AND p1 p2 (NOT p0)))]
Knowledge based reduction with 8 factoid took 451 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false, false]
Product exploration timeout after 96600 steps with 242 reset in 10001 ms.
Product exploration timeout after 96340 steps with 242 reset in 10002 ms.
Built C files in :
/tmp/ltsmin8826483975255947515
[2023-03-22 13:47:43] [INFO ] Too many transitions (51657) to apply POR reductions. Disabling POR matrices.
[2023-03-22 13:47:43] [INFO ] Built C files in 356ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8826483975255947515
Running compilation step : cd /tmp/ltsmin8826483975255947515;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8826483975255947515;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8826483975255947515;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6633 out of 35218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35218/35218 places, 51657/51657 transitions.
Applied a total of 0 rules in 1331 ms. Remains 35218 /35218 variables (removed 0) and now considering 51657/51657 (removed 0) transitions.
[2023-03-22 13:47:48] [INFO ] Invariant cache hit.
[2023-03-22 13:47:50] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:47:51] [INFO ] Implicit Places using invariants in 2839 ms returned []
Implicit Place search using SMT only with invariants took 2848 ms to find 0 implicit places.
[2023-03-22 13:47:51] [INFO ] Invariant cache hit.
[2023-03-22 13:47:53] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:47:53] [INFO ] Dead Transitions using invariants and state equation in 2736 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6920 ms. Remains : 35218/35218 places, 51657/51657 transitions.
Built C files in :
/tmp/ltsmin11894895543160194958
[2023-03-22 13:47:53] [INFO ] Too many transitions (51657) to apply POR reductions. Disabling POR matrices.
[2023-03-22 13:47:54] [INFO ] Built C files in 329ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11894895543160194958
Running compilation step : cd /tmp/ltsmin11894895543160194958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11894895543160194958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11894895543160194958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-22 13:48:00] [INFO ] Flatten gal took : 1382 ms
[2023-03-22 13:48:01] [INFO ] Flatten gal took : 1380 ms
[2023-03-22 13:48:02] [INFO ] Time to serialize gal into /tmp/LTL1355594951918747688.gal : 210 ms
[2023-03-22 13:48:02] [INFO ] Time to serialize properties into /tmp/LTL14828465836578386951.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1355594951918747688.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11579779553924557872.hoa' '-atoms' '/tmp/LTL14828465836578386951.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Detected timeout of ITS tools.
[2023-03-22 13:48:21] [INFO ] Flatten gal took : 1610 ms
[2023-03-22 13:48:22] [INFO ] Flatten gal took : 1265 ms
[2023-03-22 13:48:22] [INFO ] Time to serialize gal into /tmp/LTL6397642168443029815.gal : 186 ms
[2023-03-22 13:48:22] [INFO ] Time to serialize properties into /tmp/LTL18217533111616797074.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6397642168443029815.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18217533111616797074.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
[2023-03-22 13:48:39] [INFO ] Flatten gal took : 1351 ms
[2023-03-22 13:48:39] [INFO ] Applying decomposition
[2023-03-22 13:48:40] [INFO ] Flatten gal took : 1238 ms
[2023-03-22 13:49:02] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3604352775721022383.txt' '-o' '/tmp/graph3604352775721022383.bin' '-w' '/tmp/graph3604352775721022383.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:226)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:277)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:663)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:341)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 13:49:03] [INFO ] Flatten gal took : 1282 ms
[2023-03-22 13:49:03] [INFO ] Time to serialize gal into /tmp/LTL13258707574731099759.gal : 180 ms
[2023-03-22 13:49:03] [INFO ] Time to serialize properties into /tmp/LTL4022020038069510704.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13258707574731099759.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4022020038069510704.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17128661470851547530
[2023-03-22 13:49:19] [INFO ] Built C files in 316ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17128661470851547530
Running compilation step : cd /tmp/ltsmin17128661470851547530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17128661470851547530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17128661470851547530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-07 finished in 462844 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 4 out of 117853 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 117852 transition count 134279
Discarding 1005 places :
Symmetric choice reduction at 1 with 1005 rule applications. Total rules 1006 place count 116847 transition count 132269
Iterating global reduction 1 with 1005 rules applied. Total rules applied 2011 place count 116847 transition count 132269
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 2016 place count 116842 transition count 131264
Iterating global reduction 1 with 5 rules applied. Total rules applied 2021 place count 116842 transition count 131264
Applied a total of 2021 rules in 5726 ms. Remains 116842 /117853 variables (removed 1011) and now considering 131264/134279 (removed 3015) transitions.
// Phase 1: matrix 131264 rows 116842 cols
[2023-03-22 13:49:53] [INFO ] Computed 4829 place invariants in 25315 ms
[2023-03-22 13:50:02] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:50:03] [INFO ] Implicit Places using invariants in 34827 ms returned []
Implicit Place search using SMT only with invariants took 34828 ms to find 0 implicit places.
[2023-03-22 13:50:03] [INFO ] Invariant cache hit.
[2023-03-22 13:50:11] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:50:11] [INFO ] Dead Transitions using invariants and state equation in 8685 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116842/117853 places, 131264/134279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49255 ms. Remains : 116842/117853 places, 131264/134279 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-09 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: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s74196 s89179), p1:(LEQ s75748 s27623)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 7 ms.
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-09 finished in 49917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 117853 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 117852 transition count 134279
Discarding 1005 places :
Symmetric choice reduction at 1 with 1005 rule applications. Total rules 1006 place count 116847 transition count 132269
Iterating global reduction 1 with 1005 rules applied. Total rules applied 2011 place count 116847 transition count 132269
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 2016 place count 116842 transition count 131264
Iterating global reduction 1 with 5 rules applied. Total rules applied 2021 place count 116842 transition count 131264
Applied a total of 2021 rules in 5278 ms. Remains 116842 /117853 variables (removed 1011) and now considering 131264/134279 (removed 3015) transitions.
[2023-03-22 13:50:17] [INFO ] Invariant cache hit.
[2023-03-22 13:50:26] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:50:26] [INFO ] Implicit Places using invariants in 9327 ms returned []
Implicit Place search using SMT only with invariants took 9328 ms to find 0 implicit places.
[2023-03-22 13:50:27] [INFO ] Invariant cache hit.
[2023-03-22 13:50:36] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:50:36] [INFO ] Dead Transitions using invariants and state equation in 9387 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116842/117853 places, 131264/134279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23998 ms. Remains : 116842/117853 places, 131264/134279 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s24876 s76089)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 645 steps with 0 reset in 66 ms.
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-11 finished in 24656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&(!p0||F(G(p1)))))))'
Support contains 4 out of 117853 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 117852 transition count 134279
Discarding 1004 places :
Symmetric choice reduction at 1 with 1004 rule applications. Total rules 1005 place count 116848 transition count 132271
Iterating global reduction 1 with 1004 rules applied. Total rules applied 2009 place count 116848 transition count 132271
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 2013 place count 116844 transition count 131467
Iterating global reduction 1 with 4 rules applied. Total rules applied 2017 place count 116844 transition count 131467
Applied a total of 2017 rules in 6031 ms. Remains 116844 /117853 variables (removed 1009) and now considering 131467/134279 (removed 2812) transitions.
// Phase 1: matrix 131467 rows 116844 cols
[2023-03-22 13:51:07] [INFO ] Computed 4829 place invariants in 24745 ms
[2023-03-22 13:51:17] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:51:17] [INFO ] Implicit Places using invariants in 34534 ms returned []
Implicit Place search using SMT only with invariants took 34536 ms to find 0 implicit places.
[2023-03-22 13:51:17] [INFO ] Invariant cache hit.
[2023-03-22 13:51:27] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:51:27] [INFO ] Dead Transitions using invariants and state equation in 9677 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116844/117853 places, 131467/134279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50252 ms. Remains : 116844/117853 places, 131467/134279 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s8263 s74410), p1:(GT s115935 s28992)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 11515 steps with 3 reset in 1108 ms.
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-12 finished in 52021 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p1)||p0)) U X(X(p2))))'
Support contains 4 out of 117853 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Discarding 1005 places :
Symmetric choice reduction at 0 with 1005 rule applications. Total rules 1005 place count 116848 transition count 132269
Iterating global reduction 0 with 1005 rules applied. Total rules applied 2010 place count 116848 transition count 132269
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 2015 place count 116843 transition count 131264
Iterating global reduction 0 with 5 rules applied. Total rules applied 2020 place count 116843 transition count 131264
Applied a total of 2020 rules in 5406 ms. Remains 116843 /117853 variables (removed 1010) and now considering 131264/134279 (removed 3015) transitions.
// Phase 1: matrix 131264 rows 116843 cols
[2023-03-22 13:51:58] [INFO ] Computed 4830 place invariants in 23988 ms
[2023-03-22 13:52:07] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:52:07] [INFO ] Implicit Places using invariants in 32753 ms returned []
Implicit Place search using SMT only with invariants took 32777 ms to find 0 implicit places.
[2023-03-22 13:52:07] [INFO ] Invariant cache hit.
[2023-03-22 13:52:15] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:52:15] [INFO ] Dead Transitions using invariants and state equation in 8552 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116843/117853 places, 131264/134279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46743 ms. Remains : 116843/117853 places, 131264/134279 transitions.
Stuttering acceptance computed with spot in 357 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LEQ 3 s94879) (LEQ 3 s830)), p1:(GT 3 s94879), p2:(LEQ s55688 s39102)], nbAcceptance=0, 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][false, false, false, false, false, false, false]]
Product exploration timeout after 14000 steps with 5600 reset in 10004 ms.
Product exploration timeout after 12820 steps with 5117 reset in 10010 ms.
Computed a total of 116843 stabilizing places and 131264 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 116843 transition count 131264
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)...)
Could not satisfy deadlock states : solver returned unknown
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 9 factoid took 169 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-13 finished in 88969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&F(p1)))))'
Support contains 4 out of 117853 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 117852 transition count 134279
Discarding 1005 places :
Symmetric choice reduction at 1 with 1005 rule applications. Total rules 1006 place count 116847 transition count 132269
Iterating global reduction 1 with 1005 rules applied. Total rules applied 2011 place count 116847 transition count 132269
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 2016 place count 116842 transition count 131264
Iterating global reduction 1 with 5 rules applied. Total rules applied 2021 place count 116842 transition count 131264
Applied a total of 2021 rules in 5238 ms. Remains 116842 /117853 variables (removed 1011) and now considering 131264/134279 (removed 3015) transitions.
// Phase 1: matrix 131264 rows 116842 cols
[2023-03-22 13:53:29] [INFO ] Computed 4829 place invariants in 26097 ms
[2023-03-22 13:53:38] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:53:38] [INFO ] Implicit Places using invariants in 34901 ms returned []
Implicit Place search using SMT only with invariants took 34903 ms to find 0 implicit places.
[2023-03-22 13:53:38] [INFO ] Invariant cache hit.
[2023-03-22 13:53:46] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:53:46] [INFO ] Dead Transitions using invariants and state equation in 8412 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116842/117853 places, 131264/134279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48560 ms. Remains : 116842/117853 places, 131264/134279 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (GT 1 s85679) (LEQ 2 s40432)), p0:(OR (LEQ s95006 s992) (LEQ 1 s85679))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 11509 steps with 0 reset in 806 ms.
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-14 finished in 50069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1&&X((p1 U (p2||G(p1)))))))))'
Found a Shortening insensitive property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-07
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 6633 out of 117853 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Graph (complete) has 172862 edges and 117853 vertex of which 109991 are kept as prefixes of interest. Removing 7862 places using SCC suffix rule.141 ms
Discarding 7862 places :
Also discarding 10664 output transitions
Drop transitions removed 10664 transitions
Reduce places removed 201 places and 201 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 53868 transitions
Trivial Post-agglo rules discarded 53868 transitions
Performed 53868 trivial Post agglomeration. Transition count delta: 53868
Iterating post reduction 0 with 53869 rules applied. Total rules applied 53870 place count 109789 transition count 69546
Reduce places removed 53868 places and 0 transitions.
Performed 8442 Post agglomeration using F-continuation condition.Transition count delta: 8442
Iterating post reduction 1 with 62310 rules applied. Total rules applied 116180 place count 55921 transition count 61104
Reduce places removed 8442 places and 0 transitions.
Iterating post reduction 2 with 8442 rules applied. Total rules applied 124622 place count 47479 transition count 61104
Performed 5829 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5829 Pre rules applied. Total rules applied 124622 place count 47479 transition count 55275
Deduced a syphon composed of 5829 places in 45 ms
Ensure Unique test removed 2814 places
Reduce places removed 8643 places and 0 transitions.
Iterating global reduction 3 with 14472 rules applied. Total rules applied 139094 place count 38836 transition count 55275
Drop transitions removed 2412 transitions
Trivial Post-agglo rules discarded 2412 transitions
Performed 2412 trivial Post agglomeration. Transition count delta: 2412
Iterating post reduction 3 with 2412 rules applied. Total rules applied 141506 place count 38836 transition count 52863
Reduce places removed 2412 places and 0 transitions.
Iterating post reduction 4 with 2412 rules applied. Total rules applied 143918 place count 36424 transition count 52863
Performed 1206 Post agglomeration using F-continuation condition.Transition count delta: 1206
Deduced a syphon composed of 1206 places in 42 ms
Reduce places removed 1206 places and 0 transitions.
Iterating global reduction 5 with 2412 rules applied. Total rules applied 146330 place count 35218 transition count 51657
Applied a total of 146330 rules in 24488 ms. Remains 35218 /117853 variables (removed 82635) and now considering 51657/134279 (removed 82622) transitions.
// Phase 1: matrix 51657 rows 35218 cols
[2023-03-22 13:54:16] [INFO ] Computed 1611 place invariants in 3896 ms
[2023-03-22 13:54:19] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:54:19] [INFO ] Implicit Places using invariants in 7034 ms returned []
Implicit Place search using SMT only with invariants took 7039 ms to find 0 implicit places.
[2023-03-22 13:54:20] [INFO ] Invariant cache hit.
[2023-03-22 13:54:22] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:54:22] [INFO ] Dead Transitions using invariants and state equation in 2719 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 35218/117853 places, 51657/134279 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 34250 ms. Remains : 35218/117853 places, 51657/134279 transitions.
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 3 (ADD s13880 s13881 s13882 s13883 s13884 s13885 s13886 s13887 s13888 s13889 s13890 s13891 s13892 s13893 s13894 s13895 s13896 s13897 s13898 s13899 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 25390 steps with 8468 reset in 10002 ms.
Product exploration timeout after 25650 steps with 8488 reset in 10002 ms.
Computed a total of 35218 stabilizing places and 51657 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 35218 transition count 51657
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)...)
Solver returned unknown.
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 339 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Finished random walk after 1530 steps, including 0 resets, run visited all 4 properties in 217 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 8 factoid took 454 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Support contains 2412 out of 35218 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 : 35218/35218 places, 51657/51657 transitions.
Applied a total of 0 rules in 1302 ms. Remains 35218 /35218 variables (removed 0) and now considering 51657/51657 (removed 0) transitions.
[2023-03-22 13:56:53] [INFO ] Invariant cache hit.
[2023-03-22 13:56:56] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:56:56] [INFO ] Implicit Places using invariants in 3102 ms returned []
Implicit Place search using SMT only with invariants took 3104 ms to find 0 implicit places.
[2023-03-22 13:56:56] [INFO ] Invariant cache hit.
[2023-03-22 13:56:59] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:56:59] [INFO ] Dead Transitions using invariants and state equation in 2874 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7288 ms. Remains : 35218/35218 places, 51657/51657 transitions.
Computed a total of 35218 stabilizing places and 51657 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 35218 transition count 51657
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)...)
Solver returned unknown.
Knowledge obtained : [(AND p1 p2), (X (AND p1 p2)), (X p1), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Finished random walk after 1607 steps, including 0 resets, run visited all 4 properties in 266 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p1 p2), (X (AND p1 p2)), (X p1), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 5 factoid took 310 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Product exploration timeout after 93330 steps with 232 reset in 10002 ms.
Product exploration timeout after 98160 steps with 243 reset in 10001 ms.
Built C files in :
/tmp/ltsmin2505730610562309431
[2023-03-22 13:59:43] [INFO ] Too many transitions (51657) to apply POR reductions. Disabling POR matrices.
[2023-03-22 13:59:43] [INFO ] Built C files in 343ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2505730610562309431
Running compilation step : cd /tmp/ltsmin2505730610562309431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2505730610562309431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2505730610562309431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2412 out of 35218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35218/35218 places, 51657/51657 transitions.
Drop transitions removed 8442 transitions
Trivial Post-agglo rules discarded 8442 transitions
Performed 8442 trivial Post agglomeration. Transition count delta: 8442
Iterating post reduction 0 with 8442 rules applied. Total rules applied 8442 place count 35218 transition count 43215
Reduce places removed 8442 places and 0 transitions.
Iterating post reduction 1 with 8442 rules applied. Total rules applied 16884 place count 26776 transition count 43215
Applied a total of 16884 rules in 1647 ms. Remains 26776 /35218 variables (removed 8442) and now considering 43215/51657 (removed 8442) transitions.
// Phase 1: matrix 43215 rows 26776 cols
[2023-03-22 13:59:51] [INFO ] Computed 1611 place invariants in 3003 ms
[2023-03-22 13:59:53] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:59:53] [INFO ] Implicit Places using invariants in 5268 ms returned []
Implicit Place search using SMT only with invariants took 5270 ms to find 0 implicit places.
[2023-03-22 13:59:53] [INFO ] Invariant cache hit.
[2023-03-22 13:59:56] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:59:56] [INFO ] Dead Transitions using invariants and state equation in 2364 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26776/35218 places, 43215/51657 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9286 ms. Remains : 26776/35218 places, 43215/51657 transitions.
Built C files in :
/tmp/ltsmin923703948055630050
[2023-03-22 13:59:56] [INFO ] Too many transitions (43215) to apply POR reductions. Disabling POR matrices.
[2023-03-22 13:59:56] [INFO ] Built C files in 263ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin923703948055630050
Running compilation step : cd /tmp/ltsmin923703948055630050;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin923703948055630050;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin923703948055630050;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-22 14:00:02] [INFO ] Flatten gal took : 1552 ms
[2023-03-22 14:00:04] [INFO ] Flatten gal took : 1200 ms
[2023-03-22 14:00:04] [INFO ] Time to serialize gal into /tmp/LTL1065010118301476586.gal : 189 ms
[2023-03-22 14:00:04] [INFO ] Time to serialize properties into /tmp/LTL6089792292817969281.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1065010118301476586.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1966574506143766918.hoa' '-atoms' '/tmp/LTL6089792292817969281.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Detected timeout of ITS tools.
[2023-03-22 14:00:23] [INFO ] Flatten gal took : 1363 ms
[2023-03-22 14:00:25] [INFO ] Flatten gal took : 1491 ms
[2023-03-22 14:00:25] [INFO ] Time to serialize gal into /tmp/LTL3168934054943800433.gal : 187 ms
[2023-03-22 14:00:25] [INFO ] Time to serialize properties into /tmp/LTL9954975049614547575.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3168934054943800433.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9954975049614547575.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Detected timeout of ITS tools.
[2023-03-22 14:00:43] [INFO ] Flatten gal took : 2390 ms
[2023-03-22 14:00:43] [INFO ] Applying decomposition
[2023-03-22 14:00:44] [INFO ] Flatten gal took : 1430 ms
[2023-03-22 14:01:09] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18198841883868862546.txt' '-o' '/tmp/graph18198841883868862546.bin' '-w' '/tmp/graph18198841883868862546.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:226)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:277)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:663)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:341)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 14:01:11] [INFO ] Flatten gal took : 1414 ms
[2023-03-22 14:01:11] [INFO ] Time to serialize gal into /tmp/LTL3271196491358493299.gal : 202 ms
[2023-03-22 14:01:11] [INFO ] Time to serialize properties into /tmp/LTL3265036663809707567.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3271196491358493299.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3265036663809707567.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7445413483545751058
[2023-03-22 14:01:27] [INFO ] Built C files in 442ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7445413483545751058
Running compilation step : cd /tmp/ltsmin7445413483545751058;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7445413483545751058;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7445413483545751058;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-07 finished in 464205 ms.
[2023-03-22 14:01:35] [INFO ] Flatten gal took : 3196 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9557587863871881814
[2023-03-22 14:01:37] [INFO ] Too many transitions (134279) to apply POR reductions. Disabling POR matrices.
[2023-03-22 14:01:38] [INFO ] Built C files in 1038ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9557587863871881814
Running compilation step : cd /tmp/ltsmin9557587863871881814;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-22 14:01:39] [INFO ] Applying decomposition
[2023-03-22 14:01:43] [INFO ] Flatten gal took : 3246 ms

BK_STOP 1679493709681

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="FamilyReunion-PT-L00200M0020C010P010G005"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is FamilyReunion-PT-L00200M0020C010P010G005, 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 r165-tall-167838850400427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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