Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r087-tall-171620521400052.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-100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521400052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:32 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 15M 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-100-LTLCardinality-00
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-01
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-02
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-03
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-04
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-05
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-06
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-07
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-08
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-09
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-10
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-11
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-12
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-13
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-14
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716222798199

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-100
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-20 16:33:19] [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:33:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 16:33:20] [INFO ] Load time of PNML (sax parser for PT used): 794 ms
[2024-05-20 16:33:20] [INFO ] Transformed 21202 places.
[2024-05-20 16:33:20] [INFO ] Transformed 40800 transitions.
[2024-05-20 16:33:20] [INFO ] Parsed PT model containing 21202 places and 40800 transitions and 122000 arcs in 1010 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANConstruction-PT-100-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 321 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2024-05-20 16:33:22] [INFO ] Computed 201 invariants in 657 ms
[2024-05-20 16:33:24] [INFO ] Implicit Places using invariants in 2755 ms returned []
Implicit Place search using SMT only with invariants took 2778 ms to find 0 implicit places.
[2024-05-20 16:33:24] [INFO ] Invariant cache hit.
[2024-05-20 16:33:26] [INFO ] Dead Transitions using invariants and state equation in 1954 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5067 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Support contains 34 out of 21202 places after structural reductions.
[2024-05-20 16:33:27] [INFO ] Flatten gal took : 1208 ms
[2024-05-20 16:33:28] [INFO ] Flatten gal took : 952 ms
[2024-05-20 16:33:30] [INFO ] Input system was already deterministic with 40800 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 1032 ms. (steps per millisecond=9 ) properties (out of 24) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) seen :0
Interrupted probabilistic random walk after 85800 steps, run timeout after 3002 ms. (steps per millisecond=28 ) properties seen :{7=1, 13=1}
Probabilistic random walk after 85800 steps, saw 84676 distinct states, run finished after 3003 ms. (steps per millisecond=28 ) properties seen :2
Running SMT prover for 20 properties.
[2024-05-20 16:33:35] [INFO ] Invariant cache hit.
[2024-05-20 16:33:42] [INFO ] After 7762ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2024-05-20 16:33:50] [INFO ] [Nat]Absence check using 101 positive place invariants in 442 ms returned sat
[2024-05-20 16:33:50] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 177 ms returned sat
[2024-05-20 16:34:07] [INFO ] After 14639ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :10
[2024-05-20 16:34:08] [INFO ] State equation strengthened by 19900 read => feed constraints.
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.verifyPossible(DeadlockTester.java:645)
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:34:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 16:34:08] [INFO ] After 25389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 18 out of 21202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21202 transition count 40100
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20502 transition count 40100
Performed 9990 Post agglomeration using F-continuation condition.Transition count delta: 9990
Deduced a syphon composed of 9990 places in 19 ms
Reduce places removed 9990 places and 0 transitions.
Iterating global reduction 2 with 19980 rules applied. Total rules applied 21380 place count 10512 transition count 30110
Applied a total of 21380 rules in 7055 ms. Remains 10512 /21202 variables (removed 10690) and now considering 30110/40800 (removed 10690) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7060 ms. Remains : 10512/21202 places, 30110/40800 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 649 ms. (steps per millisecond=15 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) 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 9) 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 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 28 ms. (steps per millisecond=357 ) properties (out of 9) 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 9) 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 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 30110 rows 10512 cols
[2024-05-20 16:34:16] [INFO ] Computed 201 invariants in 280 ms
[2024-05-20 16:34:18] [INFO ] After 2111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-20 16:34:20] [INFO ] [Nat]Absence check using 101 positive place invariants in 223 ms returned sat
[2024-05-20 16:34:21] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 141 ms returned sat
[2024-05-20 16:34:43] [INFO ] After 21473ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-20 16:34:43] [INFO ] State equation strengthened by 29890 read => feed constraints.
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.verifyPossible(DeadlockTester.java:645)
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:34:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 16:34:43] [INFO ] After 25312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 10512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10512/10512 places, 30110/30110 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 10510 transition count 30108
Applied a total of 4 rules in 344 ms. Remains 10510 /10512 variables (removed 2) and now considering 30108/30110 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 344 ms. Remains : 10510/10512 places, 30108/30110 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 576 ms. (steps per millisecond=17 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) 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 7) 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 7) 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 7) 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 7) 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 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 30108 rows 10510 cols
[2024-05-20 16:34:45] [INFO ] Computed 201 invariants in 205 ms
[2024-05-20 16:34:47] [INFO ] After 1894ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-20 16:34:49] [INFO ] [Nat]Absence check using 101 positive place invariants in 262 ms returned sat
[2024-05-20 16:34:49] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 135 ms returned sat
[2024-05-20 16:35:12] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 11 out of 10510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10510/10510 places, 30108/30108 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 10508 transition count 30106
Applied a total of 4 rules in 340 ms. Remains 10508 /10510 variables (removed 2) and now considering 30106/30108 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 341 ms. Remains : 10508/10510 places, 30106/30108 transitions.
FORMULA CANConstruction-PT-100-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CANConstruction-PT-100-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 401 stabilizing places and 500 stable transitions
FORMULA CANConstruction-PT-100-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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)||(p0&&X(F(p1))))))'
Support contains 2 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 126 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2024-05-20 16:35:13] [INFO ] Computed 201 invariants in 393 ms
[2024-05-20 16:35:15] [INFO ] Implicit Places using invariants in 2214 ms returned []
Implicit Place search using SMT only with invariants took 2216 ms to find 0 implicit places.
[2024-05-20 16:35:15] [INFO ] Invariant cache hit.
[2024-05-20 16:35:17] [INFO ] Dead Transitions using invariants and state equation in 1787 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4139 ms. Remains : 21202/21202 places, 40800/40800 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 337 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GT 1 s8289), p0:(GT 1 s13795)], 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 timeout after 94480 steps with 31493 reset in 10001 ms.
Product exploration timeout after 97020 steps with 32340 reset in 10003 ms.
Computed a total of 401 stabilizing places and 500 stable transitions
Computed a total of 401 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-100-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-100-LTLCardinality-03 finished in 24925 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(X(F(p0)))))'
Support contains 1 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 123 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
[2024-05-20 16:35:37] [INFO ] Invariant cache hit.
[2024-05-20 16:35:39] [INFO ] Implicit Places using invariants in 1761 ms returned []
Implicit Place search using SMT only with invariants took 1764 ms to find 0 implicit places.
[2024-05-20 16:35:39] [INFO ] Invariant cache hit.
[2024-05-20 16:35:41] [INFO ] Dead Transitions using invariants and state equation in 1680 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3581 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ 1 s10149)], 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]]
Stuttering criterion allowed to conclude after 1903 steps with 0 reset in 65 ms.
FORMULA CANConstruction-PT-100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLCardinality-09 finished in 3879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21202 transition count 40100
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20502 transition count 40100
Performed 9999 Post agglomeration using F-continuation condition.Transition count delta: 9999
Deduced a syphon composed of 9999 places in 19 ms
Reduce places removed 9999 places and 0 transitions.
Iterating global reduction 2 with 19998 rules applied. Total rules applied 21398 place count 10503 transition count 30101
Applied a total of 21398 rules in 6085 ms. Remains 10503 /21202 variables (removed 10699) and now considering 30101/40800 (removed 10699) transitions.
// Phase 1: matrix 30101 rows 10503 cols
[2024-05-20 16:35:48] [INFO ] Computed 201 invariants in 203 ms
[2024-05-20 16:35:48] [INFO ] Implicit Places using invariants in 1204 ms returned []
Implicit Place search using SMT only with invariants took 1210 ms to find 0 implicit places.
[2024-05-20 16:35:49] [INFO ] Invariant cache hit.
[2024-05-20 16:35:50] [INFO ] Dead Transitions using invariants and state equation in 1007 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10503/21202 places, 30101/40800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8306 ms. Remains : 10503/21202 places, 30101/40800 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s3922)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 145 reset in 4009 ms.
Product exploration explored 100000 steps with 146 reset in 3974 ms.
Computed a total of 302 stabilizing places and 300 stable transitions
Computed a total of 302 stabilizing places and 300 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 82388 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82388 steps, saw 74761 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 16:36:01] [INFO ] Invariant cache hit.
[2024-05-20 16:36:03] [INFO ] [Real]Absence check using 101 positive place invariants in 234 ms returned sat
[2024-05-20 16:36:03] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 119 ms returned sat
[2024-05-20 16:36:26] [INFO ] After 23000ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 16:36:26] [INFO ] State equation strengthened by 29899 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.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
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:36:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 16:36:26] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 10503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10503/10503 places, 30101/30101 transitions.
Applied a total of 0 rules in 184 ms. Remains 10503 /10503 variables (removed 0) and now considering 30101/30101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 10503/10503 places, 30101/30101 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 82668 steps, run timeout after 3002 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82668 steps, saw 74795 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 16:36:30] [INFO ] Invariant cache hit.
[2024-05-20 16:36:31] [INFO ] [Real]Absence check using 101 positive place invariants in 252 ms returned sat
[2024-05-20 16:36:32] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 118 ms returned sat
[2024-05-20 16:36:53] [INFO ] After 21666ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 16:36:54] [INFO ] State equation strengthened by 29899 read => feed constraints.
[2024-05-20 16:36:55] [INFO ] After 1602ms SMT Verify possible using 29899 Read/Feed constraints in real domain returned unsat :0 sat :0
[2024-05-20 16:36:55] [INFO ] After 25030ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 10503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10503/10503 places, 30101/30101 transitions.
Applied a total of 0 rules in 164 ms. Remains 10503 /10503 variables (removed 0) and now considering 30101/30101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 10503/10503 places, 30101/30101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10503/10503 places, 30101/30101 transitions.
Applied a total of 0 rules in 162 ms. Remains 10503 /10503 variables (removed 0) and now considering 30101/30101 (removed 0) transitions.
[2024-05-20 16:36:55] [INFO ] Invariant cache hit.
[2024-05-20 16:36:56] [INFO ] Implicit Places using invariants in 928 ms returned []
Implicit Place search using SMT only with invariants took 948 ms to find 0 implicit places.
[2024-05-20 16:36:56] [INFO ] Invariant cache hit.
[2024-05-20 16:36:57] [INFO ] Dead Transitions using invariants and state equation in 900 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2032 ms. Remains : 10503/10503 places, 30101/30101 transitions.
Graph (trivial) has 29798 edges and 10503 vertex of which 10099 / 10503 are part of one of the 100 SCC in 9 ms
Free SCC test removed 9999 places
Drop transitions removed 19898 transitions
Ensure Unique test removed 9799 transitions
Reduce isomorphic transitions removed 29697 transitions.
Graph (complete) has 1005 edges and 504 vertex of which 4 are kept as prefixes of interest. Removing 500 places using SCC suffix rule.1 ms
Discarding 500 places :
Also discarding 397 output transitions
Drop transitions removed 397 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 4 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 4 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 2 transition count 3
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 2 transition count 3
Applied a total of 9 rules in 189 ms. Remains 2 /10503 variables (removed 10501) and now considering 3/30101 (removed 30098) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2024-05-20 16:36:58] [INFO ] Computed 0 invariants in 2 ms
[2024-05-20 16:36:58] [INFO ] After 5ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 16:36:58] [INFO ] After 10ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 16:36:58] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 10503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10503/10503 places, 30101/30101 transitions.
Applied a total of 0 rules in 242 ms. Remains 10503 /10503 variables (removed 0) and now considering 30101/30101 (removed 0) transitions.
// Phase 1: matrix 30101 rows 10503 cols
[2024-05-20 16:36:58] [INFO ] Computed 201 invariants in 219 ms
[2024-05-20 16:36:59] [INFO ] Implicit Places using invariants in 1237 ms returned []
Implicit Place search using SMT only with invariants took 1241 ms to find 0 implicit places.
[2024-05-20 16:36:59] [INFO ] Invariant cache hit.
[2024-05-20 16:37:00] [INFO ] Dead Transitions using invariants and state equation in 888 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2390 ms. Remains : 10503/10503 places, 30101/30101 transitions.
Computed a total of 302 stabilizing places and 300 stable transitions
Computed a total of 302 stabilizing places and 300 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1215 steps, including 1 resets, run visited all 1 properties in 49 ms. (steps per millisecond=24 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 143 reset in 3678 ms.
Product exploration explored 100000 steps with 144 reset in 3861 ms.
Built C files in :
/tmp/ltsmin16069791425076212706
[2024-05-20 16:37:09] [INFO ] Too many transitions (30101) to apply POR reductions. Disabling POR matrices.
[2024-05-20 16:37:09] [INFO ] Built C files in 302ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16069791425076212706
Running compilation step : cd /tmp/ltsmin16069791425076212706;'/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/ltsmin16069791425076212706;'/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/ltsmin16069791425076212706;'/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 1 out of 10503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10503/10503 places, 30101/30101 transitions.
Applied a total of 0 rules in 269 ms. Remains 10503 /10503 variables (removed 0) and now considering 30101/30101 (removed 0) transitions.
[2024-05-20 16:37:12] [INFO ] Invariant cache hit.
[2024-05-20 16:37:13] [INFO ] Implicit Places using invariants in 1038 ms returned []
Implicit Place search using SMT only with invariants took 1044 ms to find 0 implicit places.
[2024-05-20 16:37:13] [INFO ] Invariant cache hit.
[2024-05-20 16:37:14] [INFO ] Dead Transitions using invariants and state equation in 1015 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2332 ms. Remains : 10503/10503 places, 30101/30101 transitions.
Built C files in :
/tmp/ltsmin4246954643353126615
[2024-05-20 16:37:14] [INFO ] Too many transitions (30101) to apply POR reductions. Disabling POR matrices.
[2024-05-20 16:37:15] [INFO ] Built C files in 239ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4246954643353126615
Running compilation step : cd /tmp/ltsmin4246954643353126615;'/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/ltsmin4246954643353126615;'/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/ltsmin4246954643353126615;'/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:37:19] [INFO ] Flatten gal took : 519 ms
[2024-05-20 16:37:20] [INFO ] Flatten gal took : 556 ms
[2024-05-20 16:37:20] [INFO ] Time to serialize gal into /tmp/LTL17424775297616675794.gal : 157 ms
[2024-05-20 16:37:20] [INFO ] Time to serialize properties into /tmp/LTL10337743532960096326.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/LTL17424775297616675794.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8102869221189399858.hoa' '-atoms' '/tmp/LTL10337743532960096326.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10337743532960096326.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8102869221189399858.hoa
Detected timeout of ITS tools.
[2024-05-20 16:37:36] [INFO ] Flatten gal took : 672 ms
[2024-05-20 16:37:37] [INFO ] Flatten gal took : 576 ms
[2024-05-20 16:37:37] [INFO ] Time to serialize gal into /tmp/LTL8136507220662763274.gal : 110 ms
[2024-05-20 16:37:37] [INFO ] Time to serialize properties into /tmp/LTL14386338307612521874.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/LTL8136507220662763274.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14386338307612521874.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("(Node33GiveAnswer53<1)"))))
Formula 0 simplified : FG!"(Node33GiveAnswer53<1)"
Detected timeout of ITS tools.
[2024-05-20 16:37:53] [INFO ] Flatten gal took : 566 ms
[2024-05-20 16:37:53] [INFO ] Applying decomposition
[2024-05-20 16:37:53] [INFO ] Flatten gal took : 576 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/graph7523555258255952838.txt' '-o' '/tmp/graph7523555258255952838.bin' '-w' '/tmp/graph7523555258255952838.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7523555258255952838.bin' '-l' '-1' '-v' '-w' '/tmp/graph7523555258255952838.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:37:55] [INFO ] Decomposing Gal with order
[2024-05-20 16:37:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:38:01] [INFO ] Removed a total of 29522 redundant transitions.
[2024-05-20 16:38:02] [INFO ] Flatten gal took : 5739 ms
[2024-05-20 16:38:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 29399 labels/synchronizations in 8896 ms.
[2024-05-20 16:38:11] [INFO ] Time to serialize gal into /tmp/LTL12625068121521253713.gal : 143 ms
[2024-05-20 16:38:11] [INFO ] Time to serialize properties into /tmp/LTL14562747431436694554.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/LTL12625068121521253713.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14562747431436694554.ltl' '-c' '-stutter-deadlock'

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...256
Read 1 LTL properties
Checking formula 0 : !((G(F("(u54.Node33GiveAnswer53<1)"))))
Formula 0 simplified : FG!"(u54.Node33GiveAnswer53<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12742767448402289855
[2024-05-20 16:38:27] [INFO ] Built C files in 216ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12742767448402289855
Running compilation step : cd /tmp/ltsmin12742767448402289855;'/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/ltsmin12742767448402289855;'/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/ltsmin12742767448402289855;'/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-100-LTLCardinality-12 finished in 168573 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 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 127 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2024-05-20 16:38:30] [INFO ] Computed 201 invariants in 464 ms
[2024-05-20 16:38:32] [INFO ] Implicit Places using invariants in 2405 ms returned []
Implicit Place search using SMT only with invariants took 2407 ms to find 0 implicit places.
[2024-05-20 16:38:32] [INFO ] Invariant cache hit.
[2024-05-20 16:38:34] [INFO ] Dead Transitions using invariants and state equation in 1885 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4421 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLCardinality-13 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:(AND (GT s6775 s5193) (GT 1 s8514))], 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 1 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLCardinality-13 finished in 4610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(G(!p0))))))'
Support contains 1 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 130 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
[2024-05-20 16:38:35] [INFO ] Invariant cache hit.
[2024-05-20 16:38:36] [INFO ] Implicit Places using invariants in 1915 ms returned []
Implicit Place search using SMT only with invariants took 1917 ms to find 0 implicit places.
[2024-05-20 16:38:36] [INFO ] Invariant cache hit.
[2024-05-20 16:38:38] [INFO ] Dead Transitions using invariants and state equation in 1906 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3955 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, p0, p0, true, true, true]
Running random walk in product with property : CANConstruction-PT-100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(GT 1 s17156)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLCardinality-15 finished in 4289 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)))'
[2024-05-20 16:38:40] [INFO ] Flatten gal took : 972 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7522919402749335127
[2024-05-20 16:38:40] [INFO ] Too many transitions (40800) to apply POR reductions. Disabling POR matrices.
[2024-05-20 16:38:41] [INFO ] Built C files in 280ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7522919402749335127
Running compilation step : cd /tmp/ltsmin7522919402749335127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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:38:41] [INFO ] Applying decomposition
[2024-05-20 16:38:42] [INFO ] Flatten gal took : 1064 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/graph10408834365774120579.txt' '-o' '/tmp/graph10408834365774120579.bin' '-w' '/tmp/graph10408834365774120579.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10408834365774120579.bin' '-l' '-1' '-v' '-w' '/tmp/graph10408834365774120579.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:38:45] [INFO ] Decomposing Gal with order
[2024-05-20 16:38:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:38:52] [INFO ] Removed a total of 17083 redundant transitions.
[2024-05-20 16:38:53] [INFO ] Flatten gal took : 2464 ms
[2024-05-20 16:38:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 162 labels/synchronizations in 375 ms.
[2024-05-20 16:38:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality630709102590187044.gal : 258 ms
[2024-05-20 16:38:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality9745697047424181747.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/LTLCardinality630709102590187044.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9745697047424181747.ltl' '-c' '-stutter-deadlock'

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("(i90.i0.u263.Node33GiveAnswer53<1)"))))
Formula 0 simplified : FG!"(i90.i0.u263.Node33GiveAnswer53<1)"
ITS-tools command line returned an error code 137
[2024-05-20 16:48:14] [INFO ] Flatten gal took : 1281 ms
[2024-05-20 16:48:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality18309398223233869841.gal : 645 ms
[2024-05-20 16:48:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality11618468460757936603.ltl : 161 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/LTLCardinality18309398223233869841.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11618468460757936603.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 1 LTL properties
Checking formula 0 : !((G(F("(Node33GiveAnswer53<1)"))))
Formula 0 simplified : FG!"(Node33GiveAnswer53<1)"
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/ltsmin7522919402749335127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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 720 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7522919402749335127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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 720 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)
Detected timeout of ITS tools.
[2024-05-20 17:10:04] [INFO ] Flatten gal took : 1228 ms
[2024-05-20 17:10:06] [INFO ] Input system was already deterministic with 40800 transitions.
[2024-05-20 17:10:07] [INFO ] Transformed 21202 places.
[2024-05-20 17:10:07] [INFO ] Transformed 40800 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-20 17:10:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality16847877551722115502.gal : 115 ms
[2024-05-20 17:10:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality131740095766001171.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/LTLCardinality16847877551722115502.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality131740095766001171.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(Node33GiveAnswer53<1)"))))
Formula 0 simplified : FG!"(Node33GiveAnswer53<1)"
ITS-tools command line returned an error code 137
Total runtime 3233043 ms.

BK_STOP 1716226040760

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-100"
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-100, 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-171620521400052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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