Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 12M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716220918267

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-090
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-20 16:01:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 16:01:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 16:02:00] [INFO ] Load time of PNML (sax parser for PT used): 655 ms
[2024-05-20 16:02:00] [INFO ] Transformed 17282 places.
[2024-05-20 16:02:00] [INFO ] Transformed 33120 transitions.
[2024-05-20 16:02:00] [INFO ] Parsed PT model containing 17282 places and 33120 transitions and 99000 arcs in 914 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-090-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 17282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17282/17282 places, 33120/33120 transitions.
Discarding 7898 places :
Symmetric choice reduction at 0 with 7898 rule applications. Total rules 7898 place count 9384 transition count 17324
Iterating global reduction 0 with 7898 rules applied. Total rules applied 15796 place count 9384 transition count 17324
Applied a total of 15796 rules in 6701 ms. Remains 9384 /17282 variables (removed 7898) and now considering 17324/33120 (removed 15796) transitions.
// Phase 1: matrix 17324 rows 9384 cols
[2024-05-20 16:02:08] [INFO ] Computed 181 invariants in 343 ms
[2024-05-20 16:02:09] [INFO ] Implicit Places using invariants in 1452 ms returned []
Implicit Place search using SMT only with invariants took 1526 ms to find 0 implicit places.
[2024-05-20 16:02:09] [INFO ] Invariant cache hit.
[2024-05-20 16:02:10] [INFO ] Dead Transitions using invariants and state equation in 886 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9384/17282 places, 17324/33120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9120 ms. Remains : 9384/17282 places, 17324/33120 transitions.
Support contains 44 out of 9384 places after structural reductions.
[2024-05-20 16:02:11] [INFO ] Flatten gal took : 776 ms
[2024-05-20 16:02:12] [INFO ] Flatten gal took : 523 ms
[2024-05-20 16:02:13] [INFO ] Input system was already deterministic with 17324 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 788 ms. (steps per millisecond=12 ) properties (out of 26) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 87416 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{2=1}
Probabilistic random walk after 87416 steps, saw 86097 distinct states, run finished after 3003 ms. (steps per millisecond=29 ) properties seen :1
Running SMT prover for 23 properties.
[2024-05-20 16:02:17] [INFO ] Invariant cache hit.
[2024-05-20 16:02:21] [INFO ] After 3773ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2024-05-20 16:02:24] [INFO ] [Nat]Absence check using 91 positive place invariants in 296 ms returned sat
[2024-05-20 16:02:24] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 124 ms returned sat
[2024-05-20 16:02:44] [INFO ] After 18003ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :17
[2024-05-20 16:02:45] [INFO ] State equation strengthened by 16110 read => feed constraints.
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:800)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:647)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 16:02:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 16:02:46] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:23
Fused 23 Parikh solutions to 13 different solutions.
Parikh walk visited 1 properties in 942 ms.
Support contains 31 out of 9384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9384/9384 places, 17324/17324 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9384 transition count 16694
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8754 transition count 16694
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1264 place count 8750 transition count 16686
Iterating global reduction 2 with 4 rules applied. Total rules applied 1268 place count 8750 transition count 16686
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1448 place count 8660 transition count 16596
Free-agglomeration rule applied 147 times.
Iterating global reduction 2 with 147 rules applied. Total rules applied 1595 place count 8660 transition count 16449
Reduce places removed 147 places and 0 transitions.
Iterating post reduction 2 with 147 rules applied. Total rules applied 1742 place count 8513 transition count 16449
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 1774 place count 8513 transition count 16449
Applied a total of 1774 rules in 13880 ms. Remains 8513 /9384 variables (removed 871) and now considering 16449/17324 (removed 875) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13885 ms. Remains : 8513/9384 places, 16449/17324 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 521 ms. (steps per millisecond=19 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 16449 rows 8513 cols
[2024-05-20 16:03:01] [INFO ] Computed 181 invariants in 128 ms
[2024-05-20 16:03:04] [INFO ] After 2181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-20 16:03:06] [INFO ] [Nat]Absence check using 91 positive place invariants in 159 ms returned sat
[2024-05-20 16:03:06] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 92 ms returned sat
[2024-05-20 16:03:20] [INFO ] After 13418ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-20 16:03:21] [INFO ] State equation strengthened by 16216 read => feed constraints.
[2024-05-20 16:03:29] [INFO ] After 8119ms SMT Verify possible using 16216 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2024-05-20 16:03:29] [INFO ] After 8121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-20 16:03:29] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 2 properties in 96 ms.
Support contains 22 out of 8513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8513/8513 places, 16449/16449 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 8508 transition count 16444
Applied a total of 10 rules in 4900 ms. Remains 8508 /8513 variables (removed 5) and now considering 16444/16449 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4910 ms. Remains : 8508/8513 places, 16444/16449 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 587 ms. (steps per millisecond=17 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 16444 rows 8508 cols
[2024-05-20 16:03:35] [INFO ] Computed 181 invariants in 120 ms
[2024-05-20 16:03:37] [INFO ] After 1881ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-20 16:03:38] [INFO ] [Nat]Absence check using 91 positive place invariants in 179 ms returned sat
[2024-05-20 16:03:38] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 102 ms returned sat
[2024-05-20 16:03:52] [INFO ] After 13144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-20 16:03:53] [INFO ] State equation strengthened by 16221 read => feed constraints.
[2024-05-20 16:04:00] [INFO ] After 7405ms SMT Verify possible using 16221 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-20 16:04:02] [INFO ] After 8955ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-20 16:04:02] [INFO ] After 25072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 20 out of 8508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8508/8508 places, 16444/16444 transitions.
Applied a total of 0 rules in 2741 ms. Remains 8508 /8508 variables (removed 0) and now considering 16444/16444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2741 ms. Remains : 8508/8508 places, 16444/16444 transitions.
Successfully simplified 6 atomic propositions for a total of 12 simplifications.
FORMULA CANConstruction-PT-090-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 361 stabilizing places and 450 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&X(p1))))))'
Support contains 4 out of 9384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9384/9384 places, 17324/17324 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 9365 transition count 17286
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 9365 transition count 17286
Applied a total of 38 rules in 5835 ms. Remains 9365 /9384 variables (removed 19) and now considering 17286/17324 (removed 38) transitions.
// Phase 1: matrix 17286 rows 9365 cols
[2024-05-20 16:04:11] [INFO ] Computed 181 invariants in 125 ms
[2024-05-20 16:04:12] [INFO ] Implicit Places using invariants in 994 ms returned []
Implicit Place search using SMT only with invariants took 998 ms to find 0 implicit places.
[2024-05-20 16:04:12] [INFO ] Invariant cache hit.
[2024-05-20 16:04:13] [INFO ] Dead Transitions using invariants and state equation in 918 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9365/9384 places, 17286/17324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7761 ms. Remains : 9365/9384 places, 17286/17324 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p0:(LEQ s3753 s4358), p1:(GT s4812 s5199)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 62 reset in 1844 ms.
Product exploration explored 100000 steps with 62 reset in 1698 ms.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 147 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 146773 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 146773 steps, saw 144474 distinct states, run finished after 3004 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-20 16:04:20] [INFO ] Invariant cache hit.
[2024-05-20 16:04:22] [INFO ] After 1395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 16:04:23] [INFO ] [Nat]Absence check using 91 positive place invariants in 188 ms returned sat
[2024-05-20 16:04:23] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 103 ms returned sat
[2024-05-20 16:04:36] [INFO ] After 12238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 16:04:36] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2024-05-20 16:04:41] [INFO ] After 4660ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 16:04:44] [INFO ] After 8057ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2269 ms.
[2024-05-20 16:04:46] [INFO ] After 24686ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 2 properties in 19 ms.
Support contains 4 out of 9365 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9365/9365 places, 17286/17286 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9365 transition count 16656
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8735 transition count 16656
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1440 place count 8645 transition count 16566
Free-agglomeration rule applied 174 times.
Iterating global reduction 2 with 174 rules applied. Total rules applied 1614 place count 8645 transition count 16392
Reduce places removed 174 places and 0 transitions.
Iterating post reduction 2 with 174 rules applied. Total rules applied 1788 place count 8471 transition count 16392
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 1794 place count 8471 transition count 16392
Applied a total of 1794 rules in 10725 ms. Remains 8471 /9365 variables (removed 894) and now considering 16392/17286 (removed 894) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10726 ms. Remains : 8471/9365 places, 16392/17286 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 97278 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97278 steps, saw 90468 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 16392 rows 8471 cols
[2024-05-20 16:05:01] [INFO ] Computed 181 invariants in 112 ms
[2024-05-20 16:05:02] [INFO ] After 1108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:05:03] [INFO ] [Nat]Absence check using 91 positive place invariants in 171 ms returned sat
[2024-05-20 16:05:03] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 97 ms returned sat
[2024-05-20 16:05:15] [INFO ] After 11467ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:05:15] [INFO ] State equation strengthened by 16203 read => feed constraints.
[2024-05-20 16:05:18] [INFO ] After 3107ms SMT Verify possible using 16203 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 16:05:20] [INFO ] After 4660ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1109 ms.
[2024-05-20 16:05:21] [INFO ] After 18858ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 8471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8471/8471 places, 16392/16392 transitions.
Applied a total of 0 rules in 2777 ms. Remains 8471 /8471 variables (removed 0) and now considering 16392/16392 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2777 ms. Remains : 8471/8471 places, 16392/16392 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8471/8471 places, 16392/16392 transitions.
Applied a total of 0 rules in 2707 ms. Remains 8471 /8471 variables (removed 0) and now considering 16392/16392 (removed 0) transitions.
[2024-05-20 16:05:26] [INFO ] Invariant cache hit.
[2024-05-20 16:05:27] [INFO ] Implicit Places using invariants in 866 ms returned []
Implicit Place search using SMT only with invariants took 868 ms to find 0 implicit places.
[2024-05-20 16:05:27] [INFO ] Invariant cache hit.
[2024-05-20 16:05:28] [INFO ] Dead Transitions using invariants and state equation in 921 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4503 ms. Remains : 8471/8471 places, 16392/16392 transitions.
Graph (trivial) has 16108 edges and 8471 vertex of which 8186 / 8471 are part of one of the 90 SCC in 8 ms
Free SCC test removed 8096 places
Drop transitions removed 16102 transitions
Reduce isomorphic transitions removed 16102 transitions.
Graph (complete) has 834 edges and 375 vertex of which 18 are kept as prefixes of interest. Removing 357 places using SCC suffix rule.1 ms
Discarding 357 places :
Also discarding 261 output transitions
Drop transitions removed 261 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 11 rules applied. Total rules applied 13 place count 18 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 16 place count 15 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 15 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 12 transition count 15
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 12 transition count 15
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 30 place count 8 transition count 11
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 8 transition count 11
Applied a total of 34 rules in 52 ms. Remains 8 /8471 variables (removed 8463) and now considering 11/16392 (removed 16381) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 8 cols
[2024-05-20 16:05:28] [INFO ] Computed 1 invariants in 0 ms
[2024-05-20 16:05:28] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:05:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 16:05:28] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:05:28] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-20 16:05:28] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 161 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 9365 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9365/9365 places, 17286/17286 transitions.
Applied a total of 0 rules in 2934 ms. Remains 9365 /9365 variables (removed 0) and now considering 17286/17286 (removed 0) transitions.
// Phase 1: matrix 17286 rows 9365 cols
[2024-05-20 16:05:32] [INFO ] Computed 181 invariants in 117 ms
[2024-05-20 16:05:32] [INFO ] Implicit Places using invariants in 1059 ms returned []
Implicit Place search using SMT only with invariants took 1061 ms to find 0 implicit places.
[2024-05-20 16:05:33] [INFO ] Invariant cache hit.
[2024-05-20 16:05:33] [INFO ] Dead Transitions using invariants and state equation in 940 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4940 ms. Remains : 9365/9365 places, 17286/17286 transitions.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 170 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 103387 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103387 steps, saw 101759 distinct states, run finished after 3003 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-20 16:05:37] [INFO ] Invariant cache hit.
[2024-05-20 16:05:39] [INFO ] After 1462ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 16:05:40] [INFO ] [Nat]Absence check using 91 positive place invariants in 200 ms returned sat
[2024-05-20 16:05:41] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 113 ms returned sat
[2024-05-20 16:05:55] [INFO ] After 13854ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 16:05:55] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2024-05-20 16:06:00] [INFO ] After 4913ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 16:06:04] [INFO ] After 8583ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 228 ms.
[2024-05-20 16:06:04] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 2 properties in 25 ms.
Support contains 4 out of 9365 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9365/9365 places, 17286/17286 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9365 transition count 16656
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8735 transition count 16656
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1440 place count 8645 transition count 16566
Free-agglomeration rule applied 174 times.
Iterating global reduction 2 with 174 rules applied. Total rules applied 1614 place count 8645 transition count 16392
Reduce places removed 174 places and 0 transitions.
Iterating post reduction 2 with 174 rules applied. Total rules applied 1788 place count 8471 transition count 16392
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 1794 place count 8471 transition count 16392
Applied a total of 1794 rules in 11214 ms. Remains 8471 /9365 variables (removed 894) and now considering 16392/17286 (removed 894) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11215 ms. Remains : 8471/9365 places, 16392/17286 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16392 rows 8471 cols
[2024-05-20 16:06:16] [INFO ] Computed 181 invariants in 105 ms
[2024-05-20 16:06:16] [INFO ] After 945ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:06:17] [INFO ] [Nat]Absence check using 91 positive place invariants in 168 ms returned sat
[2024-05-20 16:06:18] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 97 ms returned sat
[2024-05-20 16:06:27] [INFO ] After 9496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:06:27] [INFO ] State equation strengthened by 16203 read => feed constraints.
[2024-05-20 16:06:29] [INFO ] After 1979ms SMT Verify possible using 16203 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 16:06:30] [INFO ] After 2698ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 579 ms.
[2024-05-20 16:06:31] [INFO ] After 14112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 8471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8471/8471 places, 16392/16392 transitions.
Applied a total of 0 rules in 2735 ms. Remains 8471 /8471 variables (removed 0) and now considering 16392/16392 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2735 ms. Remains : 8471/8471 places, 16392/16392 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 100286 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100286 steps, saw 91172 distinct states, run finished after 3003 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 16:06:37] [INFO ] Invariant cache hit.
[2024-05-20 16:06:38] [INFO ] After 863ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:06:39] [INFO ] [Nat]Absence check using 91 positive place invariants in 183 ms returned sat
[2024-05-20 16:06:39] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 100 ms returned sat
[2024-05-20 16:06:49] [INFO ] After 10458ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:06:49] [INFO ] State equation strengthened by 16203 read => feed constraints.
[2024-05-20 16:06:52] [INFO ] After 2637ms SMT Verify possible using 16203 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 16:06:53] [INFO ] After 3522ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 586 ms.
[2024-05-20 16:06:53] [INFO ] After 15945ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 8471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8471/8471 places, 16392/16392 transitions.
Applied a total of 0 rules in 2697 ms. Remains 8471 /8471 variables (removed 0) and now considering 16392/16392 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2698 ms. Remains : 8471/8471 places, 16392/16392 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8471/8471 places, 16392/16392 transitions.
Applied a total of 0 rules in 2712 ms. Remains 8471 /8471 variables (removed 0) and now considering 16392/16392 (removed 0) transitions.
[2024-05-20 16:06:59] [INFO ] Invariant cache hit.
[2024-05-20 16:07:00] [INFO ] Implicit Places using invariants in 799 ms returned []
Implicit Place search using SMT only with invariants took 812 ms to find 0 implicit places.
[2024-05-20 16:07:00] [INFO ] Invariant cache hit.
[2024-05-20 16:07:00] [INFO ] Dead Transitions using invariants and state equation in 790 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4324 ms. Remains : 8471/8471 places, 16392/16392 transitions.
Graph (trivial) has 16108 edges and 8471 vertex of which 8186 / 8471 are part of one of the 90 SCC in 4 ms
Free SCC test removed 8096 places
Drop transitions removed 16102 transitions
Reduce isomorphic transitions removed 16102 transitions.
Graph (complete) has 834 edges and 375 vertex of which 18 are kept as prefixes of interest. Removing 357 places using SCC suffix rule.1 ms
Discarding 357 places :
Also discarding 261 output transitions
Drop transitions removed 261 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 11 rules applied. Total rules applied 13 place count 18 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 16 place count 15 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 15 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 12 transition count 15
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 12 transition count 15
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 30 place count 8 transition count 11
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 8 transition count 11
Applied a total of 34 rules in 31 ms. Remains 8 /8471 variables (removed 8463) and now considering 11/16392 (removed 16381) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 8 cols
[2024-05-20 16:07:01] [INFO ] Computed 1 invariants in 0 ms
[2024-05-20 16:07:01] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:07:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 16:07:01] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:07:01] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 16:07:01] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 269 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 61 reset in 1611 ms.
Product exploration explored 100000 steps with 60 reset in 1705 ms.
Built C files in :
/tmp/ltsmin16580927802827156562
[2024-05-20 16:07:05] [INFO ] Built C files in 211ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16580927802827156562
Running compilation step : cd /tmp/ltsmin16580927802827156562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin16580927802827156562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16580927802827156562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 4 out of 9365 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9365/9365 places, 17286/17286 transitions.
Applied a total of 0 rules in 2900 ms. Remains 9365 /9365 variables (removed 0) and now considering 17286/17286 (removed 0) transitions.
// Phase 1: matrix 17286 rows 9365 cols
[2024-05-20 16:07:11] [INFO ] Computed 181 invariants in 113 ms
[2024-05-20 16:07:12] [INFO ] Implicit Places using invariants in 974 ms returned []
Implicit Place search using SMT only with invariants took 984 ms to find 0 implicit places.
[2024-05-20 16:07:12] [INFO ] Invariant cache hit.
[2024-05-20 16:07:13] [INFO ] Dead Transitions using invariants and state equation in 814 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4712 ms. Remains : 9365/9365 places, 17286/17286 transitions.
Built C files in :
/tmp/ltsmin9708007567795298752
[2024-05-20 16:07:13] [INFO ] Built C files in 166ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9708007567795298752
Running compilation step : cd /tmp/ltsmin9708007567795298752;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin9708007567795298752;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9708007567795298752;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2024-05-20 16:07:17] [INFO ] Flatten gal took : 507 ms
[2024-05-20 16:07:17] [INFO ] Flatten gal took : 418 ms
[2024-05-20 16:07:18] [INFO ] Time to serialize gal into /tmp/LTL5273951475126367715.gal : 173 ms
[2024-05-20 16:07:18] [INFO ] Time to serialize properties into /tmp/LTL9228379166469960171.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5273951475126367715.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8533573140000155471.hoa' '-atoms' '/tmp/LTL9228379166469960171.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9228379166469960171.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8533573140000155471.hoa
Detected timeout of ITS tools.
[2024-05-20 16:07:33] [INFO ] Flatten gal took : 393 ms
[2024-05-20 16:07:34] [INFO ] Flatten gal took : 402 ms
[2024-05-20 16:07:34] [INFO ] Time to serialize gal into /tmp/LTL13565496675857769166.gal : 70 ms
[2024-05-20 16:07:34] [INFO ] Time to serialize properties into /tmp/LTL9958248810960292934.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13565496675857769166.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9958248810960292934.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(Node26GiveAnswer87<=Node33GiveAnswer68)"))||(("(Node38requestsent77>Node43GiveAnswer17)")&&(X("(Node38requestsent77>Node43...176
Formula 0 simplified : G(F!"(Node26GiveAnswer87<=Node33GiveAnswer68)" & FG(!"(Node38requestsent77>Node43GiveAnswer17)" | X!"(Node38requestsent77>Node43Give...167
Detected timeout of ITS tools.
[2024-05-20 16:07:49] [INFO ] Flatten gal took : 387 ms
[2024-05-20 16:07:49] [INFO ] Applying decomposition
[2024-05-20 16:07:50] [INFO ] Flatten gal took : 389 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6691418950743044463.txt' '-o' '/tmp/graph6691418950743044463.bin' '-w' '/tmp/graph6691418950743044463.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6691418950743044463.bin' '-l' '-1' '-v' '-w' '/tmp/graph6691418950743044463.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:07:51] [INFO ] Decomposing Gal with order
[2024-05-20 16:07:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:07:54] [INFO ] Removed a total of 16255 redundant transitions.
[2024-05-20 16:07:55] [INFO ] Flatten gal took : 2758 ms
[2024-05-20 16:07:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 15850 labels/synchronizations in 2816 ms.
[2024-05-20 16:08:00] [INFO ] Time to serialize gal into /tmp/LTL3703522527654968379.gal : 110 ms
[2024-05-20 16:08:00] [INFO ] Time to serialize properties into /tmp/LTL5834225299598780320.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3703522527654968379.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5834225299598780320.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(gu359.Node26GiveAnswer87<=gu359.Node33GiveAnswer68)"))||(("(gu361.Node38requestsent77>gu361.Node43GiveAnswer17)")&&(X("(gu...212
Formula 0 simplified : G(F!"(gu359.Node26GiveAnswer87<=gu359.Node33GiveAnswer68)" & FG(!"(gu361.Node38requestsent77>gu361.Node43GiveAnswer17)" | X!"(gu361....203
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11975271067364482245
[2024-05-20 16:08:15] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11975271067364482245
Running compilation step : cd /tmp/ltsmin11975271067364482245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin11975271067364482245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11975271067364482245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 CANConstruction-PT-090-LTLCardinality-00 finished in 253135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 4 out of 9384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9384/9384 places, 17324/17324 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9384 transition count 16694
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8754 transition count 16694
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 1282 place count 8732 transition count 16650
Iterating global reduction 2 with 22 rules applied. Total rules applied 1304 place count 8732 transition count 16650
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1484 place count 8642 transition count 16560
Applied a total of 1484 rules in 8625 ms. Remains 8642 /9384 variables (removed 742) and now considering 16560/17324 (removed 764) transitions.
// Phase 1: matrix 16560 rows 8642 cols
[2024-05-20 16:08:27] [INFO ] Computed 181 invariants in 104 ms
[2024-05-20 16:08:27] [INFO ] Implicit Places using invariants in 873 ms returned []
Implicit Place search using SMT only with invariants took 875 ms to find 0 implicit places.
[2024-05-20 16:08:27] [INFO ] Invariant cache hit.
[2024-05-20 16:08:28] [INFO ] Dead Transitions using invariants and state equation in 832 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8642/9384 places, 16560/17324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10336 ms. Remains : 8642/9384 places, 16560/17324 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s6574 s6035), p1:(LEQ s4934 s3728)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 125 reset in 2554 ms.
Product exploration explored 100000 steps with 124 reset in 2520 ms.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 16:08:34] [INFO ] Invariant cache hit.
[2024-05-20 16:08:35] [INFO ] After 937ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:08:36] [INFO ] [Nat]Absence check using 91 positive place invariants in 208 ms returned sat
[2024-05-20 16:08:36] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 127 ms returned sat
[2024-05-20 16:08:47] [INFO ] After 10354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:08:47] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2024-05-20 16:08:49] [INFO ] After 2208ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 16:08:50] [INFO ] After 2951ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 681 ms.
[2024-05-20 16:08:51] [INFO ] After 15518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 8642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8642/8642 places, 16560/16560 transitions.
Free-agglomeration rule applied 180 times.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 8642 transition count 16380
Reduce places removed 180 places and 0 transitions.
Iterating post reduction 0 with 180 rules applied. Total rules applied 360 place count 8462 transition count 16380
Applied a total of 360 rules in 5894 ms. Remains 8462 /8642 variables (removed 180) and now considering 16380/16560 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5897 ms. Remains : 8462/8642 places, 16380/16560 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 100449 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100449 steps, saw 91261 distinct states, run finished after 3003 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16380 rows 8462 cols
[2024-05-20 16:09:00] [INFO ] Computed 181 invariants in 101 ms
[2024-05-20 16:09:01] [INFO ] After 922ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:09:02] [INFO ] [Nat]Absence check using 91 positive place invariants in 188 ms returned sat
[2024-05-20 16:09:02] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 107 ms returned sat
[2024-05-20 16:09:12] [INFO ] After 9768ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:09:12] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2024-05-20 16:09:14] [INFO ] After 2002ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 16:09:15] [INFO ] After 2764ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 519 ms.
[2024-05-20 16:09:15] [INFO ] After 14438ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 8462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8462/8462 places, 16380/16380 transitions.
Applied a total of 0 rules in 2672 ms. Remains 8462 /8462 variables (removed 0) and now considering 16380/16380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2672 ms. Remains : 8462/8462 places, 16380/16380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8462/8462 places, 16380/16380 transitions.
Applied a total of 0 rules in 2689 ms. Remains 8462 /8462 variables (removed 0) and now considering 16380/16380 (removed 0) transitions.
[2024-05-20 16:09:21] [INFO ] Invariant cache hit.
[2024-05-20 16:09:22] [INFO ] Implicit Places using invariants in 917 ms returned []
Implicit Place search using SMT only with invariants took 918 ms to find 0 implicit places.
[2024-05-20 16:09:22] [INFO ] Invariant cache hit.
[2024-05-20 16:09:22] [INFO ] Dead Transitions using invariants and state equation in 912 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4523 ms. Remains : 8462/8462 places, 16380/16380 transitions.
Graph (trivial) has 16102 edges and 8462 vertex of which 8186 / 8462 are part of one of the 90 SCC in 5 ms
Free SCC test removed 8096 places
Drop transitions removed 16102 transitions
Reduce isomorphic transitions removed 16102 transitions.
Graph (complete) has 819 edges and 366 vertex of which 12 are kept as prefixes of interest. Removing 354 places using SCC suffix rule.0 ms
Discarding 354 places :
Also discarding 258 output transitions
Drop transitions removed 258 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 10 place count 12 transition count 12
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 12 transition count 12
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 8 transition count 8
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 8 transition count 8
Applied a total of 22 rules in 25 ms. Remains 8 /8462 variables (removed 8454) and now considering 8/16380 (removed 16372) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 8 cols
[2024-05-20 16:09:22] [INFO ] Computed 4 invariants in 0 ms
[2024-05-20 16:09:22] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:09:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-20 16:09:23] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:09:23] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-20 16:09:23] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 113 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 8642 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8642/8642 places, 16560/16560 transitions.
Applied a total of 0 rules in 2895 ms. Remains 8642 /8642 variables (removed 0) and now considering 16560/16560 (removed 0) transitions.
// Phase 1: matrix 16560 rows 8642 cols
[2024-05-20 16:09:26] [INFO ] Computed 181 invariants in 111 ms
[2024-05-20 16:09:27] [INFO ] Implicit Places using invariants in 930 ms returned []
Implicit Place search using SMT only with invariants took 934 ms to find 0 implicit places.
[2024-05-20 16:09:27] [INFO ] Invariant cache hit.
[2024-05-20 16:09:27] [INFO ] Dead Transitions using invariants and state equation in 808 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4640 ms. Remains : 8642/8642 places, 16560/16560 transitions.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 114 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 16:09:28] [INFO ] Invariant cache hit.
[2024-05-20 16:09:29] [INFO ] After 932ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:09:30] [INFO ] [Nat]Absence check using 91 positive place invariants in 199 ms returned sat
[2024-05-20 16:09:30] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 111 ms returned sat
[2024-05-20 16:09:42] [INFO ] After 11194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:09:42] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2024-05-20 16:09:44] [INFO ] After 2327ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 16:09:45] [INFO ] After 3048ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 671 ms.
[2024-05-20 16:09:45] [INFO ] After 16469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 8642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8642/8642 places, 16560/16560 transitions.
Free-agglomeration rule applied 180 times.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 8642 transition count 16380
Reduce places removed 180 places and 0 transitions.
Iterating post reduction 0 with 180 rules applied. Total rules applied 360 place count 8462 transition count 16380
Applied a total of 360 rules in 5792 ms. Remains 8462 /8642 variables (removed 180) and now considering 16380/16560 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5793 ms. Remains : 8462/8642 places, 16380/16560 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 100304 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100304 steps, saw 91173 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16380 rows 8462 cols
[2024-05-20 16:09:55] [INFO ] Computed 181 invariants in 121 ms
[2024-05-20 16:09:56] [INFO ] After 974ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:09:57] [INFO ] [Nat]Absence check using 91 positive place invariants in 181 ms returned sat
[2024-05-20 16:09:57] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 109 ms returned sat
[2024-05-20 16:10:07] [INFO ] After 10017ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:10:07] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2024-05-20 16:10:09] [INFO ] After 2379ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 16:10:10] [INFO ] After 3225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 537 ms.
[2024-05-20 16:10:11] [INFO ] After 15142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 8462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8462/8462 places, 16380/16380 transitions.
Applied a total of 0 rules in 2769 ms. Remains 8462 /8462 variables (removed 0) and now considering 16380/16380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2769 ms. Remains : 8462/8462 places, 16380/16380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8462/8462 places, 16380/16380 transitions.
Applied a total of 0 rules in 2806 ms. Remains 8462 /8462 variables (removed 0) and now considering 16380/16380 (removed 0) transitions.
[2024-05-20 16:10:16] [INFO ] Invariant cache hit.
[2024-05-20 16:10:17] [INFO ] Implicit Places using invariants in 792 ms returned []
Implicit Place search using SMT only with invariants took 794 ms to find 0 implicit places.
[2024-05-20 16:10:17] [INFO ] Invariant cache hit.
[2024-05-20 16:10:18] [INFO ] Dead Transitions using invariants and state equation in 862 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4467 ms. Remains : 8462/8462 places, 16380/16380 transitions.
Graph (trivial) has 16102 edges and 8462 vertex of which 8186 / 8462 are part of one of the 90 SCC in 5 ms
Free SCC test removed 8096 places
Drop transitions removed 16102 transitions
Reduce isomorphic transitions removed 16102 transitions.
Graph (complete) has 819 edges and 366 vertex of which 12 are kept as prefixes of interest. Removing 354 places using SCC suffix rule.1 ms
Discarding 354 places :
Also discarding 258 output transitions
Drop transitions removed 258 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 10 place count 12 transition count 12
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 12 transition count 12
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 8 transition count 8
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 8 transition count 8
Applied a total of 22 rules in 24 ms. Remains 8 /8462 variables (removed 8454) and now considering 8/16380 (removed 16372) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 8 cols
[2024-05-20 16:10:18] [INFO ] Computed 4 invariants in 0 ms
[2024-05-20 16:10:18] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:10:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-20 16:10:18] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:10:18] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 16:10:18] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 127 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 126 reset in 2226 ms.
Product exploration explored 100000 steps with 125 reset in 2327 ms.
Built C files in :
/tmp/ltsmin12351098866978524372
[2024-05-20 16:10:23] [INFO ] Too many transitions (16560) to apply POR reductions. Disabling POR matrices.
[2024-05-20 16:10:23] [INFO ] Built C files in 145ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12351098866978524372
Running compilation step : cd /tmp/ltsmin12351098866978524372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin12351098866978524372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12351098866978524372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 4 out of 8642 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8642/8642 places, 16560/16560 transitions.
Applied a total of 0 rules in 2930 ms. Remains 8642 /8642 variables (removed 0) and now considering 16560/16560 (removed 0) transitions.
// Phase 1: matrix 16560 rows 8642 cols
[2024-05-20 16:10:29] [INFO ] Computed 181 invariants in 125 ms
[2024-05-20 16:10:30] [INFO ] Implicit Places using invariants in 1072 ms returned []
Implicit Place search using SMT only with invariants took 1079 ms to find 0 implicit places.
[2024-05-20 16:10:30] [INFO ] Invariant cache hit.
[2024-05-20 16:10:31] [INFO ] Dead Transitions using invariants and state equation in 889 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4903 ms. Remains : 8642/8642 places, 16560/16560 transitions.
Built C files in :
/tmp/ltsmin13826480817304459005
[2024-05-20 16:10:31] [INFO ] Too many transitions (16560) to apply POR reductions. Disabling POR matrices.
[2024-05-20 16:10:31] [INFO ] Built C files in 110ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13826480817304459005
Running compilation step : cd /tmp/ltsmin13826480817304459005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin13826480817304459005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13826480817304459005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2024-05-20 16:10:35] [INFO ] Flatten gal took : 576 ms
[2024-05-20 16:10:36] [INFO ] Flatten gal took : 468 ms
[2024-05-20 16:10:36] [INFO ] Time to serialize gal into /tmp/LTL6655075725397682241.gal : 62 ms
[2024-05-20 16:10:36] [INFO ] Time to serialize properties into /tmp/LTL9037105103158562373.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6655075725397682241.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12547055599280745905.hoa' '-atoms' '/tmp/LTL9037105103158562373.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9037105103158562373.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12547055599280745905.hoa
Detected timeout of ITS tools.
[2024-05-20 16:10:51] [INFO ] Flatten gal took : 374 ms
[2024-05-20 16:10:52] [INFO ] Flatten gal took : 389 ms
[2024-05-20 16:10:52] [INFO ] Time to serialize gal into /tmp/LTL4115321354099580963.gal : 60 ms
[2024-05-20 16:10:52] [INFO ] Time to serialize properties into /tmp/LTL10388419943116456436.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4115321354099580963.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10388419943116456436.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(Node66requestsent69>Node60requestsent64)")||(F("(Node48requestsent30<=Node34requestsent71)"))))))
Formula 0 simplified : G(F!"(Node66requestsent69>Node60requestsent64)" & FG!"(Node48requestsent30<=Node34requestsent71)")
Detected timeout of ITS tools.
[2024-05-20 16:11:07] [INFO ] Flatten gal took : 435 ms
[2024-05-20 16:11:07] [INFO ] Applying decomposition
[2024-05-20 16:11:08] [INFO ] Flatten gal took : 458 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11158969313555264898.txt' '-o' '/tmp/graph11158969313555264898.bin' '-w' '/tmp/graph11158969313555264898.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11158969313555264898.bin' '-l' '-1' '-v' '-w' '/tmp/graph11158969313555264898.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:11:09] [INFO ] Decomposing Gal with order
[2024-05-20 16:11:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:11:12] [INFO ] Removed a total of 15993 redundant transitions.
[2024-05-20 16:11:12] [INFO ] Flatten gal took : 2311 ms
[2024-05-20 16:11:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 15832 labels/synchronizations in 2452 ms.
[2024-05-20 16:11:15] [INFO ] Time to serialize gal into /tmp/LTL4915453681683387248.gal : 82 ms
[2024-05-20 16:11:15] [INFO ] Time to serialize properties into /tmp/LTL2771337149922271656.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4915453681683387248.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2771337149922271656.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G(("(gu92.Node66requestsent69>gu92.Node60requestsent64)")||(F("(gu91.Node48requestsent30<=gu91.Node34requestsent71)"))))))
Formula 0 simplified : G(F!"(gu92.Node66requestsent69>gu92.Node60requestsent64)" & FG!"(gu91.Node48requestsent30<=gu91.Node34requestsent71)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8627611225708463812
[2024-05-20 16:11:31] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8627611225708463812
Running compilation step : cd /tmp/ltsmin8627611225708463812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin8627611225708463812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8627611225708463812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 CANConstruction-PT-090-LTLCardinality-01 finished in 195693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 9384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9384/9384 places, 17324/17324 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9384 transition count 16694
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8754 transition count 16694
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 1282 place count 8732 transition count 16650
Iterating global reduction 2 with 22 rules applied. Total rules applied 1304 place count 8732 transition count 16650
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1484 place count 8642 transition count 16560
Applied a total of 1484 rules in 8652 ms. Remains 8642 /9384 variables (removed 742) and now considering 16560/17324 (removed 764) transitions.
[2024-05-20 16:11:42] [INFO ] Invariant cache hit.
[2024-05-20 16:11:43] [INFO ] Implicit Places using invariants in 867 ms returned []
Implicit Place search using SMT only with invariants took 869 ms to find 0 implicit places.
[2024-05-20 16:11:43] [INFO ] Invariant cache hit.
[2024-05-20 16:11:44] [INFO ] Dead Transitions using invariants and state equation in 852 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8642/9384 places, 16560/17324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10378 ms. Remains : 8642/9384 places, 16560/17324 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s4667), p0:(LEQ s8430 s3353)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 124 reset in 2692 ms.
Product exploration explored 100000 steps with 124 reset in 2803 ms.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 143680 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 143680 steps, saw 141055 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-20 16:11:53] [INFO ] Invariant cache hit.
[2024-05-20 16:11:54] [INFO ] After 1067ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:11:56] [INFO ] [Nat]Absence check using 91 positive place invariants in 196 ms returned sat
[2024-05-20 16:11:56] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 111 ms returned sat
[2024-05-20 16:12:08] [INFO ] After 11837ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:12:08] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2024-05-20 16:12:11] [INFO ] After 2677ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 16:12:12] [INFO ] After 4299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1121 ms.
[2024-05-20 16:12:13] [INFO ] After 18999ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 7 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 155 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 8642 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8642/8642 places, 16560/16560 transitions.
Applied a total of 0 rules in 2946 ms. Remains 8642 /8642 variables (removed 0) and now considering 16560/16560 (removed 0) transitions.
[2024-05-20 16:12:17] [INFO ] Invariant cache hit.
[2024-05-20 16:12:18] [INFO ] Implicit Places using invariants in 955 ms returned []
Implicit Place search using SMT only with invariants took 956 ms to find 0 implicit places.
[2024-05-20 16:12:18] [INFO ] Invariant cache hit.
[2024-05-20 16:12:19] [INFO ] Dead Transitions using invariants and state equation in 930 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4838 ms. Remains : 8642/8642 places, 16560/16560 transitions.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 16:12:19] [INFO ] Invariant cache hit.
[2024-05-20 16:12:20] [INFO ] After 877ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:12:21] [INFO ] [Nat]Absence check using 91 positive place invariants in 198 ms returned sat
[2024-05-20 16:12:21] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 110 ms returned sat
[2024-05-20 16:12:32] [INFO ] After 10898ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:12:32] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2024-05-20 16:12:34] [INFO ] After 2000ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 16:12:35] [INFO ] After 2736ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 603 ms.
[2024-05-20 16:12:36] [INFO ] After 15656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 145 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 126 reset in 2348 ms.
Product exploration explored 100000 steps with 124 reset in 2419 ms.
Built C files in :
/tmp/ltsmin15102679557067300483
[2024-05-20 16:12:41] [INFO ] Too many transitions (16560) to apply POR reductions. Disabling POR matrices.
[2024-05-20 16:12:41] [INFO ] Built C files in 123ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15102679557067300483
Running compilation step : cd /tmp/ltsmin15102679557067300483;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin15102679557067300483;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15102679557067300483;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 3 out of 8642 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8642/8642 places, 16560/16560 transitions.
Applied a total of 0 rules in 2920 ms. Remains 8642 /8642 variables (removed 0) and now considering 16560/16560 (removed 0) transitions.
[2024-05-20 16:12:47] [INFO ] Invariant cache hit.
[2024-05-20 16:12:48] [INFO ] Implicit Places using invariants in 929 ms returned []
Implicit Place search using SMT only with invariants took 930 ms to find 0 implicit places.
[2024-05-20 16:12:48] [INFO ] Invariant cache hit.
[2024-05-20 16:12:49] [INFO ] Dead Transitions using invariants and state equation in 873 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4729 ms. Remains : 8642/8642 places, 16560/16560 transitions.
Built C files in :
/tmp/ltsmin10753622032723415520
[2024-05-20 16:12:49] [INFO ] Too many transitions (16560) to apply POR reductions. Disabling POR matrices.
[2024-05-20 16:12:49] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10753622032723415520
Running compilation step : cd /tmp/ltsmin10753622032723415520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin10753622032723415520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10753622032723415520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2024-05-20 16:12:53] [INFO ] Flatten gal took : 418 ms
[2024-05-20 16:12:53] [INFO ] Flatten gal took : 448 ms
[2024-05-20 16:12:53] [INFO ] Time to serialize gal into /tmp/LTL5131362208723400392.gal : 66 ms
[2024-05-20 16:12:53] [INFO ] Time to serialize properties into /tmp/LTL553913558306649527.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5131362208723400392.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7461628477464201959.hoa' '-atoms' '/tmp/LTL553913558306649527.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL553913558306649527.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7461628477464201959.hoa
Detected timeout of ITS tools.
[2024-05-20 16:13:09] [INFO ] Flatten gal took : 422 ms
[2024-05-20 16:13:09] [INFO ] Flatten gal took : 409 ms
[2024-05-20 16:13:09] [INFO ] Time to serialize gal into /tmp/LTL10188135375850577164.gal : 73 ms
[2024-05-20 16:13:09] [INFO ] Time to serialize properties into /tmp/LTL18106250352758532247.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10188135375850577164.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18106250352758532247.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("(Node87requestsent55<=Node30requestsent52)")||(G("(Node45requestsent30>=1)"))))))
Formula 0 simplified : G(F!"(Node45requestsent30>=1)" & FG!"(Node87requestsent55<=Node30requestsent52)")
Detected timeout of ITS tools.
[2024-05-20 16:13:25] [INFO ] Flatten gal took : 394 ms
[2024-05-20 16:13:25] [INFO ] Applying decomposition
[2024-05-20 16:13:25] [INFO ] Flatten gal took : 414 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6032628339213129893.txt' '-o' '/tmp/graph6032628339213129893.bin' '-w' '/tmp/graph6032628339213129893.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6032628339213129893.bin' '-l' '-1' '-v' '-w' '/tmp/graph6032628339213129893.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:13:26] [INFO ] Decomposing Gal with order
[2024-05-20 16:13:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:13:29] [INFO ] Removed a total of 15990 redundant transitions.
[2024-05-20 16:13:29] [INFO ] Flatten gal took : 2092 ms
[2024-05-20 16:13:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 15836 labels/synchronizations in 2281 ms.
[2024-05-20 16:13:32] [INFO ] Time to serialize gal into /tmp/LTL3148105603004123340.gal : 65 ms
[2024-05-20 16:13:32] [INFO ] Time to serialize properties into /tmp/LTL7246176831149317127.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3148105603004123340.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7246176831149317127.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("(gu91.Node87requestsent55<=gu91.Node30requestsent52)")||(G("(gi0.gu46.Node45requestsent30>=1)"))))))
Formula 0 simplified : G(F!"(gi0.gu46.Node45requestsent30>=1)" & FG!"(gu91.Node87requestsent55<=gu91.Node30requestsent52)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin863203376332348178
[2024-05-20 16:13:47] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin863203376332348178
Running compilation step : cd /tmp/ltsmin863203376332348178;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin863203376332348178;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin863203376332348178;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 CANConstruction-PT-090-LTLCardinality-03 finished in 136687 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(((X(p0)&&F(p1))||G(p0))) U G(p2)))'
Support contains 7 out of 9384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9384/9384 places, 17324/17324 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9384 transition count 16694
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8754 transition count 16694
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1279 place count 8735 transition count 16656
Iterating global reduction 2 with 19 rules applied. Total rules applied 1298 place count 8735 transition count 16656
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1478 place count 8645 transition count 16566
Applied a total of 1478 rules in 8074 ms. Remains 8645 /9384 variables (removed 739) and now considering 16566/17324 (removed 758) transitions.
// Phase 1: matrix 16566 rows 8645 cols
[2024-05-20 16:13:59] [INFO ] Computed 181 invariants in 115 ms
[2024-05-20 16:13:59] [INFO ] Implicit Places using invariants in 910 ms returned []
Implicit Place search using SMT only with invariants took 911 ms to find 0 implicit places.
[2024-05-20 16:13:59] [INFO ] Invariant cache hit.
[2024-05-20 16:14:00] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8645/9384 places, 16566/17324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9755 ms. Remains : 8645/9384 places, 16566/17324 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (GT s6967 s7917) (LEQ s8027 s2735)), p1:(GT s6475 s8029), p0:(GT 1 s7795)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 124 reset in 2218 ms.
Product exploration explored 100000 steps with 127 reset in 2272 ms.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 164 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 783 ms. (steps per millisecond=12 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 138602 steps, run timeout after 3003 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138602 steps, saw 136045 distinct states, run finished after 3003 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-20 16:14:09] [INFO ] Invariant cache hit.
[2024-05-20 16:14:10] [INFO ] After 1268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-20 16:14:12] [INFO ] [Nat]Absence check using 91 positive place invariants in 190 ms returned sat
[2024-05-20 16:14:12] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 97 ms returned sat
[2024-05-20 16:14:25] [INFO ] After 12230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-20 16:14:25] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2024-05-20 16:14:29] [INFO ] After 4690ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-20 16:14:33] [INFO ] After 8492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2096 ms.
[2024-05-20 16:14:35] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 7 out of 8645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8645/8645 places, 16566/16566 transitions.
Free-agglomeration rule applied 174 times.
Iterating global reduction 0 with 174 rules applied. Total rules applied 174 place count 8645 transition count 16392
Reduce places removed 174 places and 0 transitions.
Iterating post reduction 0 with 174 rules applied. Total rules applied 348 place count 8471 transition count 16392
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 354 place count 8471 transition count 16392
Applied a total of 354 rules in 8263 ms. Remains 8471 /8645 variables (removed 174) and now considering 16392/16566 (removed 174) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8263 ms. Remains : 8471/8645 places, 16392/16566 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 16392 rows 8471 cols
[2024-05-20 16:14:44] [INFO ] Computed 181 invariants in 98 ms
[2024-05-20 16:14:45] [INFO ] After 933ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:14:46] [INFO ] [Nat]Absence check using 91 positive place invariants in 187 ms returned sat
[2024-05-20 16:14:46] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 107 ms returned sat
[2024-05-20 16:14:57] [INFO ] After 10455ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:14:57] [INFO ] State equation strengthened by 16203 read => feed constraints.
[2024-05-20 16:14:59] [INFO ] After 2395ms SMT Verify possible using 16203 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 16:15:01] [INFO ] After 3879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 947 ms.
[2024-05-20 16:15:02] [INFO ] After 16844ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 8471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8471/8471 places, 16392/16392 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8470 transition count 16391
Applied a total of 2 rules in 5087 ms. Remains 8470 /8471 variables (removed 1) and now considering 16391/16392 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5087 ms. Remains : 8470/8471 places, 16391/16392 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 97576 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97576 steps, saw 90556 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 16391 rows 8470 cols
[2024-05-20 16:15:11] [INFO ] Computed 181 invariants in 102 ms
[2024-05-20 16:15:11] [INFO ] After 923ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:15:13] [INFO ] [Nat]Absence check using 91 positive place invariants in 166 ms returned sat
[2024-05-20 16:15:13] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 86 ms returned sat
[2024-05-20 16:15:23] [INFO ] After 10416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:15:23] [INFO ] State equation strengthened by 16204 read => feed constraints.
[2024-05-20 16:15:26] [INFO ] After 2849ms SMT Verify possible using 16204 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 16:15:28] [INFO ] After 4429ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1262 ms.
[2024-05-20 16:15:29] [INFO ] After 17608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 6 out of 8470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8470/8470 places, 16391/16391 transitions.
Applied a total of 0 rules in 2716 ms. Remains 8470 /8470 variables (removed 0) and now considering 16391/16391 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2716 ms. Remains : 8470/8470 places, 16391/16391 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8470/8470 places, 16391/16391 transitions.
Applied a total of 0 rules in 2706 ms. Remains 8470 /8470 variables (removed 0) and now considering 16391/16391 (removed 0) transitions.
[2024-05-20 16:15:34] [INFO ] Invariant cache hit.
[2024-05-20 16:15:35] [INFO ] Implicit Places using invariants in 778 ms returned []
Implicit Place search using SMT only with invariants took 784 ms to find 0 implicit places.
[2024-05-20 16:15:35] [INFO ] Invariant cache hit.
[2024-05-20 16:15:36] [INFO ] Dead Transitions using invariants and state equation in 789 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4306 ms. Remains : 8470/8470 places, 16391/16391 transitions.
Graph (trivial) has 16104 edges and 8470 vertex of which 8185 / 8470 are part of one of the 90 SCC in 5 ms
Free SCC test removed 8095 places
Drop transitions removed 16099 transitions
Reduce isomorphic transitions removed 16099 transitions.
Graph (complete) has 836 edges and 375 vertex of which 22 are kept as prefixes of interest. Removing 353 places using SCC suffix rule.1 ms
Discarding 353 places :
Also discarding 256 output transitions
Drop transitions removed 256 transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 22 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 20 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 20 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 18 transition count 20
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 18 transition count 20
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 34 place count 12 transition count 14
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 12 transition count 14
Applied a total of 40 rules in 36 ms. Remains 12 /8470 variables (removed 8458) and now considering 14/16391 (removed 16377) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 14 rows 12 cols
[2024-05-20 16:15:36] [INFO ] Computed 4 invariants in 0 ms
[2024-05-20 16:15:36] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:15:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-20 16:15:36] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:15:36] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-20 16:15:36] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 211 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 101 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 7 out of 8645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8645/8645 places, 16566/16566 transitions.
Applied a total of 0 rules in 2831 ms. Remains 8645 /8645 variables (removed 0) and now considering 16566/16566 (removed 0) transitions.
// Phase 1: matrix 16566 rows 8645 cols
[2024-05-20 16:15:40] [INFO ] Computed 181 invariants in 102 ms
[2024-05-20 16:15:40] [INFO ] Implicit Places using invariants in 968 ms returned []
Implicit Place search using SMT only with invariants took 989 ms to find 0 implicit places.
[2024-05-20 16:15:41] [INFO ] Invariant cache hit.
[2024-05-20 16:15:41] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4645 ms. Remains : 8645/8645 places, 16566/16566 transitions.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 141 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Finished Best-First random walk after 4143 steps, including 1 resets, run visited all 2 properties in 10 ms. (steps per millisecond=414 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT p2)), (F (NOT p0)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 11 factoid took 343 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 98 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 124 reset in 2194 ms.
Product exploration explored 100000 steps with 124 reset in 2247 ms.
Built C files in :
/tmp/ltsmin776064637696350592
[2024-05-20 16:15:47] [INFO ] Too many transitions (16566) to apply POR reductions. Disabling POR matrices.
[2024-05-20 16:15:47] [INFO ] Built C files in 117ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin776064637696350592
Running compilation step : cd /tmp/ltsmin776064637696350592;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin776064637696350592;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin776064637696350592;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 7 out of 8645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8645/8645 places, 16566/16566 transitions.
Applied a total of 0 rules in 2786 ms. Remains 8645 /8645 variables (removed 0) and now considering 16566/16566 (removed 0) transitions.
[2024-05-20 16:15:53] [INFO ] Invariant cache hit.
[2024-05-20 16:15:54] [INFO ] Implicit Places using invariants in 771 ms returned []
Implicit Place search using SMT only with invariants took 785 ms to find 0 implicit places.
[2024-05-20 16:15:54] [INFO ] Invariant cache hit.
[2024-05-20 16:15:55] [INFO ] Dead Transitions using invariants and state equation in 773 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4346 ms. Remains : 8645/8645 places, 16566/16566 transitions.
Built C files in :
/tmp/ltsmin2608718411694272264
[2024-05-20 16:15:55] [INFO ] Too many transitions (16566) to apply POR reductions. Disabling POR matrices.
[2024-05-20 16:15:55] [INFO ] Built C files in 102ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2608718411694272264
Running compilation step : cd /tmp/ltsmin2608718411694272264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin2608718411694272264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2608718411694272264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2024-05-20 16:15:59] [INFO ] Flatten gal took : 352 ms
[2024-05-20 16:15:59] [INFO ] Flatten gal took : 371 ms
[2024-05-20 16:15:59] [INFO ] Time to serialize gal into /tmp/LTL17434864780050775749.gal : 57 ms
[2024-05-20 16:15:59] [INFO ] Time to serialize properties into /tmp/LTL2167773640443334302.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17434864780050775749.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5665688533388567455.hoa' '-atoms' '/tmp/LTL2167773640443334302.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2167773640443334302.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5665688533388567455.hoa
Detected timeout of ITS tools.
[2024-05-20 16:16:15] [INFO ] Flatten gal took : 352 ms
[2024-05-20 16:16:15] [INFO ] Flatten gal took : 371 ms
[2024-05-20 16:16:15] [INFO ] Time to serialize gal into /tmp/LTL13060578187434482165.gal : 56 ms
[2024-05-20 16:16:15] [INFO ] Time to serialize properties into /tmp/LTL6524600280290371047.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13060578187434482165.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6524600280290371047.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F((G("(Node80GiveAnswer41<1)"))||((X("(Node80GiveAnswer41<1)"))&&(F("(Node65requestsent57>Node83GiveAnswer7)")))))U(G("((Node71req...234
Formula 0 simplified : G(F!"(Node80GiveAnswer41<1)" & (X!"(Node80GiveAnswer41<1)" | G!"(Node65requestsent57>Node83GiveAnswer7)")) R F!"((Node71requestsent1...221
Detected timeout of ITS tools.
[2024-05-20 16:16:30] [INFO ] Flatten gal took : 364 ms
[2024-05-20 16:16:30] [INFO ] Applying decomposition
[2024-05-20 16:16:31] [INFO ] Flatten gal took : 409 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13214350598487010439.txt' '-o' '/tmp/graph13214350598487010439.bin' '-w' '/tmp/graph13214350598487010439.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13214350598487010439.bin' '-l' '-1' '-v' '-w' '/tmp/graph13214350598487010439.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:16:31] [INFO ] Decomposing Gal with order
[2024-05-20 16:16:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:16:34] [INFO ] Removed a total of 16016 redundant transitions.
[2024-05-20 16:16:34] [INFO ] Flatten gal took : 2105 ms
[2024-05-20 16:16:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 15836 labels/synchronizations in 2414 ms.
[2024-05-20 16:16:38] [INFO ] Time to serialize gal into /tmp/LTL8083641646733966013.gal : 67 ms
[2024-05-20 16:16:38] [INFO ] Time to serialize properties into /tmp/LTL10752426571274624986.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8083641646733966013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10752426571274624986.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F((G("(gi0.gu92.Node80GiveAnswer41<1)"))||((X("(gi0.gu92.Node80GiveAnswer41<1)"))&&(F("(gu94.Node65requestsent57>gu94.Node83GiveAn...282
Formula 0 simplified : G(F!"(gi0.gu92.Node80GiveAnswer41<1)" & (X!"(gi0.gu92.Node80GiveAnswer41<1)" | G!"(gu94.Node65requestsent57>gu94.Node83GiveAnswer7)"...269
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13838372266424892105
[2024-05-20 16:16:53] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13838372266424892105
Running compilation step : cd /tmp/ltsmin13838372266424892105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin13838372266424892105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13838372266424892105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 CANConstruction-PT-090-LTLCardinality-04 finished in 185389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 9384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9384/9384 places, 17324/17324 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 9363 transition count 17282
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 9363 transition count 17282
Applied a total of 42 rules in 5877 ms. Remains 9363 /9384 variables (removed 21) and now considering 17282/17324 (removed 42) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2024-05-20 16:17:02] [INFO ] Computed 181 invariants in 108 ms
[2024-05-20 16:17:03] [INFO ] Implicit Places using invariants in 957 ms returned []
Implicit Place search using SMT only with invariants took 972 ms to find 0 implicit places.
[2024-05-20 16:17:03] [INFO ] Invariant cache hit.
[2024-05-20 16:17:03] [INFO ] Dead Transitions using invariants and state equation in 863 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9384 places, 17282/17324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7714 ms. Remains : 9363/9384 places, 17282/17324 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-05 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 s4387 s3506)], 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 46366 steps with 28 reset in 750 ms.
FORMULA CANConstruction-PT-090-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLCardinality-05 finished in 8644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(G((G((X(p0) U p1))||p2)))))))'
Support contains 6 out of 9384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9384/9384 places, 17324/17324 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 9367 transition count 17290
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 9367 transition count 17290
Applied a total of 34 rules in 5866 ms. Remains 9367 /9384 variables (removed 17) and now considering 17290/17324 (removed 34) transitions.
// Phase 1: matrix 17290 rows 9367 cols
[2024-05-20 16:17:10] [INFO ] Computed 181 invariants in 145 ms
[2024-05-20 16:17:11] [INFO ] Implicit Places using invariants in 989 ms returned []
Implicit Place search using SMT only with invariants took 1006 ms to find 0 implicit places.
[2024-05-20 16:17:11] [INFO ] Invariant cache hit.
[2024-05-20 16:17:12] [INFO ] Dead Transitions using invariants and state equation in 829 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9367/9384 places, 17290/17324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7710 ms. Remains : 9367/9384 places, 17290/17324 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ s6261 s4670), p1:(LEQ s4897 s4898), p0:(LEQ s2161 s7821)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 62 reset in 1669 ms.
Product exploration explored 100000 steps with 61 reset in 1676 ms.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 122841 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122841 steps, saw 120895 distinct states, run finished after 3003 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-20 16:17:20] [INFO ] Invariant cache hit.
[2024-05-20 16:17:21] [INFO ] After 1521ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-20 16:17:23] [INFO ] [Nat]Absence check using 91 positive place invariants in 221 ms returned sat
[2024-05-20 16:17:23] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 125 ms returned sat
[2024-05-20 16:17:37] [INFO ] After 13179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-20 16:17:37] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2024-05-20 16:17:43] [INFO ] After 6298ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-20 16:18:15] [INFO ] Deduced a trap composed of 5 places in 28785 ms of which 20 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-20 16:18:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 16:18:15] [INFO ] After 53810ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 96 steps, including 0 resets, run visited all 5 properties in 6 ms. (steps per millisecond=16 )
Parikh walk visited 5 properties in 6 ms.
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 265 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 6 out of 9367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9367/9367 places, 17290/17290 transitions.
Applied a total of 0 rules in 2979 ms. Remains 9367 /9367 variables (removed 0) and now considering 17290/17290 (removed 0) transitions.
[2024-05-20 16:18:19] [INFO ] Invariant cache hit.
[2024-05-20 16:18:20] [INFO ] Implicit Places using invariants in 894 ms returned []
Implicit Place search using SMT only with invariants took 922 ms to find 0 implicit places.
[2024-05-20 16:18:20] [INFO ] Invariant cache hit.
[2024-05-20 16:18:20] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4793 ms. Remains : 9367/9367 places, 17290/17290 transitions.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 951 ms. (steps per millisecond=10 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 203731 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 203731 steps, saw 200377 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-20 16:18:25] [INFO ] Invariant cache hit.
[2024-05-20 16:18:26] [INFO ] After 1418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-20 16:18:28] [INFO ] [Nat]Absence check using 91 positive place invariants in 251 ms returned sat
[2024-05-20 16:18:28] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 129 ms returned sat
[2024-05-20 16:18:43] [INFO ] After 13795ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-20 16:18:43] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2024-05-20 16:18:49] [INFO ] After 6489ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-20 16:18:51] [INFO ] After 8729ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-20 16:18:51] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 96 steps, including 0 resets, run visited all 5 properties in 6 ms. (steps per millisecond=16 )
Parikh walk visited 5 properties in 6 ms.
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 235 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Product exploration explored 100000 steps with 61 reset in 1592 ms.
Product exploration explored 100000 steps with 62 reset in 1655 ms.
Applying partial POR strategy [false, false, false, true, false, true]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 6 out of 9367 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9367/9367 places, 17290/17290 transitions.
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 450 rules applied. Total rules applied 450 place count 9367 transition count 17290
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 90 Pre rules applied. Total rules applied 450 place count 9367 transition count 17290
Deduced a syphon composed of 540 places in 5 ms
Iterating global reduction 1 with 90 rules applied. Total rules applied 540 place count 9367 transition count 17290
Discarding 180 places :
Symmetric choice reduction at 1 with 180 rule applications. Total rules 720 place count 9187 transition count 17110
Deduced a syphon composed of 360 places in 4 ms
Iterating global reduction 1 with 180 rules applied. Total rules applied 900 place count 9187 transition count 17110
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 540 places in 3 ms
Iterating global reduction 1 with 180 rules applied. Total rules applied 1080 place count 9187 transition count 17110
Discarding 360 places :
Symmetric choice reduction at 1 with 360 rule applications. Total rules 1440 place count 8827 transition count 16750
Deduced a syphon composed of 180 places in 3 ms
Iterating global reduction 1 with 360 rules applied. Total rules applied 1800 place count 8827 transition count 16750
Deduced a syphon composed of 180 places in 2 ms
Applied a total of 1800 rules in 13194 ms. Remains 8827 /9367 variables (removed 540) and now considering 16750/17290 (removed 540) transitions.
// Phase 1: matrix 16750 rows 8827 cols
[2024-05-20 16:19:09] [INFO ] Computed 181 invariants in 108 ms
[2024-05-20 16:19:10] [INFO ] Dead Transitions using invariants and state equation in 950 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8827/9367 places, 16750/17290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14167 ms. Remains : 8827/9367 places, 16750/17290 transitions.
Built C files in :
/tmp/ltsmin10712073397009506327
[2024-05-20 16:19:10] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10712073397009506327
Running compilation step : cd /tmp/ltsmin10712073397009506327;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin10712073397009506327;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10712073397009506327;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 6 out of 9367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9367/9367 places, 17290/17290 transitions.
Applied a total of 0 rules in 3285 ms. Remains 9367 /9367 variables (removed 0) and now considering 17290/17290 (removed 0) transitions.
// Phase 1: matrix 17290 rows 9367 cols
[2024-05-20 16:19:17] [INFO ] Computed 181 invariants in 108 ms
[2024-05-20 16:19:17] [INFO ] Implicit Places using invariants in 936 ms returned []
Implicit Place search using SMT only with invariants took 938 ms to find 0 implicit places.
[2024-05-20 16:19:17] [INFO ] Invariant cache hit.
[2024-05-20 16:19:18] [INFO ] Dead Transitions using invariants and state equation in 797 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5036 ms. Remains : 9367/9367 places, 17290/17290 transitions.
Built C files in :
/tmp/ltsmin9795682126778737664
[2024-05-20 16:19:18] [INFO ] Built C files in 101ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9795682126778737664
Running compilation step : cd /tmp/ltsmin9795682126778737664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin9795682126778737664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9795682126778737664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2024-05-20 16:19:22] [INFO ] Flatten gal took : 401 ms
[2024-05-20 16:19:22] [INFO ] Flatten gal took : 395 ms
[2024-05-20 16:19:22] [INFO ] Time to serialize gal into /tmp/LTL3053732899577636017.gal : 79 ms
[2024-05-20 16:19:22] [INFO ] Time to serialize properties into /tmp/LTL4340661009504610114.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3053732899577636017.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2083739965651510157.hoa' '-atoms' '/tmp/LTL4340661009504610114.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4340661009504610114.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2083739965651510157.hoa
Detected timeout of ITS tools.
[2024-05-20 16:19:38] [INFO ] Flatten gal took : 410 ms
[2024-05-20 16:19:39] [INFO ] Flatten gal took : 388 ms
[2024-05-20 16:19:39] [INFO ] Time to serialize gal into /tmp/LTL7182339055847072663.gal : 60 ms
[2024-05-20 16:19:39] [INFO ] Time to serialize properties into /tmp/LTL6648198894525110324.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7182339055847072663.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6648198894525110324.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(X(X(G(G((G((X("(Node9GiveAnswer7<=Node72GiveAnswer56)"))U("(Node39GiveAnswer72<=Node39requestsent73)")))||("(Node55GiveAnswer10<=...183
Formula 0 simplified : XXF(!"(Node55GiveAnswer10<=Node37GiveAnswer23)" & F(!"(Node39GiveAnswer72<=Node39requestsent73)" & X(!"(Node39GiveAnswer72<=Node39re...215
Detected timeout of ITS tools.
[2024-05-20 16:19:54] [INFO ] Flatten gal took : 364 ms
[2024-05-20 16:19:54] [INFO ] Applying decomposition
[2024-05-20 16:19:54] [INFO ] Flatten gal took : 380 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16936298328949807383.txt' '-o' '/tmp/graph16936298328949807383.bin' '-w' '/tmp/graph16936298328949807383.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16936298328949807383.bin' '-l' '-1' '-v' '-w' '/tmp/graph16936298328949807383.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:19:55] [INFO ] Decomposing Gal with order
[2024-05-20 16:19:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:19:58] [INFO ] Removed a total of 16256 redundant transitions.
[2024-05-20 16:19:58] [INFO ] Flatten gal took : 2102 ms
[2024-05-20 16:20:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 15858 labels/synchronizations in 2359 ms.
[2024-05-20 16:20:02] [INFO ] Time to serialize gal into /tmp/LTL3112328341898039106.gal : 72 ms
[2024-05-20 16:20:02] [INFO ] Time to serialize properties into /tmp/LTL4641624754076734879.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3112328341898039106.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4641624754076734879.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(X(X(G(G((G((X("(gu362.Node9GiveAnswer7<=gu362.Node72GiveAnswer56)"))U("(gu364.Node39GiveAnswer72<=gu364.Node39requestsent73)")))|...219
Formula 0 simplified : XXF(!"(gu363.Node55GiveAnswer10<=gu363.Node37GiveAnswer23)" & F(!"(gu364.Node39GiveAnswer72<=gu364.Node39requestsent73)" & X(!"(gu36...263
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13617113655212300661
[2024-05-20 16:20:17] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13617113655212300661
Running compilation step : cd /tmp/ltsmin13617113655212300661;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin13617113655212300661;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13617113655212300661;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 CANConstruction-PT-090-LTLCardinality-06 finished in 195695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 9384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9384/9384 places, 17324/17324 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 9363 transition count 17282
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 9363 transition count 17282
Applied a total of 42 rules in 6714 ms. Remains 9363 /9384 variables (removed 21) and now considering 17282/17324 (removed 42) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2024-05-20 16:20:27] [INFO ] Computed 181 invariants in 111 ms
[2024-05-20 16:20:28] [INFO ] Implicit Places using invariants in 1112 ms returned []
Implicit Place search using SMT only with invariants took 1113 ms to find 0 implicit places.
[2024-05-20 16:20:28] [INFO ] Invariant cache hit.
[2024-05-20 16:20:29] [INFO ] Dead Transitions using invariants and state equation in 851 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9384 places, 17282/17324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8690 ms. Remains : 9363/9384 places, 17282/17324 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s8860 s9349)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 23747 steps with 15 reset in 378 ms.
FORMULA CANConstruction-PT-090-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLCardinality-07 finished in 9210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(F(p0)))||(p0 U (G(p0)||(p0&&G(p1)))))))'
Support contains 3 out of 9384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9384/9384 places, 17324/17324 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 9364 transition count 17284
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 9364 transition count 17284
Applied a total of 40 rules in 6585 ms. Remains 9364 /9384 variables (removed 20) and now considering 17284/17324 (removed 40) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2024-05-20 16:20:36] [INFO ] Computed 181 invariants in 143 ms
[2024-05-20 16:20:37] [INFO ] Implicit Places using invariants in 972 ms returned []
Implicit Place search using SMT only with invariants took 982 ms to find 0 implicit places.
[2024-05-20 16:20:37] [INFO ] Invariant cache hit.
[2024-05-20 16:20:38] [INFO ] Dead Transitions using invariants and state equation in 831 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9364/9384 places, 17284/17324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8409 ms. Remains : 9364/9384 places, 17284/17324 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(GT 1 s6817), p1:(GT s6970 s4828)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 4025 ms.
Product exploration explored 100000 steps with 33333 reset in 4063 ms.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (OR (NOT p1) (NOT p0))), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-090-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-090-LTLCardinality-08 finished in 16775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 9384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9384/9384 places, 17324/17324 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 9364 transition count 17284
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 9364 transition count 17284
Applied a total of 40 rules in 6562 ms. Remains 9364 /9384 variables (removed 20) and now considering 17284/17324 (removed 40) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2024-05-20 16:20:53] [INFO ] Computed 181 invariants in 109 ms
[2024-05-20 16:20:54] [INFO ] Implicit Places using invariants in 1097 ms returned []
Implicit Place search using SMT only with invariants took 1098 ms to find 0 implicit places.
[2024-05-20 16:20:54] [INFO ] Invariant cache hit.
[2024-05-20 16:20:55] [INFO ] Dead Transitions using invariants and state equation in 820 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9364/9384 places, 17284/17324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8483 ms. Remains : 9364/9384 places, 17284/17324 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GT 1 s4843) (GT s2551 s503))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 39986 steps with 24 reset in 901 ms.
FORMULA CANConstruction-PT-090-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLCardinality-11 finished in 9544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F((p0&&F(!p0)))))))'
Support contains 2 out of 9384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9384/9384 places, 17324/17324 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 9364 transition count 17284
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 9364 transition count 17284
Applied a total of 40 rules in 6603 ms. Remains 9364 /9384 variables (removed 20) and now considering 17284/17324 (removed 40) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2024-05-20 16:21:02] [INFO ] Computed 181 invariants in 108 ms
[2024-05-20 16:21:03] [INFO ] Implicit Places using invariants in 1051 ms returned []
Implicit Place search using SMT only with invariants took 1061 ms to find 0 implicit places.
[2024-05-20 16:21:03] [INFO ] Invariant cache hit.
[2024-05-20 16:21:04] [INFO ] Dead Transitions using invariants and state equation in 914 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9364/9384 places, 17284/17324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8579 ms. Remains : 9364/9384 places, 17284/17324 transitions.
Stuttering acceptance computed with spot in 166 ms :[p0, (NOT p0), (NOT p0), true]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=p0, acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ s9238 s8223)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 5575 ms.
Product exploration explored 100000 steps with 50000 reset in 5629 ms.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-090-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-090-LTLCardinality-13 finished in 20062 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&X(p1))))))'
Found a Shortening insensitive property : CANConstruction-PT-090-LTLCardinality-00
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 9384 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 9384/9384 places, 17324/17324 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9384 transition count 16694
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8754 transition count 16694
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1279 place count 8735 transition count 16656
Iterating global reduction 2 with 19 rules applied. Total rules applied 1298 place count 8735 transition count 16656
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1478 place count 8645 transition count 16566
Applied a total of 1478 rules in 8752 ms. Remains 8645 /9384 variables (removed 739) and now considering 16566/17324 (removed 758) transitions.
// Phase 1: matrix 16566 rows 8645 cols
[2024-05-20 16:21:25] [INFO ] Computed 181 invariants in 99 ms
[2024-05-20 16:21:26] [INFO ] Implicit Places using invariants in 953 ms returned []
Implicit Place search using SMT only with invariants took 959 ms to find 0 implicit places.
[2024-05-20 16:21:26] [INFO ] Invariant cache hit.
[2024-05-20 16:21:26] [INFO ] Dead Transitions using invariants and state equation in 925 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 8645/9384 places, 16566/17324 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10638 ms. Remains : 8645/9384 places, 16566/17324 transitions.
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p0:(LEQ s3033 s3638), p1:(GT s4092 s4479)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 123 reset in 2186 ms.
Product exploration explored 100000 steps with 125 reset in 2357 ms.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 100 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-20 16:21:32] [INFO ] Invariant cache hit.
[2024-05-20 16:21:33] [INFO ] After 1078ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:21:34] [INFO ] [Nat]Absence check using 91 positive place invariants in 215 ms returned sat
[2024-05-20 16:21:34] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 116 ms returned sat
[2024-05-20 16:21:46] [INFO ] After 11101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:21:46] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2024-05-20 16:21:49] [INFO ] After 2963ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 16:21:50] [INFO ] After 4563ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1173 ms.
[2024-05-20 16:21:52] [INFO ] After 18575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 36 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=12 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 209 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 8645 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8645/8645 places, 16566/16566 transitions.
Applied a total of 0 rules in 2880 ms. Remains 8645 /8645 variables (removed 0) and now considering 16566/16566 (removed 0) transitions.
[2024-05-20 16:21:55] [INFO ] Invariant cache hit.
[2024-05-20 16:21:56] [INFO ] Implicit Places using invariants in 836 ms returned []
Implicit Place search using SMT only with invariants took 849 ms to find 0 implicit places.
[2024-05-20 16:21:56] [INFO ] Invariant cache hit.
[2024-05-20 16:21:57] [INFO ] Dead Transitions using invariants and state equation in 809 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4540 ms. Remains : 8645/8645 places, 16566/16566 transitions.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 123 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 107512 steps, run timeout after 3003 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107512 steps, saw 105237 distinct states, run finished after 3003 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-20 16:22:01] [INFO ] Invariant cache hit.
[2024-05-20 16:22:02] [INFO ] After 1312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 16:22:03] [INFO ] [Nat]Absence check using 91 positive place invariants in 222 ms returned sat
[2024-05-20 16:22:03] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 120 ms returned sat
[2024-05-20 16:22:17] [INFO ] After 13033ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 16:22:17] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2024-05-20 16:22:21] [INFO ] After 4114ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 16:22:24] [INFO ] After 7193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2262 ms.
[2024-05-20 16:22:26] [INFO ] After 24638ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 2 properties in 21 ms.
Support contains 4 out of 8645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8645/8645 places, 16566/16566 transitions.
Free-agglomeration rule applied 174 times.
Iterating global reduction 0 with 174 rules applied. Total rules applied 174 place count 8645 transition count 16392
Reduce places removed 174 places and 0 transitions.
Iterating post reduction 0 with 174 rules applied. Total rules applied 348 place count 8471 transition count 16392
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 354 place count 8471 transition count 16392
Applied a total of 354 rules in 9149 ms. Remains 8471 /8645 variables (removed 174) and now considering 16392/16566 (removed 174) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9149 ms. Remains : 8471/8645 places, 16392/16566 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 97738 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97738 steps, saw 90556 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 16392 rows 8471 cols
[2024-05-20 16:22:39] [INFO ] Computed 181 invariants in 139 ms
[2024-05-20 16:22:40] [INFO ] After 1074ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:22:41] [INFO ] [Nat]Absence check using 91 positive place invariants in 181 ms returned sat
[2024-05-20 16:22:42] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 108 ms returned sat
[2024-05-20 16:22:55] [INFO ] After 12881ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:22:55] [INFO ] State equation strengthened by 16203 read => feed constraints.
[2024-05-20 16:22:58] [INFO ] After 2806ms SMT Verify possible using 16203 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 16:22:59] [INFO ] After 4349ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1048 ms.
[2024-05-20 16:23:00] [INFO ] After 19945ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 8471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8471/8471 places, 16392/16392 transitions.
Applied a total of 0 rules in 2952 ms. Remains 8471 /8471 variables (removed 0) and now considering 16392/16392 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2952 ms. Remains : 8471/8471 places, 16392/16392 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8471/8471 places, 16392/16392 transitions.
Applied a total of 0 rules in 2917 ms. Remains 8471 /8471 variables (removed 0) and now considering 16392/16392 (removed 0) transitions.
[2024-05-20 16:23:06] [INFO ] Invariant cache hit.
[2024-05-20 16:23:07] [INFO ] Implicit Places using invariants in 866 ms returned []
Implicit Place search using SMT only with invariants took 867 ms to find 0 implicit places.
[2024-05-20 16:23:07] [INFO ] Invariant cache hit.
[2024-05-20 16:23:08] [INFO ] Dead Transitions using invariants and state equation in 767 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4558 ms. Remains : 8471/8471 places, 16392/16392 transitions.
Graph (trivial) has 16108 edges and 8471 vertex of which 8186 / 8471 are part of one of the 90 SCC in 4 ms
Free SCC test removed 8096 places
Drop transitions removed 16102 transitions
Reduce isomorphic transitions removed 16102 transitions.
Graph (complete) has 834 edges and 375 vertex of which 18 are kept as prefixes of interest. Removing 357 places using SCC suffix rule.1 ms
Discarding 357 places :
Also discarding 261 output transitions
Drop transitions removed 261 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 11 rules applied. Total rules applied 13 place count 18 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 16 place count 15 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 15 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 12 transition count 15
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 12 transition count 15
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 30 place count 8 transition count 11
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 8 transition count 11
Applied a total of 34 rules in 26 ms. Remains 8 /8471 variables (removed 8463) and now considering 11/16392 (removed 16381) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 8 cols
[2024-05-20 16:23:08] [INFO ] Computed 1 invariants in 1 ms
[2024-05-20 16:23:08] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:23:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 16:23:08] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:23:08] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 16:23:08] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 156 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 124 reset in 2491 ms.
Product exploration explored 100000 steps with 125 reset in 2433 ms.
Built C files in :
/tmp/ltsmin5063004355250182628
[2024-05-20 16:23:14] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5063004355250182628
Running compilation step : cd /tmp/ltsmin5063004355250182628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin5063004355250182628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5063004355250182628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 4 out of 8645 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8645/8645 places, 16566/16566 transitions.
Applied a total of 0 rules in 2787 ms. Remains 8645 /8645 variables (removed 0) and now considering 16566/16566 (removed 0) transitions.
// Phase 1: matrix 16566 rows 8645 cols
[2024-05-20 16:23:19] [INFO ] Computed 181 invariants in 103 ms
[2024-05-20 16:23:20] [INFO ] Implicit Places using invariants in 869 ms returned []
Implicit Place search using SMT only with invariants took 869 ms to find 0 implicit places.
[2024-05-20 16:23:20] [INFO ] Invariant cache hit.
[2024-05-20 16:23:21] [INFO ] Dead Transitions using invariants and state equation in 912 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4568 ms. Remains : 8645/8645 places, 16566/16566 transitions.
Built C files in :
/tmp/ltsmin1978940278003855944
[2024-05-20 16:23:21] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1978940278003855944
Running compilation step : cd /tmp/ltsmin1978940278003855944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin1978940278003855944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1978940278003855944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2024-05-20 16:23:25] [INFO ] Flatten gal took : 353 ms
[2024-05-20 16:23:25] [INFO ] Flatten gal took : 365 ms
[2024-05-20 16:23:25] [INFO ] Time to serialize gal into /tmp/LTL3897453908614623150.gal : 58 ms
[2024-05-20 16:23:25] [INFO ] Time to serialize properties into /tmp/LTL4103668037866382352.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3897453908614623150.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11619783412686088785.hoa' '-atoms' '/tmp/LTL4103668037866382352.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4103668037866382352.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11619783412686088785.hoa
Detected timeout of ITS tools.
[2024-05-20 16:23:41] [INFO ] Flatten gal took : 403 ms
[2024-05-20 16:23:41] [INFO ] Flatten gal took : 429 ms
[2024-05-20 16:23:41] [INFO ] Time to serialize gal into /tmp/LTL1934666551819781600.gal : 66 ms
[2024-05-20 16:23:41] [INFO ] Time to serialize properties into /tmp/LTL12686430892172941590.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1934666551819781600.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12686430892172941590.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(Node26GiveAnswer87<=Node33GiveAnswer68)"))||(("(Node38requestsent77>Node43GiveAnswer17)")&&(X("(Node38requestsent77>Node43...176
Formula 0 simplified : G(F!"(Node26GiveAnswer87<=Node33GiveAnswer68)" & FG(!"(Node38requestsent77>Node43GiveAnswer17)" | X!"(Node38requestsent77>Node43Give...167
Detected timeout of ITS tools.
[2024-05-20 16:23:57] [INFO ] Flatten gal took : 389 ms
[2024-05-20 16:23:57] [INFO ] Applying decomposition
[2024-05-20 16:23:57] [INFO ] Flatten gal took : 400 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13068450429293099986.txt' '-o' '/tmp/graph13068450429293099986.bin' '-w' '/tmp/graph13068450429293099986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13068450429293099986.bin' '-l' '-1' '-v' '-w' '/tmp/graph13068450429293099986.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:23:58] [INFO ] Decomposing Gal with order
[2024-05-20 16:23:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:24:01] [INFO ] Removed a total of 15987 redundant transitions.
[2024-05-20 16:24:01] [INFO ] Flatten gal took : 2139 ms
[2024-05-20 16:24:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 15844 labels/synchronizations in 2388 ms.
[2024-05-20 16:24:04] [INFO ] Time to serialize gal into /tmp/LTL8702096488583129141.gal : 76 ms
[2024-05-20 16:24:04] [INFO ] Time to serialize properties into /tmp/LTL13639282875491697731.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8702096488583129141.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13639282875491697731.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(gu93.Node26GiveAnswer87<=gu93.Node33GiveAnswer68)"))||(("(gu94.Node38requestsent77>gu94.Node43GiveAnswer17)")&&(X("(gu94.N...206
Formula 0 simplified : G(F!"(gu93.Node26GiveAnswer87<=gu93.Node33GiveAnswer68)" & FG(!"(gu94.Node38requestsent77>gu94.Node43GiveAnswer17)" | X!"(gu94.Node3...197
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12210307632098753865
[2024-05-20 16:24:19] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12210307632098753865
Running compilation step : cd /tmp/ltsmin12210307632098753865;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin12210307632098753865;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12210307632098753865;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 CANConstruction-PT-090-LTLCardinality-00 finished in 186629 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(((X(p0)&&F(p1))||G(p0))) U G(p2)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(G((G((X(p0) U p1))||p2)))))))'
Found a Lengthening insensitive property : CANConstruction-PT-090-LTLCardinality-06
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 6 out of 9384 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 9384/9384 places, 17324/17324 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9384 transition count 16694
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8754 transition count 16694
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1277 place count 8737 transition count 16660
Iterating global reduction 2 with 17 rules applied. Total rules applied 1294 place count 8737 transition count 16660
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1474 place count 8647 transition count 16570
Applied a total of 1474 rules in 9018 ms. Remains 8647 /9384 variables (removed 737) and now considering 16570/17324 (removed 754) transitions.
// Phase 1: matrix 16570 rows 8647 cols
[2024-05-20 16:24:32] [INFO ] Computed 181 invariants in 116 ms
[2024-05-20 16:24:33] [INFO ] Implicit Places using invariants in 1078 ms returned []
Implicit Place search using SMT only with invariants took 1079 ms to find 0 implicit places.
[2024-05-20 16:24:33] [INFO ] Invariant cache hit.
[2024-05-20 16:24:34] [INFO ] Dead Transitions using invariants and state equation in 965 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 8647/9384 places, 16570/17324 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 11065 ms. Remains : 8647/9384 places, 16570/17324 transitions.
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ s5541 s3950), p1:(LEQ s4177 s4178), p0:(LEQ s1441 s7101)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 124 reset in 2674 ms.
Product exploration explored 100000 steps with 124 reset in 2666 ms.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 472 ms. (steps per millisecond=21 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 116943 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116943 steps, saw 114551 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-20 16:24:43] [INFO ] Invariant cache hit.
[2024-05-20 16:24:45] [INFO ] After 1361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-20 16:24:46] [INFO ] [Nat]Absence check using 91 positive place invariants in 205 ms returned sat
[2024-05-20 16:24:46] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 105 ms returned sat
[2024-05-20 16:25:01] [INFO ] After 13697ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-20 16:25:01] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2024-05-20 16:25:06] [INFO ] After 4814ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-20 16:25:10] [INFO ] After 8866ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 89 ms.
[2024-05-20 16:25:10] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 14 ms.
Support contains 6 out of 8647 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8647/8647 places, 16570/16570 transitions.
Free-agglomeration rule applied 170 times.
Iterating global reduction 0 with 170 rules applied. Total rules applied 170 place count 8647 transition count 16400
Reduce places removed 170 places and 0 transitions.
Iterating post reduction 0 with 170 rules applied. Total rules applied 340 place count 8477 transition count 16400
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 350 place count 8477 transition count 16400
Applied a total of 350 rules in 9302 ms. Remains 8477 /8647 variables (removed 170) and now considering 16400/16570 (removed 170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9302 ms. Remains : 8477/8647 places, 16400/16570 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 95906 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95906 steps, saw 90117 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 16400 rows 8477 cols
[2024-05-20 16:25:23] [INFO ] Computed 181 invariants in 126 ms
[2024-05-20 16:25:24] [INFO ] After 1182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 16:25:25] [INFO ] [Nat]Absence check using 91 positive place invariants in 168 ms returned sat
[2024-05-20 16:25:25] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 103 ms returned sat
[2024-05-20 16:25:37] [INFO ] After 11005ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 16:25:37] [INFO ] State equation strengthened by 16205 read => feed constraints.
[2024-05-20 16:25:40] [INFO ] After 2933ms SMT Verify possible using 16205 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 16:25:42] [INFO ] After 5054ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1571 ms.
[2024-05-20 16:25:43] [INFO ] After 19468ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 8477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8477/8477 places, 16400/16400 transitions.
Applied a total of 0 rules in 3022 ms. Remains 8477 /8477 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3022 ms. Remains : 8477/8477 places, 16400/16400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8477/8477 places, 16400/16400 transitions.
Applied a total of 0 rules in 3078 ms. Remains 8477 /8477 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
[2024-05-20 16:25:49] [INFO ] Invariant cache hit.
[2024-05-20 16:25:50] [INFO ] Implicit Places using invariants in 801 ms returned []
Implicit Place search using SMT only with invariants took 802 ms to find 0 implicit places.
[2024-05-20 16:25:50] [INFO ] Invariant cache hit.
[2024-05-20 16:25:51] [INFO ] Dead Transitions using invariants and state equation in 788 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4671 ms. Remains : 8477/8477 places, 16400/16400 transitions.
Graph (trivial) has 16108 edges and 8477 vertex of which 8184 / 8477 are part of one of the 90 SCC in 5 ms
Free SCC test removed 8094 places
Drop transitions removed 16098 transitions
Reduce isomorphic transitions removed 16098 transitions.
Graph (complete) has 848 edges and 383 vertex of which 28 are kept as prefixes of interest. Removing 355 places using SCC suffix rule.1 ms
Discarding 355 places :
Also discarding 257 output transitions
Drop transitions removed 257 transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 17 rules applied. Total rules applied 19 place count 28 transition count 28
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 24 place count 23 transition count 28
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 24 place count 23 transition count 23
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 34 place count 18 transition count 23
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 18 transition count 23
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 46 place count 12 transition count 17
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 12 transition count 17
Applied a total of 52 rules in 23 ms. Remains 12 /8477 variables (removed 8465) and now considering 17/16400 (removed 16383) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 17 rows 12 cols
[2024-05-20 16:25:51] [INFO ] Computed 1 invariants in 1 ms
[2024-05-20 16:25:51] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 16:25:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-20 16:25:51] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 16:25:51] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-20 16:25:51] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 6 out of 8647 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8647/8647 places, 16570/16570 transitions.
Applied a total of 0 rules in 2841 ms. Remains 8647 /8647 variables (removed 0) and now considering 16570/16570 (removed 0) transitions.
// Phase 1: matrix 16570 rows 8647 cols
[2024-05-20 16:25:55] [INFO ] Computed 181 invariants in 104 ms
[2024-05-20 16:25:56] [INFO ] Implicit Places using invariants in 1023 ms returned []
Implicit Place search using SMT only with invariants took 1024 ms to find 0 implicit places.
[2024-05-20 16:25:56] [INFO ] Invariant cache hit.
[2024-05-20 16:25:57] [INFO ] Dead Transitions using invariants and state equation in 913 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4779 ms. Remains : 8647/8647 places, 16570/16570 transitions.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 116813 steps, run timeout after 3003 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116813 steps, saw 114422 distinct states, run finished after 3003 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-20 16:26:01] [INFO ] Invariant cache hit.
[2024-05-20 16:26:02] [INFO ] After 1437ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-20 16:26:03] [INFO ] [Nat]Absence check using 91 positive place invariants in 190 ms returned sat
[2024-05-20 16:26:03] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 86 ms returned sat
[2024-05-20 16:26:16] [INFO ] After 11917ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-20 16:26:16] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2024-05-20 16:26:21] [INFO ] After 5284ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-20 16:26:26] [INFO ] After 9655ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1294 ms.
[2024-05-20 16:26:27] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 21 ms.
Support contains 6 out of 8647 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8647/8647 places, 16570/16570 transitions.
Free-agglomeration rule applied 170 times.
Iterating global reduction 0 with 170 rules applied. Total rules applied 170 place count 8647 transition count 16400
Reduce places removed 170 places and 0 transitions.
Iterating post reduction 0 with 170 rules applied. Total rules applied 340 place count 8477 transition count 16400
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 350 place count 8477 transition count 16400
Applied a total of 350 rules in 9379 ms. Remains 8477 /8647 variables (removed 170) and now considering 16400/16570 (removed 170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9380 ms. Remains : 8477/8647 places, 16400/16570 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16400 rows 8477 cols
[2024-05-20 16:26:37] [INFO ] Computed 181 invariants in 127 ms
[2024-05-20 16:26:38] [INFO ] After 854ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:26:39] [INFO ] [Nat]Absence check using 91 positive place invariants in 162 ms returned sat
[2024-05-20 16:26:39] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 97 ms returned sat
[2024-05-20 16:26:49] [INFO ] After 10423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:26:49] [INFO ] State equation strengthened by 16205 read => feed constraints.
[2024-05-20 16:26:52] [INFO ] After 2248ms SMT Verify possible using 16205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 16:26:53] [INFO ] After 3071ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 561 ms.
[2024-05-20 16:26:53] [INFO ] After 15430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 8477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8477/8477 places, 16400/16400 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 8475 transition count 16398
Applied a total of 4 rules in 5736 ms. Remains 8475 /8477 variables (removed 2) and now considering 16398/16400 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5737 ms. Remains : 8475/8477 places, 16398/16400 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 100948 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100948 steps, saw 91347 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16398 rows 8475 cols
[2024-05-20 16:27:02] [INFO ] Computed 181 invariants in 101 ms
[2024-05-20 16:27:03] [INFO ] After 821ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:27:04] [INFO ] [Nat]Absence check using 91 positive place invariants in 171 ms returned sat
[2024-05-20 16:27:04] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 110 ms returned sat
[2024-05-20 16:27:14] [INFO ] After 9964ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:27:14] [INFO ] State equation strengthened by 16207 read => feed constraints.
[2024-05-20 16:27:17] [INFO ] After 2353ms SMT Verify possible using 16207 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 16:27:18] [INFO ] After 3213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 586 ms.
[2024-05-20 16:27:18] [INFO ] After 15115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 8475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8475/8475 places, 16398/16398 transitions.
Applied a total of 0 rules in 3008 ms. Remains 8475 /8475 variables (removed 0) and now considering 16398/16398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3009 ms. Remains : 8475/8475 places, 16398/16398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8475/8475 places, 16398/16398 transitions.
Applied a total of 0 rules in 2977 ms. Remains 8475 /8475 variables (removed 0) and now considering 16398/16398 (removed 0) transitions.
[2024-05-20 16:27:24] [INFO ] Invariant cache hit.
[2024-05-20 16:27:25] [INFO ] Implicit Places using invariants in 776 ms returned []
Implicit Place search using SMT only with invariants took 783 ms to find 0 implicit places.
[2024-05-20 16:27:25] [INFO ] Invariant cache hit.
[2024-05-20 16:27:26] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4567 ms. Remains : 8475/8475 places, 16398/16398 transitions.
Graph (trivial) has 16112 edges and 8475 vertex of which 8188 / 8475 are part of one of the 90 SCC in 4 ms
Free SCC test removed 8098 places
Drop transitions removed 16104 transitions
Reduce isomorphic transitions removed 16104 transitions.
Graph (complete) has 840 edges and 377 vertex of which 18 are kept as prefixes of interest. Removing 359 places using SCC suffix rule.0 ms
Discarding 359 places :
Also discarding 265 output transitions
Drop transitions removed 265 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 11 rules applied. Total rules applied 13 place count 18 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 16 place count 15 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 15 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 12 transition count 15
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 12 transition count 15
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 30 place count 8 transition count 11
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 8 transition count 11
Applied a total of 34 rules in 20 ms. Remains 8 /8475 variables (removed 8467) and now considering 11/16398 (removed 16387) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 8 cols
[2024-05-20 16:27:26] [INFO ] Computed 1 invariants in 0 ms
[2024-05-20 16:27:26] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:27:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 16:27:26] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:27:26] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 16:27:26] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Product exploration explored 100000 steps with 124 reset in 2159 ms.
Product exploration explored 100000 steps with 124 reset in 2250 ms.
Applying partial POR strategy [false, false, false, true, false, true]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 6 out of 8647 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8647/8647 places, 16570/16570 transitions.
Applied a total of 0 rules in 3138 ms. Remains 8647 /8647 variables (removed 0) and now considering 16570/16570 (removed 0) transitions.
// Phase 1: matrix 16570 rows 8647 cols
[2024-05-20 16:27:35] [INFO ] Computed 181 invariants in 109 ms
[2024-05-20 16:27:35] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4035 ms. Remains : 8647/8647 places, 16570/16570 transitions.
Built C files in :
/tmp/ltsmin12224052739668787296
[2024-05-20 16:27:36] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12224052739668787296
Running compilation step : cd /tmp/ltsmin12224052739668787296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin12224052739668787296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12224052739668787296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 6 out of 8647 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8647/8647 places, 16570/16570 transitions.
Applied a total of 0 rules in 2788 ms. Remains 8647 /8647 variables (removed 0) and now considering 16570/16570 (removed 0) transitions.
[2024-05-20 16:27:41] [INFO ] Invariant cache hit.
[2024-05-20 16:27:42] [INFO ] Implicit Places using invariants in 796 ms returned []
Implicit Place search using SMT only with invariants took 821 ms to find 0 implicit places.
[2024-05-20 16:27:42] [INFO ] Invariant cache hit.
[2024-05-20 16:27:43] [INFO ] Dead Transitions using invariants and state equation in 779 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4389 ms. Remains : 8647/8647 places, 16570/16570 transitions.
Built C files in :
/tmp/ltsmin17768787575656603577
[2024-05-20 16:27:43] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17768787575656603577
Running compilation step : cd /tmp/ltsmin17768787575656603577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin17768787575656603577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17768787575656603577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2024-05-20 16:27:47] [INFO ] Flatten gal took : 359 ms
[2024-05-20 16:27:47] [INFO ] Flatten gal took : 378 ms
[2024-05-20 16:27:47] [INFO ] Time to serialize gal into /tmp/LTL143856347154801956.gal : 56 ms
[2024-05-20 16:27:47] [INFO ] Time to serialize properties into /tmp/LTL13188935980280238556.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL143856347154801956.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3258621684682433124.hoa' '-atoms' '/tmp/LTL13188935980280238556.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL13188935980280238556.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3258621684682433124.hoa
Detected timeout of ITS tools.
[2024-05-20 16:28:03] [INFO ] Flatten gal took : 359 ms
[2024-05-20 16:28:03] [INFO ] Flatten gal took : 374 ms
[2024-05-20 16:28:03] [INFO ] Time to serialize gal into /tmp/LTL53914297176548386.gal : 56 ms
[2024-05-20 16:28:03] [INFO ] Time to serialize properties into /tmp/LTL7388730355765203429.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL53914297176548386.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7388730355765203429.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...273
Read 1 LTL properties
Checking formula 0 : !((G(X(X(G(G((G((X("(Node9GiveAnswer7<=Node72GiveAnswer56)"))U("(Node39GiveAnswer72<=Node39requestsent73)")))||("(Node55GiveAnswer10<=...183
Formula 0 simplified : XXF(!"(Node55GiveAnswer10<=Node37GiveAnswer23)" & F(!"(Node39GiveAnswer72<=Node39requestsent73)" & X(!"(Node39GiveAnswer72<=Node39re...215
Detected timeout of ITS tools.
[2024-05-20 16:28:19] [INFO ] Flatten gal took : 362 ms
[2024-05-20 16:28:19] [INFO ] Applying decomposition
[2024-05-20 16:28:19] [INFO ] Flatten gal took : 379 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11361033979399947975.txt' '-o' '/tmp/graph11361033979399947975.bin' '-w' '/tmp/graph11361033979399947975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11361033979399947975.bin' '-l' '-1' '-v' '-w' '/tmp/graph11361033979399947975.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:28:20] [INFO ] Decomposing Gal with order
[2024-05-20 16:28:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:28:22] [INFO ] Removed a total of 16014 redundant transitions.
[2024-05-20 16:28:22] [INFO ] Flatten gal took : 2089 ms
[2024-05-20 16:28:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 15848 labels/synchronizations in 2338 ms.
[2024-05-20 16:28:26] [INFO ] Time to serialize gal into /tmp/LTL15735402376603907331.gal : 67 ms
[2024-05-20 16:28:26] [INFO ] Time to serialize properties into /tmp/LTL13195267220592962165.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15735402376603907331.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13195267220592962165.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(X(X(G(G((G((X("(gu94.Node9GiveAnswer7<=gu94.Node72GiveAnswer56)"))U("(gu95.Node39GiveAnswer72<=gu95.Node39requestsent73)")))||("(...213
Formula 0 simplified : XXF(!"(gu96.Node55GiveAnswer10<=gu96.Node37GiveAnswer23)" & F(!"(gu95.Node39GiveAnswer72<=gu95.Node39requestsent73)" & X(!"(gu95.Nod...255
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15956383148671939345
[2024-05-20 16:28:41] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15956383148671939345
Running compilation step : cd /tmp/ltsmin15956383148671939345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin15956383148671939345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15956383148671939345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 CANConstruction-PT-090-LTLCardinality-06 finished in 261323 ms.
[2024-05-20 16:28:44] [INFO ] Flatten gal took : 380 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12415104031140178845
[2024-05-20 16:28:44] [INFO ] Too many transitions (17324) to apply POR reductions. Disabling POR matrices.
[2024-05-20 16:28:45] [INFO ] Built C files in 138ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12415104031140178845
Running compilation step : cd /tmp/ltsmin12415104031140178845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-20 16:28:45] [INFO ] Applying decomposition
[2024-05-20 16:28:45] [INFO ] Flatten gal took : 416 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5007685636664598951.txt' '-o' '/tmp/graph5007685636664598951.bin' '-w' '/tmp/graph5007685636664598951.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5007685636664598951.bin' '-l' '-1' '-v' '-w' '/tmp/graph5007685636664598951.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:28:46] [INFO ] Decomposing Gal with order
[2024-05-20 16:28:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:28:49] [INFO ] Removed a total of 16385 redundant transitions.
[2024-05-20 16:28:49] [INFO ] Flatten gal took : 2287 ms
[2024-05-20 16:28:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 15962 labels/synchronizations in 2493 ms.
[2024-05-20 16:28:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality10556551543979957456.gal : 105 ms
[2024-05-20 16:28:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality14333593177457434350.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10556551543979957456.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14333593177457434350.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 5 LTL properties
Checking formula 0 : !((G(F((G("(gu428.Node26GiveAnswer87<=gu428.Node33GiveAnswer68)"))||(("(gu435.Node38requestsent77>gu435.Node43GiveAnswer17)")&&(X("(gu...212
Formula 0 simplified : G(F!"(gu428.Node26GiveAnswer87<=gu428.Node33GiveAnswer68)" & FG(!"(gu435.Node38requestsent77>gu435.Node43GiveAnswer17)" | X!"(gu435....203
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/ltsmin12415104031140178845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 144 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12415104031140178845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 144 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)
ITS-tools command line returned an error code 137
[2024-05-20 16:42:04] [INFO ] Flatten gal took : 715 ms
[2024-05-20 16:42:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality3838111077108083427.gal : 96 ms
[2024-05-20 16:42:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality17177285009133557491.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3838111077108083427.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17177285009133557491.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 5 LTL properties
Checking formula 0 : !((G(F((G("(Node26GiveAnswer87<=Node33GiveAnswer68)"))||(("(Node38requestsent77>Node43GiveAnswer17)")&&(X("(Node38requestsent77>Node43...176
Formula 0 simplified : G(F!"(Node26GiveAnswer87<=Node33GiveAnswer68)" & FG(!"(Node38requestsent77>Node43GiveAnswer17)" | X!"(Node38requestsent77>Node43Give...167
ITS-tools command line returned an error code 137
[2024-05-20 17:01:53] [INFO ] Flatten gal took : 12369 ms
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15619296 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15520616 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CANConstruction-PT-090, 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 r087-tall-171620521400047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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